Regret Bounds for Adaptive Nonlinear Control

Abstract

We study the problem of adaptively controlling a known discrete-time nonlinear system subject to unmodeled disturbances. We prove the first finite-time regret bounds for adaptive nonlinear control with matched uncertainty in the stochastic setting, showing that the regret suffered by certainty equivalence adaptive control, compared to an oracle controller with perfect knowledge of the unmodeled disturbances, is upper bounded by $\tilde{O}(\sqrt{T})$ in expectation. Furthermore, we show that when the input is subject to a $k$ timestep delay, the regret degrades to $\tilde{O}(k\sqrt{T})$. Our analysis draws connections between classical stability notions in nonlinear control theory (Lyapunov stability and contraction theory) and modern regret analysis from online convex optimization. The use of stability theory allows us to analyze the challenging infinite-horizon single trajectory setting.

References in corpus (8)

• Learning agile and dynamic motor skills for legged robots
• Solving Rubik's Cube with a Robot Hand
• Provably Efficient Reinforcement Learning with Linear Function Approximation
• Online Control with Adversarial Disturbances
• Optimism in Reinforcement Learning with Generalized Linear Function Approximation
• Logarithmic Regret for Online Control
• Active Learning for Nonlinear System Identification with Guarantees
• Boosting for Control of Dynamical Systems