Achieving Zero Constraint Violation for Constrained Reinforcement Learning via Primal-Dual Approach

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 ∊-optimal cumulative reward with ∊ feasible policies. An ∊-feasible policy implies that it suffers from constraint violation. An important question here is whether we can achieve ∊-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 Õ(1/∊2) sample complexity to achieve ∊-optimal cumulative reward with zero constraint violations. In the prior works, the best available sample complexity for the ∊-optimal policy with zero constraint violation is Õ(1/∊5). Hence, the proposed algorithm provides a significant improvement as compared to the state of the art.