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 | 149 | 2013 |

Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems YT Lee, A Sidford arXiv preprint arXiv:1305.1922, 2013 | 138 | 2013 |

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 | 128 | 2014 |

Path finding methods for linear programming: Solving linear programs in O (vrank) iterations and faster algorithms for maximum flow YT Lee, A Sidford Foundations of Computer Science (FOCS), 2014 IEEE 55th Annual Symposium on …, 2014 | 113* | 2014 |

Accelerated methods for nonconvex optimization Y Carmon, JC Duchi, O Hinder, A Sidford SIAM Journal on Optimization 28 (2), 1751-1772, 2018 | 90 | 2018 |

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 | 83 | 2015 |

A faster cutting plane method and its implications for combinatorial and convex optimization YT Lee, A Sidford, SC Wong Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on …, 2015 | 81 | 2015 |

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 | 79 | 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 | 66 | 2017 |

Robust shift-and-invert preconditioning: Faster and more sample efficient algorithms for eigenvector computation D Garber, E Hazan, C Jin, SM Kakade, C Musco, P Netrapalli, A Sidford ICML, 2016 | 64* | 2016 |

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 | 58* | 2016 |

Competing with the empirical risk minimizer in a single pass R Frostig, R Ge, SM Kakade, A Sidford Conference on learning theory, 728-763, 2015 | 55 | 2015 |

Efficient inverse maintenance and faster algorithms for linear programming YT Lee, A Sidford Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on …, 2015 | 33 | 2015 |

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 | 32 | 2016 |

" Convex Until Proven Guilty": Dimension-Free Acceleration of Gradient Descent on Non-Convex Functions Y Carmon, O Hinder, JC Duchi, A Sidford arXiv preprint arXiv:1705.02766, 2017 | 30 | 2017 |

Efficient algorithms for large-scale generalized eigenvector computation and canonical correlation analysis R Ge, C Jin, P Netrapalli, A Sidford International Conference on Machine Learning, 2741-2750, 2016 | 26 | 2016 |

Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification P Jain, SM Kakade, R Kidambi, P Netrapalli, A Sidford | 25* | 2018 |

Almost-linear-time algorithms for markov chains and new spectral primitives for directed graphs MB Cohen, J Kelner, J Peebles, R Peng, AB Rao, A Sidford, A Vladu Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 23 | 2017 |

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 | 18* | 2018 |

Lower bounds for finding stationary points I Y Carmon, JC Duchi, O Hinder, A Sidford arXiv preprint arXiv:1710.11606, 2017 | 17 | 2017 |