Learning with Safety Constraints: Sample Complexity of Reinforcement Learning for Constrained MDPs
Not on the map. Why?
Abstract (arXiv)
Many physical systems have underlying safety considerations that require that the policy employed ensures the satisfaction of a set of constraints. The analytical formulation usually takes the form of a Constrained Markov Decision Process (CMDP). We focus on the case where the CMDP is unknown, and RL algorithms obtain samples to discover the model and compute an optimal constrained policy. Our goal is to characterize the relationship between safety constraints and the number of samples needed to ensure a desired level of accuracy -- both objective maximization and constraint satisfaction -- in a PAC sense. We explore two classes of RL algorithms, namely, (i) a generative model based approach, wherein samples are taken initially to estimate a model, and (ii) an online approach, wherein the model is updated as samples are obtained. Our main finding is that compared to the best known bounds of the unconstrained regime, the sample complexity of constrained RL algorithms are increased by a factor that is logarithmic in the number of constraints, which suggests that the approach may be easily utilized in real systems.
Key facts. Cited by 32 papers in the map (data through 7 Oct 2026). First posted on arXiv 1 Aug 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 5; 2022: 5; 2023: 7; 2024: 8; 2025: 4; 2026: 3.
32 papers.
Sort:
By area:
- 2022Enforcing Hard Constraints with Soft Barriers: Safe Reinforcement Learning in Unknown Stochastic Environmentscited by 54
- 2021DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learningcited by 34
- 2025VLSA: Vision-Language-Action Models with Plug-and-Play Safety Constraint Layercited by 32
- 2023Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexitycited by 16
- 2021RLOps: Development Life-cycle of Reinforcement Learning Aided Open RANcited by 15
- 2023A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraintscited by 15
- 2021Reinforcement Learning with Almost Sure Constraintscited by 11
- 2024Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Formcited by 10
- 2022Provable Safe Reinforcement Learning with Binary Feedbackcited by 7
- 2024Latent Safety-Constrained Policy Approach for Safe Offline Reinforcement Learningcited by 7
- 2023Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violationcited by 6
- 2023ROSARL: Reward-Only Safe Reinforcement Learningcited by 5
20 more
- 2024A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guaranteescited by 5
- 2024What Are the Odds? Improving the foundations of Statistical Model Checkingcited by 5
- 2024Deterministic Policies for Constrained Reinforcement Learning in Polynomial Timecited by 5
- 2022Reinforcement Learning with a Terminatorcited by 4
- 2025Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximationcited by 4
- 2023Provable Reset-free Reinforcement Learning by No-Regret Reductioncited by 3
- 2026Your Model Already Knows: Attention-Guided Safety Filter for Vision-Language-Action Modelscited by 3
- 2021Learning to Act Safely with Limited Exposure and Almost Sure Certaintycited by 2
- 2022Ablation Study of How Run Time Assurance Impacts the Training and Performance of Reinforcement Learning Agentscited by 2
- 2023Reinforcement Learning Under Probabilistic Spatio-Temporal Constraints with Time Windowscited by 2
- 2023Finite-Time Analysis of Three-Timescale Constrained Actor-Critic and Constrained Natural Actor-Critic Algorithmscited by 2
- 2022Finding Safe Zones of policies Markov Decision Processescited by 1
- 2024Structured Reinforcement Learning for Media Streaming at the Wireless Edgecited by 1
- 2024Anytime-Constrained Equilibria in Polynomial Timecited by 1
- 2025Polynomial-Time Approximability of Constrained Reinforcement Learningcited by 1
- 2026Near-Optimal Sample Complexity for Online Constrained MDPscited by 1
- 2021Reinforcement Learning for Finite-Horizon Restless Multi-Armed Multi-Action Banditscited by 0
- 2024Natural Policy Gradient and Actor Critic Methods for Constrained Multi-Task Reinforcement Learningcited by 0
- 2025Constrained Online Decision-Making: A Unified Frameworkcited by 0
- 2026LexiSafe: Offline Safe Reinforcement Learning with Lexicographic Safety-Reward Hierarchycited by 0
- 2026Your Model Already Knows: Attention-Guided Safety Filter for Vision-Language-Action Models8 Jun 2026
- 2026LexiSafe: Offline Safe Reinforcement Learning with Lexicographic Safety-Reward Hierarchy19 Feb 2026
- 2026Near-Optimal Sample Complexity for Online Constrained MDPs16 Feb 2026
- 2025VLSA: Vision-Language-Action Models with Plug-and-Play Safety Constraint Layer9 Dec 2025
- 2025Constrained Online Decision-Making: A Unified Framework11 May 2025
- 2025Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation14 Feb 2025
- 2025Polynomial-Time Approximability of Constrained Reinforcement Learning11 Feb 2025
- 2024Latent Safety-Constrained Policy Approach for Safe Offline Reinforcement Learning11 Dec 2024
- 2024Anytime-Constrained Equilibria in Polynomial Time31 Oct 2024
- 2024Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form29 Aug 2024
- 2024Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time23 May 2024
- 2024Natural Policy Gradient and Actor Critic Methods for Constrained Multi-Task Reinforcement Learning3 May 2024
20 more
- 2024Structured Reinforcement Learning for Media Streaming at the Wireless Edge10 Apr 2024
- 2024What Are the Odds? Improving the foundations of Statistical Model Checking8 Apr 2024
- 2024A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guarantees31 Jan 2024
- 2023Finite-Time Analysis of Three-Timescale Constrained Actor-Critic and Constrained Natural Actor-Critic Algorithms25 Oct 2023
- 2023Reinforcement Learning Under Probabilistic Spatio-Temporal Constraints with Time Windows29 Jul 2023
- 2023Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexity20 Jun 2023
- 2023ROSARL: Reward-Only Safe Reinforcement Learning31 May 2023
- 2023A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraints8 Feb 2023
- 2023Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violation27 Jan 2023
- 2023Provable Reset-free Reinforcement Learning by No-Regret Reduction6 Jan 2023
- 2022Provable Safe Reinforcement Learning with Binary Feedback26 Oct 2022
- 2022Enforcing Hard Constraints with Soft Barriers: Safe Reinforcement Learning in Unknown Stochastic Environments29 Sep 2022
- 2022Ablation Study of How Run Time Assurance Impacts the Training and Performance of Reinforcement Learning Agents8 Jul 2022
- 2022Reinforcement Learning with a Terminator30 May 2022
- 2022Finding Safe Zones of policies Markov Decision Processes23 Feb 2022
- 2021Reinforcement Learning with Almost Sure Constraints9 Dec 2021
- 2021DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learning1 Dec 2021
- 2021RLOps: Development Life-cycle of Reinforcement Learning Aided Open RAN12 Nov 2021
- 2021Reinforcement Learning for Finite-Horizon Restless Multi-Armed Multi-Action Bandits20 Sep 2021
- 2021Learning to Act Safely with Limited Exposure and Almost Sure Certainty18 May 2021
- 2022Enforcing Hard Constraints with Soft Barriers: Safe Reinforcement Learning in Unknown Stochastic Environmentscited by 54
- 2021DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learningcited by 34
- 2023Soft Robust MDPs and Risk-Sensitive MDPs: Equivalence, Policy Gradient, and Sample Complexitycited by 16
- 2021RLOps: Development Life-cycle of Reinforcement Learning Aided Open RANcited by 15
- 2023A Near-Optimal Algorithm for Safe Reinforcement Learning Under Instantaneous Hard Constraintscited by 15
- 2021Reinforcement Learning with Almost Sure Constraintscited by 11
- 2024Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Formcited by 10
- 2022Provable Safe Reinforcement Learning with Binary Feedbackcited by 7
- 2023Safe Posterior Sampling for Constrained MDPs with Bounded Constraint Violationcited by 6
- 2023ROSARL: Reward-Only Safe Reinforcement Learningcited by 5
- 2024A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guaranteescited by 5
- 2024What Are the Odds? Improving the foundations of Statistical Model Checkingcited by 5
12 most cited of 28 All 28 (JSON)
- 2026Near-Optimal Sample Complexity for Online Constrained MDPs16 Feb 2026
- 2025Constrained Online Decision-Making: A Unified Framework11 May 2025
- 2025Provably Efficient RL under Episode-Wise Safety in Constrained MDPs with Linear Function Approximation14 Feb 2025
- 2025Polynomial-Time Approximability of Constrained Reinforcement Learning11 Feb 2025
- 2024Anytime-Constrained Equilibria in Polynomial Time31 Oct 2024
- 2024Near-Optimal Policy Identification in Robust Constrained Markov Decision Processes via Epigraph Form29 Aug 2024
- 2024Deterministic Policies for Constrained Reinforcement Learning in Polynomial Time23 May 2024
- 2024Natural Policy Gradient and Actor Critic Methods for Constrained Multi-Task Reinforcement Learning3 May 2024
- 2024Structured Reinforcement Learning for Media Streaming at the Wireless Edge10 Apr 2024
- 2024What Are the Odds? Improving the foundations of Statistical Model Checking8 Apr 2024
- 2024A Policy Gradient Primal-Dual Algorithm for Constrained MDPs with Uniform PAC Guarantees31 Jan 2024
- 2023Finite-Time Analysis of Three-Timescale Constrained Actor-Critic and Constrained Natural Actor-Critic Algorithms25 Oct 2023
12 newest of 28 All 28 (JSON)