Fetching the paper…
Reading the bibliography…
We consider the problem of controlling an unknown linear time-invariant dynamical system from a single chain of black-box interactions, with no access to resets or offline simulation.
Optimal Control and Estimation
Robert F. Stengel · 1994
Earlier work this paper cites.
Lecture on information-based complexity of convex programming, 1994-1995
Arkadi Nemirovski · 1995
Earlier work this paper cites.
Kemin Zhou, John C. Doyle, and Keith Glover · 1996
Earlier work this paper cites.
Adaptive estimation of a quadratic functional by model selection
B. Laurent and P. Massart · 2000
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.
Introduction to the non-asymptotic analysis of random matrices, 2011
Roman Vershynin · 2011
Earlier work this paper cites.
Dynamic Programming and Optimal Control , volume I
Dimitri P. Bertsekas · 2017
Earlier work this paper cites.
Online linear quadratic control, 2018
Alon Cohen, Avinatan Hassidim, Tomer Koren, Nevena Lazic, Yishay Mansour, and Kunal Talwar · 2018
Earlier work this paper cites.
Regret bounds for robust adaptive control of the linear quadratic regulator
Sarah Dean, Horia Mania, Nikolai Matni, Benjamin Recht, and Stephen Tu · 2018
Cited alongside, same era.
Learning without mixing: Towards a sharp analysis of linear system identification
Max Simchowitz, Horia Mania, Stephen Tu, Michael I. Jordan, and Benjamin Recht · 2018
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.
Finite-time adaptive stabilization of linear systems
M. K. S. Faradonbeh, A. Tewari, and G. Michailidis · 2019
Cited alongside, same era.
Certainty equivalent control of lqr is efficient
Horia Mania, Stephen Tu, and Benjamin Recht · 2019
Cited alongside, same era.
Sample Complexity Bounds for the Linear Quadratic Regulator
Stephen Lyle Tu · 2019
Later among the works it cites.
The gradient complexity of linear regression
Mark Braverman, Elad Hazan, Max Simchowitz, and Blake Woodworth · 2020
Closest in time.
Logarithmic regret for learning linear quadratic regulators efficiently, 2020
Asaf Cassel, Alon Cohen, and Tomer Koren · 2020
Closest in time.
The nonstochastic control problem
Elad Hazan, Sham Kakade, and Karan Singh · 2020
Closest in time.
Making non-stochastic control (almost) as easy as stochastic, 2020
Max Simchowitz · 2020
Closest in time.
Naive exploration is optimal for online lqr, 2020
Max Simchowitz and Dylan J. Foster · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Oymak and N. Ozay · 2019
Cited alongside, same era.
Near optimal finite time identification of arbitrary linear dynamical systems
Tuhin Sarkar and Alexander Rakhlin · 2019
Cited alongside, same era.
Learning linear dynamical systems with semi-parametric least squares
Max Simchowitz, Ross Boczar, and Benjamin Recht · 2019
Cited alongside, same era.
Online control with adversarial disturbances
Naman Agarwal, Brian Bullins, Elad Hazan, Sham Kakade, and Karan Singh
Cited in the paper.
Logarithmic regret for online control
Naman Agarwal, Elad Hazan, and Karan Singh
Cited in the paper.
Regret bound of adaptive control in linear quadratic gaussian (lqg) systems, 2020a
Sahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, and Anima Anandkumar
Cited in the paper.
Logarithmic regret bound in partially observable linear dynamical systems, 2020b
Sahin Lale, Kamyar Azizzadenesheli, Babak Hassibi, and Anima Anandkumar
Cited in the paper.
Improper learning for non-stochastic control, 2020
Max Simchowitz, Karan Singh, and Elad Hazan · 2020
Closest in time.
Lecture notes: Computational control theory
Elad Hazan · 2021
Closest in time.