Logarithmic Regret for Online Control

作者: Naman Agarwal, Elad Hazan, Karan Singh

摘要

We study optimal regret bounds for control in linear dynamical systems under adversarially changing strongly convex cost functions, given the knowledge of transition dynamics. This includes several well studied and influential frameworks such as the Kalman filter and the linear quadratic regulator. State of the art methods achieve regret which scales as T^0.5, where T is the time horizon.

PDF打开原文