Robustness Implies Generalization via Data-Dependent Generalization Bounds.
Proceedings of the International Conference on Machine Learning, 2022
A nonuniform Littlewood-Offord inequality for all norms.
Discret. Math., 2021
Resilience of the rank of random matrices.
Comb. Probab. Comput., 2021
Eigenvector delocalization for non-Hermitian random matrices and applications.
Random Struct. Algorithms, 2020
How fast do quantum walks mix?
CoRR, 2020
A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Rates.
Proceedings of the Conference on Learning Theory, 2020
On analog quantum algorithms for the mixing of Markov chains.
CoRR, 2019
Sparse Reconstruction from Hadamard Matrices: A Lower Bound.
CoRR, 2019
Four Deviations Suffice for Rank 1 Matrices.
CoRR, 2019
An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
Packing Loose Hamilton Cycles.
Comb. Probab. Comput., 2017
Dictionary Learning With Few Samples and Matrix Concentration.
IEEE Trans. Inf. Theory, 2016
Random Matrices: l1 Concentration and Dictionary Learning with Few Samples.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
Large-Deviation Bounds for Sampling without Replacement.
Am. Math. Mon., 2014
Community Detection Using Spectral Clustering on Sparse Geosocial Data.
,
,
,
,
,
,
,
,
,
,
,
SIAM J. Appl. Math., 2013