A Unified Approach to Adaptive Regularization in Online and Stochastic Optimization

Built on

Problem Complexity and Method Efficiency in Optimization
A. Nemirovskii and D. Yudin · 1983
Earlier work this paper cites.
Exponentiated gradient versus gradient descent for linear predictors
J. Kivinen and M. Warmuth · 1997
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
On the generalization ability of on-line learning algorithms
N. Cesa-Bianchi, A. Conconi, and C. Gentile · 2004
Earlier work this paper cites.
Efficient algorithms for online decision problems
A. Kalai and S. Vempala · 2005
Earlier work this paper cites.

Logarithmic regret algorithms for online convex optimization
E. Hazan, A. Agarwal, and S. Kale · 2007
Cited alongside, same era.
Mind the duality gap: Logarithmic regret algorithms for online optimization
S. Shalev-Shwartz and S. M. Kakade · 2009
Cited alongside, same era.
Trace inequalities and quantum entropy: an introductory course
E. Carlen · 2010
Cited alongside, same era.
Adaptive bound optimization for online convex optimization
H. B. McMahan and M. Streeter · 2010
Cited alongside, same era.

Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2011
Later among the works it cites.
Online learning and online convex optimization
S. Shalev-Shwartz · 2012
Later among the works it cites.
Analysis techniques for adaptive online learning
Original
H. B. McMahan · 2014
Later among the works it cites.
Introduction to online convex optimization
E. Hazan · 2016
Later among the works it cites.