Finite-time System Identification and Adaptive Control in Autoregressive Exogenous Systems
Not on the map. Why?
Abstract (arXiv)
Autoregressive exogenous (ARX) systems are the general class of input-output dynamical systems used for modeling stochastic linear dynamical systems (LDS) including partially observable LDS such as LQG systems. In this work, we study the problem of system identification and adaptive control of unknown ARX systems. We provide finite-time learning guarantees for the ARX systems under both open-loop and closed-loop data collection. Using these guarantees, we design adaptive control algorithms for unknown ARX systems with arbitrary strongly convex or convex quadratic regulating costs. Under strongly convex cost functions, we design an adaptive control algorithm based on online gradient descent to design and update the controllers that are constructed via a convex controller reparametrization. We show that our algorithm has tildeO(√T) regret via explore and commit approach and if the model estimates are updated in epochs using closed-loop data collection, it attains the optimal regret of polylog(T) after T time-steps of interaction. For the case of convex quadratic cost functions, we propose an adaptive control algorithm that deploys the optimism in the face of uncertainty principle to design the controller. In this setting, we show that the explore and commit approach has a regret upper bound of tildeO(T2/3), and the adaptive control with continuous model estimate updates attains tildeO(√T) regret after T time-steps.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 16 of its 55 references that are in the map. First posted on arXiv 26 Aug 2021.
Builds on
16 of 55 references.
References · 16
- 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
- 2018Non-asymptotic Identification of LTI Systems from a Single Trajectorycited by 77
- 2019Learning Linear-Quadratic Regulators Efficiently with only √T Regretcited by 67
- 2019Finite Sample Analysis of Stochastic System Identificationcited by 67
- 2019Learning Linear Dynamical Systems with Semi-Parametric Least Squarescited by 58
- 2018Online Linear Quadratic Controlcited by 55
- 2020Logarithmic Regret Bound in Partially Observable Linear Dynamical Systemscited by 46
- 2019Logarithmic Regret for Online Controlcited by 38
- 2018On Adaptive Linear-Quadratic Regulatorscited by 21
4 more
- 2017Optimism-Based Adaptive Regulation of Linear-Quadratic Systemscited by 14
- 2019Certainty Equivalence is Efficient for Linear Quadratic Controlcited by 13
- 2020Regret Minimization in Partially Observable Linear Quadratic Controlcited by 7
- 2020Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Settingcited by 4
Built on by
Citing papers per year: 2022: 2; 2023: 1; 2024: 0; 2025: 0; 2026: 1.
4 papers.
- 2023A Tutorial on the Non-Asymptotic Theory of System Identificationcited by 26
- 2022Thompson Sampling Achieves tilde O(√T) Regret in Linear Quadratic Controlcited by 8
- 2022Efficient learning of hidden state LTI state space models of unknown ordercited by 7
- 2026SCaLE: Switching Cost aware Learning and Explorationcited by 0
- 2026SCaLE: Switching Cost aware Learning and Exploration14 Jan 2026
- 2023A Tutorial on the Non-Asymptotic Theory of System Identification7 Sep 2023
- 2022Thompson Sampling Achieves tilde O(√T) Regret in Linear Quadratic Control17 Jun 2022
- 2022Efficient learning of hidden state LTI state space models of unknown order3 Feb 2022