Robust Online Control with Model Misspecification
Not on the map. Why?
Abstract (arXiv)
We study online control of an unknown nonlinear dynamical system that is approximated by a time-invariant linear system with model misspecification. Our study focuses on robustness, a measure of how much deviation from the assumed linear approximation can be tolerated by a controller while maintaining finite ℓ2-gain. A basic methodology to analyze robustness is via the small gain theorem. However, as an implication of recent lower bounds on adaptive control, this method can only yield robustness that is exponentially small in the dimension of the system and its parametric uncertainty. The work of Cusumano and Poolla shows that much better robustness can be obtained, but the control algorithm is inefficient, taking exponential time in the worst case. In this paper we investigate whether there exists an efficient algorithm with provable robustness beyond the small gain theorem. We demonstrate that for a fully actuated system, this is indeed attainable. We give an efficient controller that can tolerate robustness that is polynomial in the dimension and independent of the parametric uncertainty; furthermore, the controller obtains an ℓ2-gain whose dimension dependence is near optimal.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 18 of its 34 references that are in the map. First posted on arXiv 16 Jul 2021.
Builds on
18 of 34 references.
References · 18
- 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
- 2019Online Control with Adversarial Disturbancescited by 92
- 2018Near optimal finite time identification of arbitrary linear dynamical systemscited by 89
- 2020Information Theoretic Regret Bounds for Online Nonlinear Controlcited by 87
- 2020Improper Learning for Non-Stochastic Controlcited by 83
- 2020Active Learning for Nonlinear System Identification with Guaranteescited by 78
- 2018Non-asymptotic Identification of LTI Systems from a Single Trajectorycited by 77
- 2019Learning Linear Dynamical Systems with Semi-Parametric Least Squarescited by 58
- 2018Online Linear Quadratic Controlcited by 55
- 2019The Nonstochastic Control Problemcited by 52
- 2020Black-Box Control for Linear Dynamical Systemscited by 43
- 2020Regret Bounds for Adaptive Nonlinear Controlcited by 25
6 more
- 2020Learning the Linear Quadratic Regulator from Nonlinear Observationscited by 21
- 2020No-Regret Prediction in Marginally Stable Systemscited by 18
- 2020Competitive Control with Delayed Imperfect Informationcited by 8
- 2021A Regret Minimization Approach to Iterative Learning Controlcited by 8
- 2018Finite Time Adaptive Stabilization of LQ Systemscited by 7
- 2021Adaptive Robust Model Predictive Control with Matched and Unmatched Uncertaintycited by 7
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 0; 2026: 1.
4 papers.
- 2023Optimal Rates for Bandit Nonstochastic Controlcited by 7
- 2023Online Nonstochastic Control with Adversarial and Static Constraintscited by 5
- 2024Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Controlcited by 4
- 2026Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oraclescited by 0
- 2026Optimizing the Preconditioner: A Black-box Online-to-Nonconvex Conversion with Static Regret Minimization Oracles20 Jul 2026
- 2024Regret Analysis of Multi-task Representation Learning for Linear-Quadratic Adaptive Control8 Jul 2024
- 2023Optimal Rates for Bandit Nonstochastic Control24 May 2023
- 2023Online Nonstochastic Control with Adversarial and Static Constraints5 Feb 2023