default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKyle Luh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c4]Kenji Kawaguchi, Zhun Deng, Kyle Luh, Jiaoyang Huang:
Robustness Implies Generalization via Data-Dependent Generalization Bounds. ICML 2022: 10866-10894- [i7]Kenji Kawaguchi, Zhun Deng, Kyle Luh, Jiaoyang Huang:
Robustness Implies Generalization via Data-Dependent Generalization Bounds. CoRR abs/2206.13497 (2022) - 2021
- [j7]Asaf Ferber, Kyle Luh, Gweneth McKinley:
Resilience of the rank of random matrices. Comb. Probab. Comput. 30(2): 163-174 (2021) - [j6]Kyle Luh
, David Xiang:
A nonuniform Littlewood-Offord inequality for all norms. Discret. Math. 344(6): 112366 (2021) - 2020
- [j5]Kyle Luh, Sean O'Rourke:
Eigenvector delocalization for non-Hermitian random matrices and applications. Random Struct. Algorithms 57(1): 169-210 (2020) - [c3]Zhixian Lei, Kyle Luh, Prayaag Venkat, Fred Zhang:
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates. COLT 2020: 2598-2612 - [i6]Shantanav Chakraborty, Kyle Luh, Jérémie Roland:
How fast do quantum walks mix? CoRR abs/2001.06305 (2020)
2010 – 2019
- 2019
- [c2]Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek, Shravas Rao:
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices. FOCS 2019: 1564-1567 - [i5]Rasmus Kyng, Kyle Luh, Zhao Song:
Four Deviations Suffice for Rank 1 Matrices. CoRR abs/1901.06731 (2019) - [i4]Jaroslaw Blasiok, Patrick Lopatto, Kyle Luh, Jake Marcinek:
Sparse Reconstruction from Hadamard Matrices: A Lower Bound. CoRR abs/1903.12135 (2019) - [i3]Shantanav Chakraborty, Kyle Luh, Jérémie Roland:
On analog quantum algorithms for the mixing of Markov chains. CoRR abs/1904.11895 (2019) - [i2]Zhixian Lei, Kyle Luh, Prayaag Venkat, Fred Zhang:
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates. CoRR abs/1908.04468 (2019) - 2017
- [j4]Asaf Ferber, Kyle Luh, Daniel Montealegre, Oanh Nguyen:
Packing Loose Hamilton Cycles. Comb. Probab. Comput. 26(6): 839-849 (2017) - 2016
- [j3]Kyle Luh, Van H. Vu:
Dictionary Learning With Few Samples and Matrix Concentration. IEEE Trans. Inf. Theory 62(3): 1516-1527 (2016) - 2015
- [c1]Kyle Luh, Van Vu:
Random Matrices: l1 Concentration and Dictionary Learning with Few Samples. FOCS 2015: 1409-1425 - 2014
- [j2]Kyle Luh, Nicholas Pippenger:
Large-Deviation Bounds for Sampling without Replacement. Am. Math. Mon. 121(5): 449-454 (2014) - 2013
- [j1]Yves van Gennip, Blake Hunter, Raymond Ahn, Peter Elliott, Kyle Luh, Megan Halvorson, Shannon Reid, Matthew Valasik, James Wo, George E. Tita, Andrea L. Bertozzi, P. Jeffrey Brantingham:
Community Detection Using Spectral Clustering on Sparse Geosocial Data. SIAM J. Appl. Math. 73(1): 67-83 (2013) - 2012
- [i1]Yves van Gennip, Blake Hunter, Raymond Ahn, Peter Elliott, Kyle Luh, Megan Halvorson, Shannon Reid, Matthew Valasik, James Wo, George E. Tita, Andrea L. Bertozzi, P. Jeffrey Brantingham:
Community detection using spectral clustering on sparse geosocial data. CoRR abs/1206.4969 (2012)
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-10-07 21:19 CEST 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:
