Regret-optimal measurement-feedback control

• URL: http://arxiv.org/abs/2011.12785v2
• Date: Tue, 22 Jun 2021 23:14:47 GMT
• Title: Regret-optimal measurement-feedback control
• Authors: Gautam Goel, Babak Hassibi
• Abstract summary: We consider measurement-feedback control in linear dynamical systems from the perspective of regret. We show that in the measurement-feedback setting, unlike in the full information setting, there is no single offline controller which outperforms every other offline controller on every disturbance. We show that the corresponding regret-optimal online controller can be found via a novel reduction to the classical Nehari problem and present a tight data-dependent bound on its regret.
• Score: 39.76359052907755
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider measurement-feedback control in linear dynamical systems from the perspective of regret minimization. Unlike most prior work in this area, we focus on the problem of designing an online controller which competes with the optimal dynamic sequence of control actions selected in hindsight, instead of the best controller in some specific class of controllers. This formulation of regret is attractive when the environment changes over time and no single controller achieves good performance over the entire time horizon. We show that in the measurement-feedback setting, unlike in the full-information setting, there is no single offline controller which outperforms every other offline controller on every disturbance, and propose a new $H_2$-optimal offline controller as a benchmark for the online controller to compete against. We show that the corresponding regret-optimal online controller can be found via a novel reduction to the classical Nehari problem from robust control and present a tight data-dependent bound on its regret.

Related papers

• Optimal Competitive-Ratio Control [40.89951305613357]
  We show that the optimal competitive ratio formula can be computed as the maximal eigenvalue of a simple matrix. We conduct an extensive numerical study to verify this analytical solution, and demonstrate that the optimal competitive-ratio controller outperforms other controllers on several large scale practical systems.
  arXiv  Detail & Related papers  (2022-06-03T19:01:07Z)
• Competitive Control [52.28457815067461]
  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.
  arXiv  Detail & Related papers  (2021-07-28T22:26:27Z)
• Regret-optimal Estimation and Control [52.28457815067461]
  We show that the regret-optimal estimator and regret-optimal controller can be derived in state-space form. We propose regret-optimal analogs of Model-Predictive Control (MPC) and the Extended KalmanFilter (EKF) for systems with nonlinear dynamics.
  arXiv  Detail & Related papers  (2021-06-22T23:14:21Z)
• Regret-Optimal LQR Control [37.99652162611661]
  We find a causal controller that minimizes the worst-case regret over all bounded energy disturbances. We derive explicit formulas for the optimal regret and for the regret-optimal controller for the state-space setting. The regret-optimal controller presents itself as a viable option for control systems design.
  arXiv  Detail & Related papers  (2021-05-04T01:51:00Z)
• Meta-Learning Guarantees for Online Receding Horizon Learning Control [0.0]
  We provide provable regret guarantees for an online meta-learning receding horizon control algorithm in an iterative control setting. We show that the worst regret for learning within an iteration improves with experience of more iterations.
  arXiv  Detail & Related papers  (2020-10-21T21:57:04Z)
• Regret-optimal control in dynamic environments [39.76359052907755]
  We focus on the problem of designing an online controller which minimizes regret against the best dynamic sequence of control actions selected in hindsight. We derive the state-space structure of the regret-optimal controller via a novel reduction to $H_infty$ control. We present numerical experiments which show that our regret-optimal controller interpolates between the performance of the $H_infty$-optimal controllers across and adversarial environments.
  arXiv  Detail & Related papers  (2020-10-20T17:32:17Z)
• Learning a Contact-Adaptive Controller for Robust, Efficient Legged Locomotion [95.1825179206694]
  We present a framework that synthesizes robust controllers for a quadruped robot. A high-level controller learns to choose from a set of primitives in response to changes in the environment. A low-level controller that utilizes an established control method to robustly execute the primitives.
  arXiv  Detail & Related papers  (2020-09-21T16:49:26Z)
• Improper Learning for Non-Stochastic Control [78.65807250350755]
  We consider the problem of controlling a possibly unknown linear dynamical system with adversarial perturbations, adversarially chosen convex loss functions, and partially observed states. Applying online descent to this parametrization yields a new controller which attains sublinear regret vs. a large class of closed-loop policies. Our bounds are the first in the non-stochastic control setting that compete with emphall stabilizing linear dynamical controllers.
  arXiv  Detail & Related papers  (2020-01-25T02:12:48Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.