| Why random reshuffling beats stochastic gradient descent M Gürbüzbalaban, A Ozdaglar, PA Parrilo Mathematical Programming 186, 49-84, 2021 | 150 | 2021 |
| A tail-index analysis of stochastic gradient noise in deep neural networks U Simsekli, L Sagun, M Gurbuzbalaban International Conference on Machine Learning, 5827-5837, 2019 | 145 | 2019 |
| On the convergence rate of incremental aggregated gradient algorithms M Gurbuzbalaban, A Ozdaglar, PA Parrilo SIAM Journal on Optimization 27 (2), 1035-1048, 2017 | 136 | 2017 |
| The heavy-tail phenomenon in SGD M Gurbuzbalaban, U Simsekli, L Zhu International Conference on Machine Learning, 3964-3975, 2021 | 58 | 2021 |
| Global Convergence of Stochastic Gradient Hamiltonian Monte Carlo for Non-Convex Stochastic Optimization: Non-Asymptotic Performance Bounds and Momentum-Based Acceleration X Gao, M Gurbuzbalaban, Z Lingjiong arXiv preprint arXiv:1809.04618, 2018 | 56* | 2018 |
| Fast Approximation of the Norm via Optimization over Spectral Value Sets N Guglielmi, M Gürbüzbalaban, ML Overton SIAM Journal on Matrix Analysis and Applications 34 (2), 709-737, 2013 | 56 | 2013 |
| Global convergence rate of proximal incremental aggregated gradient methods ND Vanli, M Gurbuzbalaban, A Ozdaglar SIAM Journal on Optimization 28 (2), 1282-1300, 2018 | 51 | 2018 |
| A globally convergent incremental Newton method M Gürbüzbalaban, A Ozdaglar, P Parrilo Mathematical Programming 151 (1), 283-313, 2015 | 49 | 2015 |
| Robust accelerated gradient methods for smooth strongly convex functions NS Aybat, A Fallah, M Gurbuzbalaban, A Ozdaglar SIAM Journal on Optimization 30 (1), 717-751, 2020 | 46 | 2020 |
| A universally optimal multistage accelerated stochastic gradient method NS Aybat, A Fallah, M Gurbuzbalaban, A Ozdaglar Advances in neural information processing systems 32, 2019 | 42 | 2019 |
| Convergence rate of incremental gradient and incremental Newton methods M Gurbuzbalaban, A Ozdaglar, PA Parrilo SIAM Journal on Optimization 29 (4), 2542-2565, 2019 | 42 | 2019 |
| Fractional underdamped langevin dynamics: Retargeting sgd with momentum under heavy-tailed gradient noise U Simsekli, L Zhu, YW Teh, M Gurbuzbalaban International conference on machine learning, 8970-8980, 2020 | 37 | 2020 |
| Surpassing gradient descent provably: A cyclic incremental method with linear convergence rate A Mokhtari, M Gurbuzbalaban, A Ribeiro SIAM Journal on Optimization 28 (2), 1420-1447, 2018 | 34 | 2018 |
| First exit time analysis of stochastic gradient descent under heavy-tailed gradient noise TH Nguyen, U Simsekli, M Gurbuzbalaban, G Richard Advances in neural information processing systems 32, 2019 | 33 | 2019 |
| On Nesterov’s nonsmooth Chebyshev–Rosenbrock functions M Gürbüzbalaban, ML Overton Nonlinear Analysis: Theory, Methods & Applications 75 (3), 1282-1289, 2012 | 32 | 2012 |
| When cyclic coordinate descent outperforms randomized coordinate descent M Gurbuzbalaban, A Ozdaglar, PA Parrilo, N Vanli Advances in Neural Information Processing Systems 30, 2017 | 31 | 2017 |
| Accelerated linear convergence of stochastic momentum methods in wasserstein distances B Can, M Gurbuzbalaban, L Zhu International Conference on Machine Learning, 891-901, 2019 | 28 | 2019 |
| Robust distributed accelerated stochastic gradient methods for multi-agent networks A Fallah, M Gurbuzbalaban, A Ozdaglar, U Simsekli, L Zhu | 23 | 2019 |
| Explicit solutions for root optimization of a polynomial family with one affine constraint VD Blondel, M Gurbuzbalaban, A Megretski, ML Overton IEEE transactions on automatic control 57 (12), 3078-3089, 2012 | 22 | 2012 |
| Breaking reversibility accelerates Langevin dynamics for global non-convex optimization X Gao, M Gurbuzbalaban, L Zhu arXiv preprint arXiv:1812.07725, 2018 | 20 | 2018 |
Asuman OzdaglarEECS, MITVerified email at mit.edu
