Fetching the paper…
Reading the bibliography…
We consider control in linear time-varying dynamical systems from the perspective of regret minimization.
Contributions to the theory of optimal control
Rudolf Emil Kalman et al · 1960
Earlier work this paper cites.
Guaranteed margins for lqg regulators
John C Doyle · 1978
Earlier work this paper cites.
State-space solutions to standard h 2 and h-infinity control problems
John Doyle, Keith Glover, Pramod Khargonekar, and Bruce Francis · 1988
Earlier work this paper cites.
Discrete-time h/sup infinity/control
DJN Limebeer, Michael Green, and D Walker · 1989
Earlier work this paper cites.
Finite horizon h/sup infinity/control problems with terminal penalties
Kenko Uchida and Mayasuki Fujita · 1990
Earlier work this paper cites.
Filtering and smoothing in an h/sup infinity/setting
Krishan M Nagpal and Pramod P Khargonekar · 1991
Earlier work this paper cites.
Tracking the best expert
Mark Herbster and Manfred K Warmuth · 1998
Earlier work this paper cites.
Indefinite-quadratic estimation and control: a unified approach to H 2 and H-infinity theories
Babak Hassibi, Ali H Sayed, and Thomas Kailath · 1999
Earlier work this paper cites.
Linear estimation
Thomas Kailath, Ali H Sayed, and Babak Hassibi · 2000
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 learning algorithms for changing environments
Elad Hazan and Comandur Seshadhri · 2009
Earlier work this paper cites.
Regret bounds for the adaptive control of linear quadratic systems
Yasin Abbasi-Yadkori and Csaba Szepesvari · 2011
Earlier work this paper cites.
Non-stationary stochastic optimization
Omar Besbes, Yonatan Gur, and Assaf Zeevi · 2015
Cited alongside, same era.
Online optimization: Competing with dynamic comparators
Ali Jadbabaie, Alexander Rakhlin, Shahin Shahrampour, and Karthik Sridharan · 2015
Cited alongside, same era.
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
Cited alongside, same era.
Thinking fast and slow: Optimization decomposition across timescales
Gautam Goel, Niangjun Chen, and Adam Wierman · 2017
Cited alongside, same era.
Smoothed online convex optimization in high dimensions via online balanced descent
Niangjun Chen, Gautam Goel, and Adam Wierman · 2018
Cited alongside, same era.
Regret bounds for robust adaptive control of the linear quadratic regulator
An online algorithm for smoothed regression and lqr control
Gautam Goel and Adam Wierman · 2019
Later among the works it cites.
Beyond online balanced descent: An optimal algorithm for smoothed online optimization
Gautam Goel, Yiheng Lin, Haoyuan Sun, and Adam Wierman · 2019
Later among the works it cites.
Logarithmic regret for adversarial online control
Dylan J Foster and Max Simchowitz · 2020
Closest in time.
The power of linear controllers in lqr control
Gautam Goel and Babak Hassibi · 2020
Closest in time.
Adaptive regret for control of time-varying dynamics
Paula Gradu, Elad Hazan, and Edgar Minasyan · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sarah Dean, Horia Mania, Nikolai Matni, Benjamin Recht, and Stephen Tu · 2018
Cited alongside, same era.
Using predictions in online optimization with switching costs: A fast algorithm and a fundamental limit
Yingying Li, Guannan Qu, and Na Li · 2018
Cited alongside, same era.
More adaptive algorithms for adversarial bandits
Chen-Yu Wei and Haipeng Luo · 2018
Cited alongside, same era.
Online control with adversarial disturbances
Naman Agarwal, Brian Bullins, Elad Hazan, Sham M Kakade, and Karan Singh · 2019
Cited alongside, same era.
Online forecasting of total-variation-bounded sequences
Dheeraj Baby and Yu-Xiang Wang · 2019
Cited alongside, same era.
Improved path-length regret bounds for bandits
Sébastien Bubeck, Yuanzhi Li, Haipeng Luo, and Chen-Yu Wei · 2019
Cited alongside, same era.
Learning linear-quadratic regulators efficiently with only T \sqrt{T} regret
Alon Cohen, Tomer Koren, and Yishay Mansour · 2019
Cited alongside, same era.
The nonstochastic control problem
Elad Hazan, Sham Kakade, and Karan Singh · 2020
Closest in time.
Regret bound of adaptive control in linear quadratic gaussian (lqg) systems
Sahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, and Anima Anandkumar · 2020
Closest in time.
Leveraging predictions in smoothed online convex optimization via gradient-based algorithms
Yingying Li and Na Li · 2020
Closest in time.
Online optimization with predictions and non-convex losses
Yiheng Lin, Gautam Goel, and Adam Wierman · 2020
Closest in time.
Non-stationary online regression
Anant Raj, Pierre Gaillard, and Christophe Saad · 2020
Closest in time.
Online optimization with memory and competitive control
Guanya Shi, Yiheng Lin, Soon-Jo Chung, Yisong Yue, and Adam Wierman · 2020
Closest in time.
Feedback systems: an introduction for scientists and engineers
Karl Johan Åström and Richard M Murray · 2021
Closest in time.