Non-Stochastic Control with Bandit Feedback

08/12/2020
by   Paula Gradu, et al.
0

We study the problem of controlling a linear dynamical system with adversarial perturbations where the only feedback available to the controller is the scalar loss, and the loss function itself is unknown. For this problem, with either a known or unknown system, we give an efficient sublinear regret algorithm. The main algorithmic difficulty is the dependence of the loss on past controls. To overcome this issue, we propose an efficient algorithm for the general setting of bandit convex optimization for loss functions with memory, which may be of independent interest.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2019

The Nonstochastic Control Problem

We consider the problem of controlling an unknown linear dynamical syste...
research
05/24/2023

Optimal Rates for Bandit Nonstochastic Control

Linear Quadratic Regulator (LQR) and Linear Quadratic Gaussian (LQG) con...
research
01/25/2020

Improper Learning for Non-Stochastic Control

We consider the problem of controlling a possibly unknown linear dynamic...
research
07/01/2020

Bandit Linear Control

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

Adaptive Bandit Convex Optimization with Heterogeneous Curvature

We consider the problem of adversarial bandit convex optimization, that ...
research
02/22/2017

Fast Rates for Bandit Optimization with Upper-Confidence Frank-Wolfe

We consider the problem of bandit optimization, inspired by stochastic o...
research
05/01/2023

The Impact of the Geometric Properties of the Constraint Set in Safe Optimization with Bandit Feedback

We consider a safe optimization problem with bandit feedback in which an...

Please sign up or login with your details

Forgot password? Click here to reset