arXiv:2008.05523 [cs.LG]AbstractReferencesReviewsResources
Non-Stochastic Control with Bandit Feedback
Paula Gradu, John Hallman, Elad Hazan
Published 2020-08-12Version 1
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.
Related articles: Most relevant | Search more
arXiv:2106.05165 [cs.LG] (Published 2021-06-09)
A Lyapunov-Based Methodology for Constrained Optimization with Bandit Feedback
arXiv:1905.13200 [cs.LG] (Published 2019-05-30)
Exploiting Uncertainty of Loss Landscape for Stochastic Optimization
arXiv:2305.00889 [cs.LG] (Published 2023-05-01)
The Impact of the Geometric Properties of the Constraint Set in Safe Optimization with Bandit Feedback