Successive Convex Approximation Based Off-Policy Optimization for Constrained Reinforcement Learning

Abstract

We propose a successive convex approximation based off-policy optimization (SCAOPO) algorithm to solve the general constrained reinforcement learning problem, which is formulated as a constrained Markov decision process (CMDP) in the context of average cost. The SCAOPO is based on solving a sequence of convex objective/feasibility optimization problems obtained by replacing the objective and constraint functions in the original problems with convex surrogate functions. At each iteration, the convex surrogate problem can be efficiently solved by Lagrange dual method even the policy is parameterized by a high-dimensional function. Moreover, the SCAOPO enables to reuse old experiences from previous updates, thereby significantly reducing the implementation cost when deployed in the real-world engineering systems that need to online learn the environment. In spite of the time-varying state distribution and the stochastic bias incurred by the off-policy learning, the SCAOPO with a feasible initial point can still provably converge to a Karush-Kuhn-Tucker (KKT) point of the original problem almost surely.

submitted to Transactions on Signal Processing

References in corpus (10)

• Artificial Intelligence-Enabled Intelligent 6G Networks
• Safe Exploration in Continuous Action Spaces
• Lyapunov-based Safe Policy Optimization for Continuous Control
• Projection-Based Constrained Policy Optimization
• AlgaeDICE: Policy Gradient from Arbitrary Experience
• First Order Constrained Optimization in Policy Space
• Provably Efficient Safe Exploration via Primal-Dual Policy Optimization
• Convergent Policy Optimization for Safe Reinforcement Learning
• Generalized Proximal Policy Optimization with Sample Reuse
• Constrained Markov Decision Processes via Backward Value Functions