Follow
Alexander Rakhlin
Alexander Rakhlin
Professor, MIT
Verified email at mit.edu - Homepage
Title
Cited by
Cited by
Year
Making gradient descent optimal for strongly convex stochastic optimization
A Rakhlin, O Shamir, K Sridharan
International Conference on Machine Learning (ICML), 2011
7742011
Size-independent sample complexity of neural networks
N Golowich, A Rakhlin, O Shamir
Conference On Learning Theory, 297-299, 2018
5492018
Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis
M Raginsky, A Rakhlin, M Telgarsky
Conference on Learning Theory, 1674-1703, 2017
5422017
Competing in the Dark: An Efficient Algorithm for Bandit Linear Optimization.
JD Abernethy, E Hazan, A Rakhlin
COLT, 263-274, 2008
4042008
Optimization, learning, and games with predictable sequences
S Rakhlin, K Sridharan
Advances in Neural Information Processing Systems 26, 2013
3772013
Just interpolate: Kernel “ridgeless” regression can generalize
T Liang, A Rakhlin
3512020
Online learning with predictable sequences
A Rakhlin, K Sridharan
Conference on Learning Theory, 993-1019, 2013
3362013
Online optimization: Competing with dynamic comparators
A Jadbabaie, A Rakhlin, S Shahrampour, K Sridharan
Artificial Intelligence and Statistics, 398-406, 2015
2852015
Deep learning: a statistical viewpoint
PL Bartlett, A Montanari, A Rakhlin
Acta numerica 30, 87-201, 2021
2772021
Adaptive online gradient descent
PL Bartlett, E Hazan, A Rakhlin
Advances in Neural Information Processing Systems, 65-72, 2007
253*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
2302019
Does data interpolation contradict statistical optimality?
M Belkin, A Rakhlin, AB Tsybakov
The 22nd International Conference on Artificial Intelligence and Statistics …, 2019
2192019
Stochastic convex optimization with bandit feedback
A Agarwal, DP Foster, DJ Hsu, SM Kakade, A Rakhlin
Advances in Neural Information Processing Systems 24, 2011
2122011
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
1872008
Near optimal finite time identification of arbitrary linear dynamical systems
T Sarkar, A Rakhlin
International Conference on Machine Learning, 5610-5618, 2019
1852019
Beyond ucb: Optimal and efficient contextual bandits with regression oracles
D Foster, A Rakhlin
International Conference on Machine Learning, 3199-3210, 2020
1842020
The statistical complexity of interactive decision making
DJ Foster, SM Kakade, J Qian, A Rakhlin
arXiv preprint arXiv:2112.13487, 2021
1522021
Stability of -Means Clustering
A Rakhlin, A Caponnetto
Advances in neural information processing systems 19, 2006
1502006
Online learning: Random averages, combinatorial parameters, and learnability
A Rakhlin, K Sridharan, A Tewari
Advances in Neural Information Processing Systems 23, 2010
1382010
Partial monitoring—classification, regret bounds, and algorithms
G Bartók, DP Foster, D Pál, A Rakhlin, C Szepesvári
Mathematics of Operations Research 39 (4), 967-997, 2014
1342014
The system can't perform the operation now. Try again later.
Articles 1–20