Finite-Time Regret Bounds for Recursive Adaptive Control with Matched Uncertainty

Recursive proximal learning and recursive least squares with exponential forgetting achieve finite regret in discrete-time adaptive control with matched uncertainty, scaling with the time required to satisfy a persistence of excitation condition.