Non-Stochastic Control with Bandit Feedback
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
Citing papers per year: 2021: 1; 2022: 4; 2023: 7; 2024: 3; 2025: 2.
17 papers.
Sort:
- 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
- 2023Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictionscited by 8
- 2024Improved Regret for Bandit Convex Optimization with Delayed Feedbackcited by 8
- 2023Optimal Rates for Bandit Nonstochastic Controlcited by 7
- 2022Optimal Dynamic Regret in LQR Controlcited by 6
- 2022Online Convex Optimization with Unbounded Memorycited by 6
- 2022Rate-Optimal Online Convex Optimization in Adaptive Linear Controlcited by 5
- 2023Online Nonstochastic Control with Adversarial and Static Constraintscited by 5
- 2022Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamicscited by 4
- 2023A Nonstochastic Control Approach to Optimizationcited by 4
- 2023Approximate Information States for Worst-Case Control and Learning in Uncertain Systemscited by 3
- 2023Adaptive Online Non-stochastic Controlcited by 3
5 more
- 2024Optimistic Online Non-stochastic Control via FTRLcited by 3
- 2023Online Nonstochastic Model-Free Reinforcement Learningcited by 2
- 2024Tight Rates for Bandit Control Beyond Quadraticscited by 2
- 2025Influential Bandits: Pulling an Arm May Change the Environmentcited by 0
- 2025Online Multi-Agent Control with Adversarial Disturbancescited by 0
- 2025Online Multi-Agent Control with Adversarial Disturbances23 Jun 2025
- 2025Influential Bandits: Pulling an Arm May Change the Environment11 Apr 2025
- 2024Tight Rates for Bandit Control Beyond Quadratics1 Oct 2024
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024
- 2024Improved Regret for Bandit Convex Optimization with Delayed Feedback14 Feb 2024
- 2023Adaptive Online Non-stochastic Control2 Oct 2023
- 2023Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictions20 Jul 2023
- 2023Online Nonstochastic Model-Free Reinforcement Learning27 May 2023
- 2023Optimal Rates for Bandit Nonstochastic Control24 May 2023
- 2023Online Nonstochastic Control with Adversarial and Static Constraints5 Feb 2023
- 2023A Nonstochastic Control Approach to Optimization19 Jan 2023
- 2023Approximate Information States for Worst-Case Control and Learning in Uncertain Systems12 Jan 2023
5 more
- 2022Online Convex Optimization with Unbounded Memory18 Oct 2022
- 2022Optimal Dynamic Regret in LQR Control18 Jun 2022
- 2022Rate-Optimal Online Convex Optimization in Adaptive Linear Control3 Jun 2022
- 2022Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamics2 Mar 2022
- 2021Non-stationary Online Learning with Memory and Non-stochastic Control7 Feb 2021
- 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
- 2023Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictionscited by 8
- 2024Improved Regret for Bandit Convex Optimization with Delayed Feedbackcited by 8
- 2023Optimal Rates for Bandit Nonstochastic Controlcited by 7
- 2022Optimal Dynamic Regret in LQR Controlcited by 6
- 2022Online Convex Optimization with Unbounded Memorycited by 6
- 2022Rate-Optimal Online Convex Optimization in Adaptive Linear Controlcited by 5
- 2023Online Nonstochastic Control with Adversarial and Static Constraintscited by 5
- 2022Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamicscited by 4
- 2023A Nonstochastic Control Approach to Optimizationcited by 4
- 2023Approximate Information States for Worst-Case Control and Learning in Uncertain Systemscited by 3
- 2023Adaptive Online Non-stochastic Controlcited by 3
12 most cited of 17 All 17 (JSON)
- 2025Online Multi-Agent Control with Adversarial Disturbances23 Jun 2025
- 2025Influential Bandits: Pulling an Arm May Change the Environment11 Apr 2025
- 2024Tight Rates for Bandit Control Beyond Quadratics1 Oct 2024
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024
- 2024Improved Regret for Bandit Convex Optimization with Delayed Feedback14 Feb 2024
- 2023Adaptive Online Non-stochastic Control2 Oct 2023
- 2023Beyond Black-Box Advice: Learning-Augmented Algorithms for MDPs with Q-Value Predictions20 Jul 2023
- 2023Online Nonstochastic Model-Free Reinforcement Learning27 May 2023
- 2023Optimal Rates for Bandit Nonstochastic Control24 May 2023
- 2023Online Nonstochastic Control with Adversarial and Static Constraints5 Feb 2023
- 2023A Nonstochastic Control Approach to Optimization19 Jan 2023
- 2023Approximate Information States for Worst-Case Control and Learning in Uncertain Systems12 Jan 2023
12 newest of 17 All 17 (JSON)