Anytime Online-to-Batch, Optimism and Acceleration

Logarithmic regret algorithms for online convex optimization

Elad Hazan, Amit Agarwal, Satyen Kale · Machine Learning · 2007 · 874 citations · Full text

Computing, Computer Science, Algorithms +13

Making Gradient Descent Optimal for Strongly Convex Stochastic Optimization

Alexander Rakhlin, Ohad Shamir, Karthik Sridharan · arXiv (Cornell University) · 2011 · 549 citations · Full text

Computing, Computer Science, Algorithms +12

An optimal method for stochastic composite optimization

Guanghui Lan · Mathematical Programming · 2010 · 458 citations

Natural Sciences, Materials Engineering, Mechanical Engineering +13

On the Generalization Ability of On-Line Learning Algorithms

Nicolò Cesa‐Bianchi, Alex Conconi, Claudio Gentile · IEEE Transactions on Information Theory · 2004 · 446 citations

Computing, Computer Science, Mathematics +17

Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization

Elad Hazan, Satyen Kale · Journal of Machine Learning Research · 2014 · 234 citations

Computing, Computer Science, Algorithms +15