| Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow YT Lee, A Sidford 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 424-433, 2014 | 448* | 2014 |
| A faster cutting plane method and its implications for combinatorial and convex optimization YT Lee, A Sidford, SC Wong 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1049-1065, 2015 | 360 | 2015 |
| Accelerated methods for nonconvex optimization Y Carmon, JC Duchi, O Hinder, A Sidford SIAM Journal on Optimization 28 (2), 1751-1772, 2018 | 357 | 2018 |
| An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations JA Kelner, YT Lee, L Orecchia, A Sidford Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 337 | 2014 |
| Lower bounds for finding stationary points I Y Carmon, JC Duchi, O Hinder, A Sidford Mathematical Programming 184 (1), 71-120, 2020 | 328 | 2020 |
| A simple, combinatorial algorithm for solving SDD systems in nearly-linear time JA Kelner, L Orecchia, A Sidford, ZA Zhu Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 295 | 2013 |
| Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems YT Lee, A Sidford 2013 ieee 54th annual symposium on foundations of computer science, 147-156, 2013 | 288 | 2013 |
| Near-optimal time and sample complexities for solving Markov decision processes with a generative model A Sidford, M Wang, X Wu, L Yang, Y Ye Advances in Neural Information Processing Systems 31, 2018 | 270 | 2018 |
| Uniform sampling for matrix approximation MB Cohen, YT Lee, C Musco, C Musco, R Peng, A Sidford Proceedings of the 2015 conference on innovations in theoretical computer …, 2015 | 258 | 2015 |
| Large-scale methods for distributionally robust optimization D Levy, Y Carmon, JC Duchi, A Sidford Advances in Neural Information Processing Systems 33, 8847-8860, 2020 | 230 | 2020 |
| Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification P Jain, SM Kakade, R Kidambi, P Netrapalli, A Sidford Journal of machine learning research 18 (223), 1-42, 2018 | 219* | 2018 |
| Geometric median in nearly linear time MB Cohen, YT Lee, G Miller, J Pachocki, A Sidford Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 199 | 2016 |
| Efficient inverse maintenance and faster algorithms for linear programming YT Lee, A Sidford 2015 IEEE 56th annual symposium on foundations of computer science, 230-249, 2015 | 184 | 2015 |
| Single pass spectral sparsification in dynamic streams M Kapralov, YT Lee, CN Musco, CP Musco, A Sidford SIAM Journal on Computing 46 (1), 456-477, 2017 | 173 | 2017 |
| Un-regularizing: approximate proximal point and faster stochastic algorithms for empirical risk minimization R Frostig, R Ge, S Kakade, A Sidford International Conference on Machine Learning, 2540-2548, 2015 | 173 | 2015 |
| “Convex until proven guilty”: dimension-free acceleration of gradient descent on non-convex functions Y Carmon, JC Duchi, O Hinder, A Sidford International conference on machine learning, 654-663, 2017 | 171 | 2017 |
| Streaming pca: Matching matrix bernstein and near-optimal finite sample guarantees for oja’s algorithm P Jain, C Jin, SM Kakade, P Netrapalli, A Sidford Conference on learning theory, 1147-1164, 2016 | 159 | 2016 |
| Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances J Van Den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, ... Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 150 | 2021 |
| Variance reduced value iteration and faster algorithms for solving Markov decision processes A Sidford, M Wang, X Wu, Y Ye Naval Research Logistics (NRL) 70 (5), 423-442, 2023 | 145 | 2023 |
| Accelerating stochastic gradient descent for least squares regression P Jain, SM Kakade, R Kidambi, P Netrapalli, A Sidford Conference On Learning Theory, 545-604, 2018 | 136 | 2018 |