Achieving Zero Constraint Violation For Constrained Reinforcement Learning Via Primal-dual Approach
2021 Β· Qinbo Bai, Amrit Singh Bedi, Mridul Agarwal, et al.
Abstract
Reinforcement learning is widely used in applications where one needs to perform sequential decisions while interacting with the environment. The problem becomes more challenging when the decision requirement includes satisfying some safety constraints. The problem is mathematically formulated as constrained Markov decision process (CMDP). In the literature, various algorithms are available to solve CMDP problems in a model-free manner to achieve \(\epsilon\)-optimal cumulative reward with \(\epsilon\) feasible policies. An \(\epsilon\)-feasible policy implies that it suffers from constraint violation. An important question here is whether we can achieve \(\epsilon\)-optimal cumulative reward with zero constraint violations or not. To achieve that, we advocate the use of randomized primal-dual approach to solve the CMDP problems and propose a conservative stochastic primal-dual algorithm (CSPDA) which is shown to exhibit \(\tilde\{\mathcal\{O\}\}\left(1/\epsilon^2\right)\) sample compl
Authors
(none)
Tags
Stats
Related papers
- Provably Efficient Primal-dual Reinforcement Learning For Cmdps With Non-stationary Objectives And Constraints (2022)0.00
- A Near-optimal Primal-dual Method For Off-policy Learning In CMDP (2022)0.00
- A Policy Gradient Primal-dual Algorithm For Constrained Mdps With Uniform PAC Guarantees (2024)0.00
- Learning General Parameterized Policies For Infinite Horizon Average Reward Constrained Mdps Via Primal-dual Policy Gradient Algorithm (2024)0.00
- A Provably-efficient Model-free Algorithm For Constrained Markov Decision Processes (2021)0.00
- Efficient Policy Optimization In Robust Constrained Mdps With Iteration Complexity Guarantees (2025)0.00
- A Safe Exploration Approach To Constrained Markov Decision Processes (2023)0.00
- A Primal-dual Algorithm For Offline Constrained Reinforcement Learning With Linear Mdps (2024)0.00