Fetching the paper…
Reading the bibliography…
We investigate online convex optimization in changing environments, and choose the adaptive regret as the performance measure.
The weighted majority algorithm
Nick Littlestone and Manfred K. Warmuth · 1994
Earlier work this paper cites.
Tracking the best expert
Mark Herbster and Manfred K. Warmuth · 1998
Earlier work this paper cites.
Adaptive and self-confident on-line learning algorithms
Peter Auer, Nicolò Cesa-Bianchi, and Claudio Gentile · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Convex Optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Prediction, Learning, and Games
Nicolò Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Adaptive algorithms for online decision problems
Elad Hazan and C. Seshadhri · 2007
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
Elad Hazan, Amit Agarwal, and Satyen Kale · 2007
Earlier work this paper cites.
Online Learning: Theory, Algorithms, and Applications
Shai Shalev-Shwartz · 2007
Earlier work this paper cites.
Optimal stragies and minimax lower bounds for online convex games
Jacob Abernethy, Peter L. Bartlett, Alexander Rakhlin, and Ambuj Tewari · 2008
Earlier work this paper cites.
Efficient learning algorithms for changing environments
Elad Hazan and C. Seshadhri · 2009
Earlier work this paper cites.
Prediction with advice of unknown number of experts
Alexey Chernov and Vladimir Vovk · 2010
Cited alongside, same era.
Smoothness, low-noise and fast rates
Nathan Srebro, Karthik Sridharan, and Ambuj Tewari · 2010
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
John Duchi, Elad Hazan, and Yoram Singer · 2011
Cited alongside, same era.
Online learning and online convex optimization
Shai Shalev-Shwartz · 2011
Cited alongside, same era.
A closer look at adaptive regret
Dmitry Adamskiy, Wouter M. Koolen, Alexey Chernov, and Vladimir Vovk · 2012
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Cited alongside, same era.
Strongly adaptive online learning
Amit Daniely, Alon Gonen, and Shai Shalev-Shwartz · 2015
Later among the works it cites.
Online optimization: Competing with dynamic comparators
Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan · 2015
Later among the works it cites.
Achieving all with no parameters: Adanormalhedge
Haipeng Luo and Robert E. Schapire · 2015
Later among the works it cites.
Introduction to online convex optimization
Elad Hazan · 2016
Later among the works it cites.
Online optimization in dynamic environments: Improved regret rates for strongly convex problems
Aryan Mokhtari, Shahin Shahrampour, Ali Jadbabaie, and Alejandro Ribeiro · 2016
Later among the works it cites.
Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient
Tianbao Yang, Lijun Zhang, Rong Jin, and Jinfeng Yi · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Mirror descent meets fixed share (and feels no regret)
Nicolò Cesa-bianchi, Pierre Gaillard, Gabor Lugosi, and Gilles Stoltz · 2012
Cited alongside, same era.
Efficient tracking of large classes of experts
András György, Tamás Linder, and Gábor Lugosi · 2012
Cited alongside, same era.
Beyond logarithmic bounds in online learning
Francesco Orabona, Nicolo Cesa-Bianchi, and Claudio Gentile · 2012
Cited alongside, same era.
Dynamical models and tracking regret in online convex programming
Eric C. Hall and Rebecca M. Willett · 2013
Cited alongside, same era.
A second-order bound with excess losses
Pierre Gaillard, Gilles Stoltz, and Tim van Erven · 2014
Cited alongside, same era.
Improved strongly adaptive online learning using coin betting
Kwang-Sung Jun, Francesco Orabona, Stephen Wright, and Rebecca Willett
Cited in the paper.
Later among the works it cites.
Training deep networks without learning rates through coin betting
Francesco Orabona and Tatiana Tommasi · 2017
Later among the works it cites.
Improved dynamic regret for non-degenerate functions
Lijun Zhang, Tianbao Yang, Jinfeng Yi, Rong Jin, and Zhi-Hua Zhou · 2017
Later among the works it cites.
Scale-free online learning
Francesco Orabona and Dávid Pál · 2018
Later among the works it cites.
Minimizing adaptive regret with one gradient per iteration
Guanghui Wang, Dakuan Zhao, and Lijun Zhang · 2018
Later among the works it cites.