| Making gradient descent optimal for strongly convex stochastic optimization A Rakhlin, O Shamir, K Sridharan International Conference on Machine Learning (ICML), 2011 | 846 | 2011 |
| Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis M Raginsky, A Rakhlin, M Telgarsky Conference on Learning Theory, 1674-1703, 2017 | 582 | 2017 |
| Size-independent sample complexity of neural networks N Golowich, A Rakhlin, O Shamir Conference On Learning Theory, 297-299, 2018 | 480 | 2018 |
| Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization. JD Abernethy, E Hazan, A Rakhlin COLT, 263-274, 2008 | 428 | 2008 |
| Optimization, learning, and games with predictable sequences S Rakhlin, K Sridharan Advances in Neural Information Processing Systems 26, 2013 | 423 | 2013 |
| Just interpolate: Kernel “ridgeless” regression can generalize T Liang, A Rakhlin | 397 | 2020 |
| Online learning with predictable sequences A Rakhlin, K Sridharan Conference on Learning Theory, 993-1019, 2013 | 381 | 2013 |
| Deep learning: a statistical viewpoint PL Bartlett, A Montanari, A Rakhlin Acta numerica 30, 87-201, 2021 | 357 | 2021 |
| Online optimization: Competing with dynamic comparators A Jadbabaie, A Rakhlin, S Shahrampour, K Sridharan Artificial Intelligence and Statistics, 398-406, 2015 | 321 | 2015 |
| Adaptive online gradient descent PL Bartlett, E Hazan, A Rakhlin Advances in Neural Information Processing Systems, 65-72, 2007 | 277* | 2007 |
| Fisher-rao metric, geometry, and complexity of neural networks T Liang, T Poggio, A Rakhlin, J Stokes The 22nd international conference on artificial intelligence and statistics …, 2019 | 264 | 2019 |
| Does data interpolation contradict statistical optimality? M Belkin, A Rakhlin, AB Tsybakov The 22nd International Conference on Artificial Intelligence and Statistics …, 2019 | 249 | 2019 |
| Stochastic convex optimization with bandit feedback A Agarwal, DP Foster, DJ Hsu, SM Kakade, A Rakhlin Advances in Neural Information Processing Systems 24, 2011 | 232 | 2011 |
| Beyond ucb: Optimal and efficient contextual bandits with regression oracles D Foster, A Rakhlin International Conference on Machine Learning, 3199-3210, 2020 | 224 | 2020 |
| Near optimal finite time identification of arbitrary linear dynamical systems T Sarkar, A Rakhlin International Conference on Machine Learning, 5610-5618, 2019 | 209 | 2019 |
| Optimal strategies and minimax lower bounds for online convex games J Abernethy, PL Bartlett, A Rakhlin, A Tewari Proceedings of the 21st annual conference on learning theory, 414-424, 2008 | 202 | 2008 |
| The statistical complexity of interactive decision making DJ Foster, SM Kakade, J Qian, A Rakhlin arXiv preprint arXiv:2112.13487, 2021 | 200 | 2021 |
| Size-independent sample complexity of neural networks N Golowich, A Rakhlin, O Shamir Information and Inference: A Journal of the IMA 9 (2), 473-504, 2020 | 162 | 2020 |
| On the multiple descent of minimum-norm interpolants and restricted lower isometry of kernels T Liang, A Rakhlin, X Zhai Conference on Learning Theory, 2683-2711, 2020 | 157* | 2020 |
| Stability of -Means Clustering A Rakhlin, A Caponnetto Advances in neural information processing systems 19, 2006 | 155 | 2006 |
