default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel McKenzie
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nicolás García Trillos, Anna V. Little, Daniel McKenzie, James M. Murphy:
Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithms. J. Mach. Learn. Res. 25: 176:1-176:65 (2024)- [i16]Antony Sikorski, Daniel McKenzie, Douglas Nychka:
Normalizing Basis Functions: Approximate Stationary Models for Large Spatial Data. CoRR abs/2405.13821 (2024) - [i15]Brandon Knutson, Amandin Chyba Rabeendran, Michael I. Ivanitskiy, Jordan Pettyjohn, Cecilia G. Diniz Behn, Samy Wu Fung, Daniel McKenzie:
On Logical Extrapolation for Mazes with Recurrent and Implicit Networks. CoRR abs/2410.03020 (2024) - 2023
- [i14]Daniel McKenzie, Samy Wu Fung, Howard Heaton:
Faster Predict-and-Optimize with Three-Operator Splitting. CoRR abs/2301.13395 (2023) - [i13]Leon Bungert, Nicolás García Trillos, Matt Jacobs, Daniel McKenzie, Dorde Nikolic, Qingsong Wang:
It begins with a boundary: A geometric view on probabilistically robust learning. CoRR abs/2305.18779 (2023) - [i12]Nicolás García Trillos, Anna V. Little, Daniel McKenzie, James M. Murphy:
Fermat Distances: Metric Approximation, Spectral Convergence, and Clustering Algorithms. CoRR abs/2307.05750 (2023) - 2022
- [j3]HanQin Cai
, Daniel McKenzie, Wotao Yin, Zhenliang Zhang:
Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. SIAM J. Optim. 32(2): 687-714 (2022) - [j2]Anna V. Little, Daniel McKenzie, James M. Murphy:
Balancing Geometry and Density: Path Distances on High-Dimensional Data. SIAM J. Math. Data Sci. 4(1): 72-99 (2022) - [c4]Samy Wu Fung, Howard Heaton, Qiuwei Li, Daniel McKenzie, Stanley J. Osher, Wotao Yin:
JFB: Jacobian-Free Backpropagation for Implicit Networks. AAAI 2022: 6648-6656 - 2021
- [c3]HanQin Cai, Yuchen Lou, Daniel McKenzie, Wotao Yin:
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization. ICML 2021: 1193-1203 - [i11]HanQin Cai, Yuchen Lou, Daniel McKenzie, Wotao Yin:
A Zeroth-Order Block Coordinate Descent Algorithm for Huge-Scale Black-Box Optimization. CoRR abs/2102.10707 (2021) - [i10]Samy Wu Fung, Howard Heaton, Qiuwei Li, Daniel McKenzie, Stanley J. Osher, Wotao Yin:
Fixed Point Networks: Implicit Depth Models with Jacobian-Free Backprop. CoRR abs/2103.12803 (2021) - [i9]Howard Heaton, Daniel McKenzie, Qiuwei Li, Samy Wu Fung, Stanley J. Osher, Wotao Yin:
Learn to Predict Equilibria via Fixed Point Networks. CoRR abs/2106.00906 (2021) - [i8]Bum-Su Kim, HanQin Cai, Daniel McKenzie, Wotao Yin:
Curvature-Aware Derivative-Free Optimization. CoRR abs/2109.13391 (2021) - 2020
- [j1]Ming-Jun Lai, Daniel McKenzie:
Compressive Sensing for Cut Improvement and Local Clustering. SIAM J. Math. Data Sci. 2(2): 368-395 (2020) - [c2]Mariam Alaverdian, William Gilroy, Veronica Kirgios, Xia Li, Carolina Matuk, Daniel McKenzie, Tachin Ruangkriengsin, Andrea L. Bertozzi, P. Jeffrey Brantingham:
Who killed Lilly Kane? A case study in applying knowledge graphs to crime fiction. IEEE BigData 2020: 2508-2512 - [i7]HanQin Cai, Daniel McKenzie, Wotao Yin, Zhenliang Zhang:
Zeroth-Order Regularized Optimization (ZORO): Approximately Sparse Gradients and Adaptive Sampling. CoRR abs/2003.13001 (2020) - [i6]HanQin Cai, Daniel McKenzie, Wotao Yin, Zhenliang Zhang:
SCOBO: Sparsity-Aware Comparison Oracle Based Optimization. CoRR abs/2010.02479 (2020) - [i5]Mariam Alaverdian, William Gilroy, Veronica Kirgios, Xia Li, Carolina Matuk, Daniel McKenzie, Tachin Ruangkriengsin, Andrea L. Bertozzi, P. Jeffrey Brantingham:
Who killed Lilly Kane? A case study in applying knowledge graphs to crime fiction. CoRR abs/2011.11804 (2020) - [i4]Anna V. Little, Daniel McKenzie, James M. Murphy:
Balancing Geometry and Density: Path Distances on High-Dimensional Data. CoRR abs/2012.09385 (2020)
2010 – 2019
- 2019
- [i3]Daniel McKenzie, Steven Damelin:
Power Weighted Shortest Paths for Unsupervised Learning. CoRR abs/1905.13345 (2019) - 2018
- [i2]Ming-Jun Lai, Daniel McKenzie:
Semi-Supervised Cluster Extraction via a Compressive Sensing Approach. CoRR abs/1808.05780 (2018) - 2017
- [i1]Ming-Jun Lai, Daniel McKenzie:
A Compressive Sensing Approach to Community Detection with Applications. CoRR abs/1708.09477 (2017)
2000 – 2009
- 2009
- [c1]Saturnino Luz, Masood Masoodian, Daniel McKenzie, Wim Vanden Broeck:
Chronos: A Tool for Interactive Scheduling and Visualisation of Task Hierarchies. IV 2009: 241-246
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
