Competitive Control
Not on the map. Why?
Abstract (arXiv)
We consider control from the perspective of competitive analysis. Unlike much prior work on learning-based control, which focuses on minimizing regret against the best controller selected in hindsight from some specific class, we focus on designing an online controller which competes against a clairvoyant offline optimal controller. A natural performance metric in this setting is competitive ratio, which is the ratio between the cost incurred by the online controller and the cost incurred by the offline optimal controller. Using operator-theoretic techniques from robust control, we derive a computationally efficient state-space description of the the controller with optimal competitive ratio in both finite-horizon and infinite-horizon settings. We extend competitive control to nonlinear systems using Model Predictive Control (MPC) and present numerical experiments which show that our competitive controller can significantly outperform standard H2 and H∞ controllers in the MPC setting.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 12 of its 28 references that are in the map. First posted on arXiv 28 Jul 2021.
Builds on
12 of 28 references.
References · 12
- 2019Online Control with Adversarial Disturbancescited by 92
- 2017Thinking Fast and Slow: Optimization Decomposition Across Timescalescited by 60
- 2019The Nonstochastic Control Problemcited by 52
- 2020Logarithmic Regret for Adversarial Online Controlcited by 41
- 2020Adaptive Regret for Control of Time-Varying Dynamicscited by 38
- 2018Smoothed Online Convex Optimization in High Dimensions via Online Balanced Descentcited by 33
- 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
- 2019Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimizationcited by 31
- 2018Smoothed Online Optimization for Regression and Controlcited by 26
- 2020The Power of Linear Controllers in LQR Controlcited by 10
- 2021Regret-optimal Estimation and Controlcited by 10
- 2020Regret-optimal measurement-feedback controlcited by 5
Built on by
Citing papers per year: 2021: 1; 2022: 3; 2023: 2; 2024: 1; 2025: 0; 2026: 1.
8 papers.
- 2023Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictionscited by 8
- 2022Best of Both Worlds in Online Control: Competitive Ratio and Policy Regretcited by 5
- 2023Adaptive Online Non-stochastic Controlcited by 3
- 2024Optimistic Online Non-stochastic Control via FTRLcited by 3
- 2022Optimal Competitive-Ratio Controlcited by 2
- 2021Online estimation and control with optimal pathlength regretcited by 0
- 2022Follow the Clairvoyant: an Imitation Learning Approach to Optimal Controlcited by 0
- 2026Consistent Model Chasing Is Minimax Optimal: The Exact Value of Scalar Adversarial Adaptive Control under Large Parametric Uncertaintycited by 0
- 2026Consistent Model Chasing Is Minimax Optimal: The Exact Value of Scalar Adversarial Adaptive Control under Large Parametric Uncertainty13 Aug 2026
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024
- 2023Adaptive Online Non-stochastic Control2 Oct 2023
- 2023Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictions20 Jul 2023
- 2022Best of Both Worlds in Online Control: Competitive Ratio and Policy Regret21 Nov 2022
- 2022Follow the Clairvoyant: an Imitation Learning Approach to Optimal Control14 Nov 2022
- 2022Optimal Competitive-Ratio Control3 Jun 2022
- 2021Online estimation and control with optimal pathlength regret24 Oct 2021