Non-Stochastic Control with Bandit Feedback
Paula Gradu, John Hallman, Elad Hazan
2020年份
31被引次数
12顶会引用
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper12
- Efficient Methods for Non-stationary Online LearningPeng Zhao, Yan-Feng Xie, Lijun Zhang, Zhi-Hua ZhouNeurIPS 2022 · 被引用 39 次
- Optimal Dynamic Regret in LQR ControlDheeraj Baby, Yu-Xiang WangNeurIPS 2022 · 被引用 19 次
- Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value PredictionsTongxin Li, Yiheng Lin, Shaolei Ren, Adam WiermanNeurIPS 2023 · 被引用 14 次
- Online Convex Optimization with Unbounded MemoryRaunak Kumar, Sarah Dean, Robert KleinbergNeurIPS 2023 · 被引用 12 次
- Rate-Optimal Online Convex Optimization in Adaptive Linear ControlAsaf B. Cassel, Alon Peled-Cohen, Tomer KorenNeurIPS 2022 · 被引用 12 次
它引用的顶会 Paper1
相关 Paper
- Bandit Linear ControlAsaf B. Cassel, Tomer KorenNeurIPS 2020 · 被引用 19 次
- Geometric Exploration for Online ControlOrestis Plevrakis, Elad HazanNeurIPS 2020 · 被引用 12 次
- Optimal Rates for Bandit Nonstochastic ControlY. Jennifer Sun, Stephen H. Newman, Elad HazanNeurIPS 2023 · 被引用 9 次
- Tight Rates for Bandit Control Beyond QuadraticsY. Jennifer Sun, Zhou LuNeurIPS 2024 · 被引用 2 次
- Online Nonstochastic Control with Adversarial and Static ConstraintsXin Liu, Zixian Yang, Lei YingICML 2023 · 被引用 6 次
