On Adaptive Linear-Quadratic Regulators
Mohamad Kazem Shirani Faradonbeh, Ambuj Tewari, and George Michailidis

TL;DR
This paper provides a comprehensive analysis of adaptive linear-quadratic regulators, introducing a novel regret decomposition, establishing near-optimal regret bounds for modified policies, and examining parameter identification accuracy.
Contribution
It introduces a new decomposition of adaptive policies, derives sharp regret bounds for randomized schemes, and analyzes the information needed for logarithmic regret.
Findings
Sharp regret expression in terms of deviations from optimal regulator
Nearly square-root regret bounds for modified adaptive policies
Identification rates for system parameters
Abstract
Performance of adaptive control policies is assessed through the regret with respect to the optimal regulator, which reflects the increase in the operating cost due to uncertainty about the dynamics parameters. However, available results in the literature do not provide a quantitative characterization of the effect of the unknown parameters on the regret. Further, there are problems regarding the efficient implementation of some of the existing adaptive policies. Finally, results regarding the accuracy with which the system's parameters are identified are scarce and rather incomplete. This study aims to comprehensively address these three issues. First, by introducing a novel decomposition of adaptive policies, we establish a sharp expression for the regret of an arbitrary policy in terms of the deviations from the optimal regulator. Second, we show that adaptive policies based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
