Lipschitz-Regularized Critics Lead to Policy Robustness Against Transition Dynamics Uncertainty
Xulin Chen, Ruipeng Liu, Zhenyu Gan, Garrett E. Katz
TL;DR
This work addresses the sim_to_real robustness gap in reinforcement learning by introducing PPO_PGDLC, which combines projected gradient descent based worst_case value estimation with a Lipschitz_regularized critic within the PPO framework. The method aims to produce policies that maintain performance under uncertain transition dynamics while delivering smoother actions for reliable hardware deployment. Through experiments on classic control benchmarks and a Unitree Go2 locomotion task, PPO_PGDLC demonstrates improved robustness to dynamics perturbations and smoother control, showing effectiveness of critic_smoothness in robust policy learning. The results indicate practical benefits for sim_to_real transfer and offer insights into task_specific regularization trade_offs for robust actor_critic learning.
Abstract
Uncertainties in transition dynamics pose a critical challenge in reinforcement learning (RL), often resulting in performance degradation of trained policies when deployed on hardware. Many robust RL approaches follow two strategies: enforcing smoothness in actor or actor-critic modules with Lipschitz regularization, or learning robust Bellman operators. However, the first strategy does not investigate the impact of critic-only Lipschitz regularization on policy robustness, while the second lacks comprehensive validation in real-world scenarios. Building on this gap and prior work, we propose PPO-PGDLC, an algorithm based on Proximal Policy Optimization (PPO) that integrates Projected Gradient Descent (PGD) with a Lipschitz-regularized critic (LC). The PGD component calculates the adversarial state within an uncertainty set to approximate the robust Bellman operator, and the Lipschitz-regularized critic further improves the smoothness of learned policies. Experimental results on two classic control tasks and one real-world robotic locomotion task demonstrates that, compared to several baseline algorithms, PPO-PGDLC achieves better performance and predicts smoother actions under environmental perturbations.
