# Logarithmic Regret for Adversarial Online Control

Source: [Logarithmic Regret for Adversarial Online Control](<https://www.sota2.com/research/paper/68fa57161e209131ce9a24ba>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T14:32:44.520Z

Authors: Dylan J. Foster, Max Simchowitz

Published: 2020-02-29T06:29:19.000Z

## Abstract

We introduce a new algorithm for online linear-quadratic control in a known system subject to adversarial disturbances. Existing regret bounds for this setting scale as $\\sqrt{T}$ unless strong stochastic assumptions are imposed on the disturbance process. We give the first algorithm with logarithmic regret for arbitrary adversarial disturbance sequences, provided the state and control costs are given by known quadratic functions. Our algorithm and analysis use a characterization for the optimal offline control law to reduce the online control problem to (delayed) online learning with approximate advantage functions. Compared to previous techniques, our approach does not need to control movement costs for the iterates, leading to logarithmic regret.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

- [Online Control on LQR/LQG theoretical settings](<https://www.sota2.com/research/sota/online-control-on-lqr-lqg-theoretical-settings.md>): Online Control; LQR/LQG theoretical settings; Regret: 1.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/2003.00189>)

[PDF](<https://arxiv.org/pdf/2003.00189.pdf>)
