| Publication | Date of Publication | Type |
|---|
| No quantum speedup over gradient descent for non-smooth convex optimization | 2026-04-15 | Paper |
| Online non-convex learning: following the perturbed leader is optimal | 2025-02-19 | Paper |
| Leverage score sampling for faster accelerated regression and ERM | 2025-02-19 | Paper |
| Optimistic MLE: a generic model-based algorithm for partially observable sequential decision making | 2024-05-08 | Paper |
On Nonconvex Optimization for Machine Learning
Journal of the ACM | 2022-12-08 | Paper |
Spectrum Approximation Beyond Fast Matrix Multiplication: Algorithms and Hardness
(available as arXiv preprint) | 2021-06-15 | Paper |
Making the last iterate of SGD information theoretically optimal
SIAM Journal on Optimization | 2021-05-03 | Paper |
A Markov Chain Theory Approach to Characterizing the Minimax Optimality of Stochastic Gradient Descent (for Least Squares)
(available as arXiv preprint) | 2020-11-25 | Paper |
| A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm | 2019-02-11 | Paper |
A Short Note on Concentration Inequalities for Random Vectors with SubGaussian Norm
(available as arXiv preprint) | 2019-01-01 | Paper |
Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification
(available as arXiv preprint) | 2018-11-22 | Paper |
| Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification | 2018-11-22 | Paper |
Phase Retrieval Using Alternating Minimization
IEEE Transactions on Signal Processing | 2018-08-22 | Paper |
A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries
IEEE Transactions on Information Theory | 2017-05-02 | Paper |
Learning planar Ising models
(available as arXiv preprint) | 2017-01-05 | Paper |
| Learning planar Ising models | 2017-01-05 | Paper |
Learning sparsely used overcomplete dictionaries via alternating minimization
SIAM Journal on Optimization | 2016-12-21 | Paper |
Learning sparsely used overcomplete dictionaries via alternating minimization
SIAM Journal on Optimization | 2016-12-21 | Paper |
| Information-theoretic thresholds for community detection in sparse networks | 2016-07-06 | Paper |
| Fast Exact Matrix Completion with Finite Samples | 2014-11-04 | Paper |
Low-rank matrix completion using alternating minimization
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
| Non-Reconstructability in the Stochastic Block Model | 2014-04-24 | Paper |
Non-Reconstructability in the Stochastic Block Model
(available as arXiv preprint) | 2014-01-01 | Paper |
Fast Exact Matrix Completion with Finite Samples
(available as arXiv preprint) | 2014-01-01 | Paper |
