Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics
Not on the map. Why?
Abstract (arXiv)
We consider the problem of controlling an unknown linear dynamical system under a stochastic convex cost and full feedback of both the state and cost function. We present a computationally efficient algorithm that attains an optimal √T regret-rate compared to the best stabilizing linear controller in hindsight. In contrast to previous work, our algorithm is based on the Optimism in the Face of Uncertainty paradigm. This results in a substantially improved computational complexity and a simpler analysis.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 17 of its 31 references that are in the map. First posted on arXiv 2 Mar 2022.
Builds on
17 of 31 references.
References · 17
- 2020Naive Exploration is Optimal for Online LQRcited by 111
- 2019Online Control with Adversarial Disturbancescited by 92
- 2018Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulatorcited by 86
- 2020Improper Learning for Non-Stochastic Controlcited by 83
- 2019Learning Linear-Quadratic Regulators Efficiently with only √T Regretcited by 67
- 2018Online Linear Quadratic Controlcited by 55
- 2020Logarithmic Regret Bound in Partially Observable Linear Dynamical Systemscited by 46
- 2020Black-Box Control for Linear Dynamical Systemscited by 43
- 2020Logarithmic Regret for Adversarial Online Controlcited by 41
- 2019Logarithmic Regret for Online Controlcited by 38
- 2020Logarithmic Regret for Learning Linear Quadratic Regulators Efficientlycited by 33
- 2018Smoothed Online Optimization for Regression and Controlcited by 26
5 more
- 2020Making Non-Stochastic Control (Almost) as Easy as Stochasticcited by 24
- 2020Non-Stochastic Control with Bandit Feedbackcited by 17
- 2013Efficient Reinforcement Learning for High Dimensional Linear Quadratic Systemscited by 13
- 2020Bandit Linear Controlcited by 10
- 2020Geometric Exploration for Online Controlcited by 9
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2022Rate-Optimal Online Convex Optimization in Adaptive Linear Controlcited by 5
- 2023Online Nonstochastic Control with Adversarial and Static Constraintscited by 5
- 2025Scalable LinUCB: Low-Rank Design Matrix Updates for Recommenders with Large Action Spacescited by 1
- 2022Learning to Control under Time-Varying Environmentcited by 0
- 2025Scalable LinUCB: Low-Rank Design Matrix Updates for Recommenders with Large Action Spaces22 Oct 2025
- 2023Online Nonstochastic Control with Adversarial and Static Constraints5 Feb 2023
- 2022Learning to Control under Time-Varying Environment6 Jun 2022
- 2022Rate-Optimal Online Convex Optimization in Adaptive Linear Control3 Jun 2022