Fetching the paper…
Reading the bibliography…
In this paper, we study online convex optimization in dynamic environments, and aim to bound the dynamic regret with respect to any sequence of comparators.
Probability inequalities for sums of bounded random variables
W. Hoeffding · 1963
Earlier work this paper cites.
Tracking the best expert
M. Herbster and M. K. Warmuth · 1998
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
M. Zinkevich · 2003
Earlier work this paper cites.
Convex Optimization
S. Boyd and L. Vandenberghe · 2004
Earlier work this paper cites.
Prediction, Learning, and Games
N. Cesa-Bianchi and G. Lugosi · 2006
Earlier work this paper cites.
Adaptive algorithms for online decision problems
E. Hazan and C. Seshadhri · 2007
Earlier work this paper cites.
Logarithmic regret algorithms for online convex optimization
E. Hazan, A. Agarwal, and S. Kale · 2007
Earlier work this paper cites.
Pegasos: primal estimated sub-gradient solver for SVM
S. Shalev-Shwartz, Y. Singer, and N. Srebro · 2007
Earlier work this paper cites.
Optimal stragies and minimax lower bounds for online convex games
J. Abernethy, P. L. Bartlett, A. Rakhlin, and A. Tewari · 2008
Earlier work this paper cites.
Smoothness, low noise and fast rates
N. Srebro, K. Sridharan, and A. Tewari · 2010
Cited alongside, same era.
Adaptive subgradient methods for online learning and stochastic optimization
J. Duchi, E. Hazan, and Y. Singer · 2011
Cited alongside, same era.
Online learning and online convex optimization
S. Shalev-Shwartz · 2011
Cited alongside, same era.
Online optimization with gradual variations
C.-K. Chiang, T. Yang, C.-J. Lee, M. Mahdavi, C.-J. Lu, R. Jin, and S. Zhu · 2012
Cited alongside, same era.
Dynamical models and tracking regret in online convex programming
E. C. Hall and R. M. Willett · 2013
Cited alongside, same era.
Online learning with predictable sequences
A. Rakhlin and K. Sridharan · 2013
Cited alongside, same era.
Online optimization: Competing with dynamic comparators
A. Jadbabaie, A. Rakhlin, S. Shahrampour, and K. Sridharan · 2015
Later among the works it cites.
Introduction to online convex optimization
E. Hazan · 2016
Later among the works it cites.
Online optimization in dynamic environments: Improved regret rates for strongly convex problems
A. Mokhtari, S. Shahrampour, A. Jadbabaie, and A. Ribeiro · 2016
Later among the works it cites.
Metagrad: Multiple learning rates in online learning
T. van Erven and W. M. Koolen · 2016
Later among the works it cites.
Tracking slowly moving clairvoyant: Optimal dynamic regret of online learning with true and noisy gradient
T. Yang, L. Zhang, R. Jin, and J. Yi · 2016
Later among the works it cites.
Improved strongly adaptive online learning using coin betting
K.-S. Jun, F. Orabona, S. Wright, and R. Willett · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Online kernel learning with a near optimal sparsity bound
L. Zhang, J. Yi, R. Jin, M. Lin, and X. He · 2013
Cited alongside, same era.
Non-stationary stochastic optimization
O. Besbes, Y. Gur, and A. Zeevi · 2015
Cited alongside, same era.
Strongly adaptive online learning
A. Daniely, A. Gonen, and S. Shalev-Shwartz · 2015
Cited alongside, same era.
Later among the works it cites.
Improved dynamic regret for non-degenerate functions
L. Zhang, T. Yang, J. Yi, R. Jin, and Z.-H. Zhou · 2017
Later among the works it cites.
Dynamic regret of strongly adaptive methods
L. Zhang, T. Yang, R. Jin, and Z.-H. Zhou · 2018
Closest in time.