Online Nonstochastic Control with Adversarial and Static Constraints
Not on the map. Why?
Abstract (arXiv)
This paper studies online nonstochastic control problems with adversarial and static constraints. We propose online nonstochastic control algorithms that achieve both sublinear regret and sublinear adversarial constraint violation while keeping static constraint violation minimal against the optimal constrained linear control policy in hindsight. To establish the results, we introduce an online convex optimization with memory framework under adversarial and static constraints, which serves as a subroutine for the constrained online nonstochastic control algorithms. This subroutine also achieves the state-of-the-art regret and constraint violation bounds for constrained online convex optimization problems, which is of independent interest. Our experiments demonstrate the proposed control algorithms are adaptive to adversarial constraints and achieve smaller cumulative costs and violations. Moreover, our algorithms are less conservative and achieve significantly smaller cumulative costs than the state-of-the-art algorithm.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 39 of its 56 references that are in the map. First posted on arXiv 5 Feb 2023.
Builds on
39 of 56 references.
References · 39
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2019Introduction to Online Convex Optimizationcited by 793
- 2021Safe Learning in Robotics: From Learning-Based Control to Safe Reinforcement Learningcited by 337
- 2019End-to-End Safe Reinforcement Learning through Barrier Functions for Safety-Critical Continuous Control Taskscited by 256
- 2017A General Safety Framework for Learning-Based Control in Uncertain Robotic Systemscited by 150
- 2020Exploration-Exploitation in Constrained MDPscited by 146
- 2020Provably Efficient Safe Exploration via Primal-Dual Policy Optimizationcited by 131
- 2018Learning-based Model Predictive Control for Safe Explorationcited by 116
- 2017Online Convex Optimization with Stochastic Constraintscited by 94
- 2019Online Control with Adversarial Disturbancescited by 92
- 2020Improper Learning for Non-Stochastic Controlcited by 83
- 2022Neural-Fly Enables Rapid Learning for Agile Flight in Strong Windscited by 80
27 more
- 2021Learning Policies with Zero or Bounded Constraint Violation for Constrained MDPscited by 78
- 2017Online Convex Optimization with Time-Varying Constraintscited by 55
- 2018Online Linear Quadratic Controlcited by 55
- 2020Learning nonlinear dynamical systems from a single trajectorycited by 46
- 2020Logarithmic Regret for Adversarial Online Controlcited by 41
- 2019Logarithmic Regret for Online Controlcited by 38
- 2021Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraintscited by 38
- 2022Near-Optimal Sample Complexity Bounds for Constrained MDPscited by 36
- 2018Linear model predictive safety certification for learning-based controlcited by 34
- 2021Safe Reinforcement Learning with Linear Function Approximationcited by 33
- 2018Safely Learning to Control the Constrained Linear Quadratic Regulatorcited by 31
- 2021An Efficient Pessimistic-Optimistic Algorithm for Stochastic Linear Bandits with General Constraintscited by 29
- 2022Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraintscited by 29
- 2022Provably Efficient Model-Free Constrained RL with Linear Function Approximationcited by 29
- 2021Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimizationcited by 21
- 2020Online Optimal Control with Affine Constraintscited by 20
- 2020Non-Stochastic Control with Bandit Feedbackcited by 17
- 2022Introduction to Online Controlcited by 17
- 2022Online Control of Unknown Time-Varying Dynamical Systemscited by 13
- 2020Conservative Stochastic Optimization with Expectation Constraintscited by 10
- 2020Geometric Exploration for Online Controlcited by 9
- 2021Machine Learning for Mechanical Ventilation Controlcited by 8
- 2021Provable Regret Bounds for Deep Online Learning and Controlcited by 6
- 2021Robust Online Control with Model Misspecificationcited by 4
- 2022Efficient Online Linear Control with Stochastic Convex Costs and Unknown Dynamicscited by 4
- 2020An online convex optimization algorithm for controlling linear systems with state and input constraintscited by 3
- 2023Online Convex Optimization with Stochastic Constraints: Zero Constraint Violation and Bandit Feedbackcited by 1
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 0; 2026: 1.
5 papers.
- 2023Learning the Uncertainty Sets for Control Dynamics via Set Membership: A Non-Asymptotic Analysiscited by 6
- 2023Adaptive Online Non-stochastic Controlcited by 3
- 2024Optimistic Online Non-stochastic Control via FTRLcited by 3
- 2024Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedbackcited by 0
- 2026Constrained Online Convex Optimization with Memory and Predictionscited by 0
- 2026Constrained Online Convex Optimization with Memory and Predictions22 Mar 2026
- 2024Safe and Efficient Online Convex Optimization with Linear Budget Constraints and Partial Feedback5 Dec 2024
- 2024Optimistic Online Non-stochastic Control via FTRL4 Apr 2024
- 2023Adaptive Online Non-stochastic Control2 Oct 2023
- 2023Learning the Uncertainty Sets for Control Dynamics via Set Membership: A Non-Asymptotic Analysis26 Sep 2023