mlsanityData to 14 Oct 2026

Regret-optimal Estimation and Control

arXiv 2106.12097 ↗First posted 22 Jun 2021cs.LG math.DS math.OCcited by 10

Not on the map. Why?

Abstract (arXiv)

We consider estimation and control in linear time-varying dynamical systems from the perspective of regret minimization. Unlike most prior work in this area, we focus on the problem of designing causal estimators and controllers which compete against a clairvoyant noncausal policy, instead of the best policy selected in hindsight from some fixed parametric class. We show that the regret-optimal estimator and regret-optimal controller can be derived in state-space form using operator-theoretic techniques from robust control and present tight,data-dependent bounds on the regret incurred by our algorithms in terms of the energy of the disturbances. Our results can be viewed as extending traditional robust estimation and control, which focuses on minimizing worst-case cost, to minimizing worst-case regret. We propose regret-optimal analogs of Model-Predictive Control (MPC) and the Extended KalmanFilter (EKF) for systems with nonlinear dynamics and present numerical experiments which show that our regret-optimal algorithms can significantly outperform standard approaches to estimation and control.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 16 of its 34 references that are in the map. First posted on arXiv 22 Jun 2021.

Builds on

16 of 34 references.

References · 16

  1. 2015Online Optimization : Competing with Dynamic Comparatorscited by 99
  2. 2019Online Control with Adversarial Disturbancescited by 92
  3. 2018Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulatorcited by 86
  4. 2019Learning Linear-Quadratic Regulators Efficiently with only √T Regretcited by 70
  5. 2017Thinking Fast and Slow: Optimization Decomposition Across Timescalescited by 60
  6. 2019The Nonstochastic Control Problemcited by 52
  7. 2020Logarithmic Regret for Adversarial Online Controlcited by 41
  8. 2019Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysiscited by 40
  9. 2020Adaptive Regret for Control of Time-Varying Dynamicscited by 38
  10. 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
  11. 2019Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimizationcited by 31
  12. 2018Smoothed Online Optimization for Regression and Controlcited by 26
4 more
  1. 2020Making Non-Stochastic Control (Almost) as Easy as Stochasticcited by 24
  2. 2020The Power of Linear Controllers in LQR Controlcited by 10
  3. 2020Regret-optimal measurement-feedback controlcited by 5
  4. 2020Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Settingcited by 4

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 3; 2023: 1; 2024: 2; 2025: 2.

10 papers.