Fetching the paper…
Reading the bibliography…
We study Smoothed Online Convex Optimization, a version of online convex optimization where the learner incurs a penalty for changing her actions between rounds.
Problem complexity and method efficiency in optimization
Arkadii Nemirovskii, David Borisovich Yudin, and Edgar Ronald Dawson · 1983
Earlier work this paper cites.
Multi-armed bandit problems with multiple plays and switching cost
R Agrawal, M Hegde, and D Teneketzis · 1990
Earlier work this paper cites.
A decomposition theorem and bounds for randomized server problems
Avrim Blum, Howard Karloff, Yuval Rabani, and Michael Saks · 1992
Earlier work this paper cites.
An optimal on-line algorithm for metrical task system
Allan Borodin, Nathan Linial, and Michael E. Saks · 1992
Earlier work this paper cites.
On convex body chasing
Joel Friedman and Nathan Linial · 1993
Earlier work this paper cites.
Exponentiated gradient versus gradient descent for linear predictors
Jyrki Kivinen and Manfred K Warmuth · 1997
Earlier work this paper cites.
Continuous and discrete-time nonlinear gradient descent: Relative loss bounds and convergence
Manfred K Warmuth and Arun K Jagota · 1997
Earlier work this paper cites.
On-line learning and the metrical task system problem
Avrim Blum and Carl Burch · 2000
Earlier work this paper cites.
Tracking the best linear predictor
Mark Herbster and Manfred K. Warmuth · 2001
Earlier work this paper cites.
Static optimality and dynamic search-optimality in lists and trees
Avrim Blum, Shuchi Chawla, and Adam Kalai · 2002
Earlier work this paper cites.
Online computation and competitive analysis
Allan Borodin and Ran El-Yaniv · 2005
Earlier work this paper cites.
Smooth minimization of non-smooth functions
Yu. Nesterov · 2005
Earlier work this paper cites.
Multi-armed bandits with metric switching costs
Sudipto Guha and Kamesh Munagala · 2009
Earlier work this paper cites.
On the duality of strong convexity and strong smoothness: Learning applications and matrix regularization
Sham Kakade, Shai Shalev-Shwartz, and Ambuj Tewari · 2009
Earlier work this paper cites.
Multicore thermal management with model predictive control
Francesco Zanini, David Atienza, Luca Benini, and Giovanni De Micheli · 2009
Earlier work this paper cites.
A regularization approach to metrical task systems
Jacob Abernethy, Peter L Bartlett, Niv Buchbinder, and Isabelle Stanton · 2010
Earlier work this paper cites.
Implicit online learning
Brian Kulis and Peter L Bartlett · 2010
Cited alongside, same era.
Dual averaging methods for regularized stochastic learning and online optimization
Lin Xiao · 2010
Cited alongside, same era.
Online convex optimization-based algorithm for thermal management of MPSoCs
Francesco Zanini, David Atienza, Giovanni De Micheli, and Stephen P Boyd · 2010
Cited alongside, same era.
Delay reduction via lagrange multipliers in stochastic network optimization
Longbo Huang and Michael J. Neely · 2011
Cited alongside, same era.
Dynamic right-sizing for power-proportional data centers
Minghong Lin, Adam Wierman, Lachlan L. H. Andrew, and Thereska Eno · 2011
Cited alongside, same era.
The multiplicative weights update method: a meta-algorithm and applications
Sanjeev Arora, Elad Hazan, and Satyen Kale · 2012
Online convex optimization with ramp constraints
Masoud Badiei, Na Li, and Adam Wierman · 2015
Later among the works it cites.
A 2-competitive algorithm for online convex optimization with switching costs
Nikhil Bansal, Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs, Kevin Schewior, and Clifford Stein · 2015
Later among the works it cites.
Convex optimization: Algorithms and complexity
Sébastien Bubeck et al · 2015
Later among the works it cites.
Online convex optimization using predictions
Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, and Lachlan LH Andrew · 2015
Later among the works it cites.
A decision tree framework for spatiotemporal sequence prediction
Taehwan Kim, Yisong Yue, Sarah Taylor, and Iain Matthews · 2015
Later among the works it cites.
Upper bounds on the relative entropy and rényi divergence as a function of total variation distance for finite alphabets
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Unified algorithms for online learning and competitive analysis
Niv Buchbinder, Shahar Chen, Joshep Seffi Naor, and Ohad Shamir · 2012
Cited alongside, same era.
Nicolò Cesa-Bianchi, Pierre Gaillard, Gábor Lugosi, and Gilles Stoltz · 2012
Cited alongside, same era.
Jointly optimizing multi-user rate adaptation for video transport over wireless systems: Mean-fairness-variability tradeoffs
Vinay Joseph and Gustavo de Veciana · 2012
Cited alongside, same era.
Online algorithms for geographical load balancing
Minghong Lin, Zhenhua Liu, Adam Wierman, and Lachlan LH Andrew · 2012
Cited alongside, same era.
A tale of two metrics: Simultaneous bounds on competitiveness and regret
Lachlan Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, and Adam Wierman · 2013
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.
Igal Sason and Sergio Verdú · 2015
Later among the works it cites.
Chasing Convex Bodies and Functions , pages 68–81
Antonios Antoniadis, Neal Barcelo, Michael Nugent, Kirk Pruhs, Kevin Schewior, and Michele Scquizzato · 2016
Later among the works it cites.
Using predictions in online optimization: Looking forward with an eye on the past
Niangjun Chen, Joshua Comden, Zhenhua Liu, Anshul Gandhi, and Adam Wierman · 2016
Later among the works it cites.
Introduction to online convex optimization
Elad Hazan et al · 2016
Later among the works it cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2016
Later among the works it cites.
k-server via multiscale entropic regularization
S. Bubeck, M. B. Cohen, J. R. Lee, Y. Tat Lee, and A. Madry · 2017
Later among the works it cites.
Thinking fast and slow: Optimization decomposition across timescales
Gautam Goel, Niangjun Chen, and Adam Wierman · 2017
Later among the works it cites.
Multi-armed bandits with metric movement costs
Tomer Koren, Roi Livni, and Yishay Mansour · 2017
Later among the works it cites.
Online optimization with predictions and switching costs: Fast algorithms and the fundamental limit
Yingying Li, Guannan Qu, and Na Li · 2018
Closest in time.
Errata , 2018
Kirk Pruhs · 2018
Closest in time.