Fetching the paper…
Reading the bibliography…
We consider the problem of tracking an adversarial state sequence in a linear dynamical system subject to adversarial disturbances and loss functions, generalizing earlier settings in the literature.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E Schapire · 1997
Earlier work this paper cites.
Tracking the best expert
Mark Herbster and Manfred K Warmuth · 1998
Earlier work this paper cites.
Tracking a small set of experts by mixing past posteriors
Olivier Bousquet and Manfred K Warmuth · 2002
Earlier work this paper cites.
Online convex programming and generalized infinitesimal gradient ascent
Martin Zinkevich · 2003
Earlier work this paper cites.
Efficient algorithms for online decision problems
Adam Kalai and Santosh Vempala · 2005
Earlier work this paper cites.
Efficient learning algorithms for changing environments
Elad Hazan and Comandur Seshadhri · 2009
Earlier work this paper cites.
Prediction strategies without loss
Michael Kapralov and Rina Panigrahy · 2010
Earlier work this paper cites.
Regret bounds for the adaptive control of linear quadratic systems
Yasin Abbasi-Yadkori and Csaba Szepesvári · 2011
Earlier work this paper cites.
Online learning with switching costs and other adaptive adversaries
Nicolo Cesa-Bianchi, Ofer Dekel, and Ohad Shamir · 2013
Earlier work this paper cites.
Tracking adversarial targets
Yasin Abbasi-Yadkori, Peter Bartlett, and Varun Kanade · 2014
Earlier work this paper cites.
Higher-order regret bounds with switching costs
Eyal Gofer · 2014
Earlier work this paper cites.
Unconstrained online linear learning in hilbert spaces: Minimax algorithms and normal approximations
H Brendan McMahan and Francesco Orabona · 2014
Earlier work this paper cites.
Online learning for adversaries with memory: price of past mistakes
Oren Anava, Elad Hazan, and Shie Mannor · 2015
Earlier work this paper cites.
Tracking and Regulation in Linear Systems
A. Astolfi · 2015
Earlier work this paper cites.
Alina Beygelzimer, Elad Hazan, Satyen Kale, and Haipeng Luo · 2015
Earlier work this paper cites.
Online convex optimization using predictions
Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, and Lachlan LH Andrew · 2015
Earlier work this paper cites.
Strongly adaptive online learning
Amit Daniely, Alon Gonen, and Shai Shalev-Shwartz · 2015
Earlier work this paper cites.
Online optimization: Competing with dynamic comparators
Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan · 2015
Earlier work this paper cites.
Tracking Model Predictive Control
Daniel Limon and Teodoro Alamo · 2015
Cited alongside, same era.
A closer look at adaptive regret
Dmitry Adamskiy, Wouter M Koolen, Alexey Chernov, and Vladimir Vovk · 2016
Cited alongside, same era.
Coin betting and parameter-free online learning
Francesco Orabona and Dávid Pál · 2016
Cited alongside, same era.
Improved dynamic regret for non-degenerate functions
Lijun Zhang, Tianbao Yang, Jinfeng Yi, Rong Jin, and Zhi-Hua Zhou · 2016
Cited alongside, same era.
Improved strongly adaptive online learning using coin betting
Kwang-Sung Jun, Francesco Orabona, Stephen Wright, and Rebecca Willett · 2017
Cited alongside, same era.
Smoothed online convex optimization in high dimensions via online balanced descent
Niangjun Chen, Gautam Goel, and Adam Wierman · 2018
Adaptive regret of convex and smooth functions
Lijun Zhang, Tie-Yan Liu, and Zhi-Hua Zhou · 2019
Later among the works it cites.
Dual adaptivity: A universal algorithm for minimizing the adaptive regret of convex functions
Lijun Zhang, Guanghui Wang, Wei-Wei Tu, and Zhi-Hua Zhou · 2019
Later among the works it cites.
Online learning with dynamics: A minimax perspective
Kush Bhatia and Karthik Sridharan · 2020
Later among the works it cites.
Parameter-free, dynamic, and strongly-adaptive online learning
Ashok Cutkosky · 2020
Later among the works it cites.
Logarithmic regret for adversarial online control
Dylan Foster and Max Simchowitz · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Online linear quadratic control
Alon Cohen, Avinatan Hasidim, Tomer Koren, Nevena Lazic, Yishay Mansour, and Kunal Talwar · 2018
Cited alongside, same era.
Black-box reductions for parameter-free online learning in Banach spaces
Ashok Cutkosky and Francesco Orabona · 2018
Cited alongside, same era.
Algorithms and Lower Bounds for Parameter-free Online Learning
Ashok Cutkosky · 2018
Cited alongside, same era.
Online learning: Sufficient statistics and the burkholder method
Dylan J Foster, Alexander Rakhlin, and Karthik Sridharan · 2018
Cited alongside, same era.
Dynamic regret of strongly adaptive methods
Lijun Zhang, Tianbao Yang, Zhi-Hua Zhou, et al · 2018
Cited alongside, same era.
Online control with adversarial disturbances
Naman Agarwal, Brian Bullins, Elad Hazan, Sham Kakade, and Karan Singh · 2019
Cited alongside, same era.
Paula Gradu, Elad Hazan, and Edgar Minasyan · 2020
Later among the works it cites.
Lipschitz and comparator-norm adaptivity in online learning
Zakaria Mhammedi and Wouter M Koolen · 2020
Later among the works it cites.
A modern introduction to online learning
Francesco Orabona · 2020
Later among the works it cites.
Making non-stochastic control (almost) as easy as stochastic
Max Simchowitz · 2020
Later among the works it cites.
Online optimization with memory and competitive control
Guanya Shi, Yiheng Lin, Soon-Jo Chung, Yisong Yue, and Adam Wierman · 2020
Later among the works it cites.
Improper learning for non-stochastic control
Max Simchowitz, Karan Singh, and Elad Hazan · 2020
Later among the works it cites.
The power of predictions in online control
Chenkai Yu, Guanya Shi, Soon-Jo Chung, Yisong Yue, and Adam Wierman · 2020
Later among the works it cites.
Minimizing dynamic regret and adaptive regret simultaneously
Lijun Zhang, Shiyin Lu, and Tianbao Yang · 2020
Later among the works it cites.
Power of hints for online learning with movement costs
Aditya Bhaskara, Ashok Cutkosky, Ravi Kumar, and Manish Purohit · 2021
Closest in time.
Online control of unknown time-varying dynamical systems
Edgar Minasyan, Paula Gradu, Max Simchowitz, and Elad Hazan · 2021
Closest in time.
Lazy oco: Online convex optimization on a switching budget
Uri Sherman and Tomer Koren · 2021
Closest in time.
Non-stationary online learning with memory and non-stochastic control
Peng Zhao, Yu-Xiang Wang, and Zhi-Hua Zhou · 2021
Closest in time.