Corpus ID: 220425135

Adaptive Regret for Control of Time-Varying Dynamics

@article{Gradu2020AdaptiveRF,
  title={Adaptive Regret for Control of Time-Varying Dynamics},
  author={Paula Gradu and Elad Hazan and Edgar Minasyan},
  journal={ArXiv},
  year={2020},
  volume={abs/2007.04393}
}
We consider regret minimization for online control with time-varying linear dynamical systems. The metric of performance we study is adaptive policy regret, or regret compared to the best policy on {\it any interval in time}. We give an efficient algorithm that attains first-order adaptive regret guarantees for the setting of online convex optimization with memory. We also show that these first-order bounds are nearly tight. This algorithm is then used to derive a controller with adaptive… Expand
Regret-optimal Estimation and Control
Generating Adversarial Disturbances for Controller Verification
Deluca - A Differentiable Control Library: Environments, Methods, and Benchmarking
Non-stationary Online Learning with Memory and Non-stochastic Control

References

SHOWING 1-10 OF 49 REFERENCES
Regret Bounds for Robust Adaptive Control of the Linear Quadratic Regulator
Regret Bounds for the Adaptive Control of Linear Quadratic Systems
Regret Bound of Adaptive Control in Linear Quadratic Gaussian (LQG) Systems
Logarithmic Regret for Online Control
Regret Minimization in Partially Observable Linear Quadratic Control
Model-Free Linear Quadratic Control via Reduction to Expert Prediction
Towards Provable Control for Unknown Linear Dynamical Systems
Certainty Equivalence is Efficient for Linear Quadratic Control
Certainty Equivalent Control of LQR is Efficient
...
1
2
3
4
5
...