Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics

03/02/2022
by   Asaf Cassel, et al.
3

We consider the problem of controlling an unknown linear dynamical system under a stochastic convex cost and full feedback of both the state and cost function. We present a computationally efficient algorithm that attains an optimal √(T) regret-rate against the best stabilizing linear controller. In contrast to previous work, our algorithm is based on the Optimism in the Face of Uncertainty paradigm. This results in a substantially improved computational complexity and a simpler analysis.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
07/01/2020

Bandit Linear Control

We consider the problem of controlling a known linear dynamical system u...
research
02/23/2019

Online Control with Adversarial Disturbances

We study the control of a linear dynamical system with adversarial distu...
research
11/27/2019

The Nonstochastic Control Problem

We consider the problem of controlling an unknown linear dynamical syste...
research
04/22/2018

Maximizing Profit with Convex Costs in the Random-order Model

Suppose a set of requests arrives online: each request gives some value ...
research
07/13/2020

Black-Box Control for Linear Dynamical Systems

We consider the problem of controlling an unknown linear time-invariant ...
research
12/31/2021

Stochastic convex optimization for provably efficient apprenticeship learning

We consider large-scale Markov decision processes (MDPs) with an unknown...

Please sign up or login with your details

Forgot password? Click here to reset