Sign inGet started
Paper · arXiv

CSPO: Constraint-Sensitive Policy Optimization for Safe Reinforcement Learning

Safe reinforcement learning (Safe RL) aims to maximize expected return while satisfying safety constraints, typically modeled as Constrained Markov Decision Processes (CMDPs). While primal-dual methods scale well to deep RL, they often suffer from delayed constraint correction, leading to oscillatory behavior and prolonged safety violations. In this paper, we propose Constraint-Sensitive Policy Optimization (CSPO), a first-order primal-dual method that incorporates local constraint sensitivity into policy updates. CSPO augments the primal objective with a constraint-sensitive correction derived from the shortest signed distance to the safety boundary, enabling smarter recovery steps back ...

AuthorsAyoub Belouadah, Sylvain Kubler, Yves Le Traon
Primary categorycs.AI
Published12 June 2026
Last updated at source12 June 2026
cs.AI
Embed this entry
<iframe src="https://silytics.si/embed/item/bd7fbe3f-239a-45ed-be9a-157144d1cd5c" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.