Fetching the paper…
Reading the bibliography…
We provide algorithms that guarantee regret $R_T(u)\le \tilde O(G\|u\|^3 + G(\|u\|+1)\sqrt{T})$ or $R_T(u)\le \tilde O(G\|u\|^3T^{1/3} + GT^{1/3}+ G\|u\|\sqrt{T})$ for online convex optimization with $G$-Lipschitz losses for any comparison point $u$ without prior knowledge of either $G$ or $\|u\|$.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Earlier work this paper cites.
Optimal strategies and minimax lower bounds for online convex games
Jacob Abernethy, Peter L Bartlett, Alexander Rakhlin, and Ambuj Tewari · 2008
Earlier work this paper cites.
Adaptive online gradient descent
Elad Hazan, Alexander Rakhlin, and Peter L Bartlett · 2008
Earlier work this paper cites.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2010
Earlier work this paper cites.
Smoothness, low noise and fast rates
Nathan Srebro, Karthik Sridharan, and Ambuj Tewari · 2010
Earlier work this paper cites.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2011
Earlier work this paper cites.
No-regret algorithms for unconstrained online convex optimization
Brendan McMahan and Matthew Streeter · 2012
Earlier work this paper cites.
Ad click prediction: a view from the trenches
H Brendan McMahan, Gary Holt, David Sculley, Michael Young, Dietmar Ebner, Julian Grady, Lan Nie, Todd Phillips, Eugene Davydov, Daniel Golovin, et al · 2013
Cited alongside, same era.
Dimension-free exponentiated gradient
Francesco Orabona · 2013
Cited alongside, same era.
Normalized online learning
Stephane Ross, Paul Mineiro, and John Langford · 2013
Cited alongside, same era.
From on-line to batch learning
Nick Littlestone · 2014
Cited alongside, same era.
A survey of algorithms and analysis for adaptive online learning
H. Brendan McMahan · 2014
Cited alongside, same era.
Simultaneous model selection and optimization through parameter-free stochastic learning
Francesco Orabona · 2014
Cited alongside, same era.
Online convex optimization with unconstrained domains and losses
Ashok Cutkosky and Kwabena A Boahen · 2016
Later among the works it cites.
Online learning without prior information
Ashok Cutkosky and Kwabena Boahen · 2017
Later among the works it cites.
Parameter-free online learning via model selection
Dylan J Foster, Satyen Kale, Mehryar Mohri, and Karthik Sridharan · 2017
Later among the works it cites.
Backprop without learning rates through coin betting
Francesco Orabona and Tatiana Tommasi · 2017
Later among the works it cites.
Black-box reductions for parameter-free online learning in banach spaces
Ashok Cutkosky and Francesco Orabona · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Adaptive online learning
Dylan J Foster, Alexander Rakhlin, and Karthik Sridharan · 2015
Cited alongside, same era.
Coin betting and parameter-free online learning
Francesco Orabona and Dávid Pál
Cited in the paper.
Francesco Orabona and Dávid Pál
Cited in the paper.
Martin Zinkevich · 2018
Later among the works it cites.