mlsanityData to 7 Oct 2026

Non-Stochastic Control with Bandit Feedback

arXiv 2008.05523 ↗First posted 12 Aug 2020cs.LG math.OC stat.MLcited by 17

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 12 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 4; 2023: 7; 2024: 3; 2025: 2.

17 papers.

Sort: