Online Control with Adversarial Disturbances

02/23/2019
by   Naman Agarwal, et al.
8

We study the control of a linear dynamical system with adversarial disturbances (as opposed to statistical noise). The objective we consider is one of regret: we desire an online control procedure that can do nearly as well as that of a procedure that has full knowledge of the disturbances in hindsight. Our main result is an efficient algorithm that provides nearly tight regret bounds for this problem. From a technical standpoint, this work generalizes upon previous work in two main aspects: our model allows for adversarial noise in the dynamics, and allows for general convex costs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2020

Adaptive Regret for Control of Time-Varying Dynamics

We consider regret minimization for online control with time-varying lin...
research
03/02/2022

Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics

We consider the problem of controlling an unknown linear dynamical syste...
research
11/27/2019

The Nonstochastic Control Problem

We consider the problem of controlling an unknown linear dynamical syste...
research
02/29/2020

Logarithmic Regret for Adversarial Online Control

We introduce a new algorithm for online linear-quadratic control in a kn...
research
06/03/2022

Rate-Optimal Online Convex Optimization in Adaptive Linear Control

We consider the problem of controlling an unknown linear dynamical syste...
research
06/22/2020

Information Theoretic Regret Bounds for Online Nonlinear Control

This work studies the problem of sequential control in an unknown, nonli...
research
02/18/2021

Online Optimization and Learning in Uncertain Dynamical Environments with Performance Guarantees

We propose a new framework to solve online optimization and learning pro...

Please sign up or login with your details

Forgot password? Click here to reset