vix.ing · top · new · best · stats · spec

Off-Policy Primal-Dual Safe Reinforcement Learning

2024/01/26 by Zifan Wu, Wu, Zifan, Bo Tang +13 · 2 citations
Computer Science · Engineering · #FOS: Computer and information sciences #Machine Learning (cs.LG) #Mechanical Circulatory Support Devices #Reinforcement Learning in Robotics

paper · pdf · doi:10.48550/arxiv.2401.14758

openalex publication_date 2024/01/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Primal-dual safe RL methods commonly perform iterations between the primal update of the policy and the dual update of the Lagrange Multiplier. Such a training paradigm is highly susceptible to the error in cumulative cost estimation since this estimation serves as the key bond connecting the primal and dual update processes. We show that this problem causes significant underestimation of cost when using off-policy methods, leading to the failure to satisfy the safety constraint. To address this issue, we propose conservative policy optimization, which learns a policy in a constraint-satisfying area by considering the uncertainty in cost estimation. This improves constraint satisfaction but also potentially hinders reward maximization. We then introduce local policy convexification to help eliminate such suboptimality by gradually reducing the estimation uncertainty. We provide theoretical interpretations of the joint coupling effect of these two ingredients and further verify them by extensive experiments. Results on benchmark tasks show that our method not only achieves an asymptotic performance comparable to state-of-the-art on-policy methods while using much fewer samples, but also significantly reduces constraint violation during training. Our code is available at https://github.com/ZifanWu/CAL.

Cited by

Related