aiqbench analysis
This research theoretically resolves the long-standing tradeoff between safety enforcement and performance optimization in reinforcement learning, proving that a sufficiently permissive safety filter does not degrade asymptotic returns. By formally separating safety constraints from the learning objective within a filtered Markov decision process framework, the study provides a principled approach for deploying RL in safety-critical systems without sacrificing efficiency. These findings offer a robust foundation for building reliable AI agents where catastrophic failure must be categorically avoided.
Provably Optimal Reinforcement Learning under Safety Filtering
arXiv:2510.18082v3 Announce Type: replace-cross Abstract: Recent advances in reinforcement learning (RL) enable its use on increasingly complex tasks, but the lack of formal safety guarantees still limits its application in safety-critical settings. A common practical approach is to augment the RL policy with a safety filter that overrides unsafe actions to prevent failures during both training and deployment. However, safety filtering is often perceived as sacrificing performance and hindering the learning process. We show that this perceived safety-performance tradeoff is not inherent and prove, for the first time, that enforcing safety with a sufficiently permissive safety filter does not degrade asymptotic performance. We formalize RL safety with a safety-critical Markov decision process (SC-MDP), which requires categorical, rather than high-probability, avoidance of catastrophic failure states. Additionally, we define an associated filtered MDP in which all actions result in safe effects, thanks to a safety filter that is considered to be a part of the environment. Our main theorem establishes that (i) learning in the filtered MDP is safe categorically, (ii) standard RL convergence carries over to the filtered MDP, and (iii) any policy that is optimal in the filtered MDP, when executed through the same filter, achieves the same asymptotic return as the best safe policy in the SC-MDP, yielding a complete separation between safety enforcement and performance optimization. We validate the theory on Safety Gymnasium with representative tasks and constraints, observing zero violations during training and final performance matching or exceeding unfiltered baselines. Together, these results shed light on a long-standing question in safety-filtered learning and provide a simple, principled recipe for safe RL: train and deploy RL policies with the most permissive safety filter that is available.
Abstract:Recent advances in reinforcement learning (RL) enable its use on increasingly complex tasks, but the lack of formal safety guarantees still limits its application in safety-critical settings. A common practical approach is to augment the RL policy with a safety filter that overrides unsafe actions to prevent failures during both training and deployment. However, safety filtering is often perceived as sacrificing performance and hindering the learning process. We show that this perceived safety-performance tradeoff is not inherent and prove, for the first time, that enforcing safety with a sufficiently permissive safety filter does not degrade asymptotic performance. We formalize RL safety with a safety-critical Markov decision process (SC-MDP), which requires categorical, rather than high-probability, avoidance of catastrophic failure states. Additionally, we define an associated filtered MDP in which all actions result in safe effects, thanks to a safety filter that is considered to be a part of the environment. Our main theorem establishes that (i) learning in the filtered MDP is safe categorically, (ii) standard RL convergence carries over to the filtered MDP, and (iii) any policy that is optimal in the filtered MDP, when executed through the same filter, achieves the same asymptotic return as the best safe policy in the SC-MDP, yielding a complete separation between safety enforcement and performance optimization. We validate the theory on Safety Gymnasium with representative tasks and constraints, observing zero violations during training and final performance matching or exceeding unfiltered baselines. Together, these results shed light on a long-standing question in safety-filtered learning and provide a simple, principled recipe for safe RL: train and deploy RL policies with the most permissive safety filter that is available.
Machine Learning (cs.LG); Robotics (cs.RO); Systems and Control (eess.SY)
arXiv:2510.18082 [cs.LG]
(or arXiv:2510.18082v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2510.18082 Focus to learn more arXiv-issued DOI via DataCite
https://doi.org/10.1609/iaseai.v2i1.43046 Focus to learn more DOI(s) linking to related resources
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 381 words
Related coverage

Continual learning might make your blocking monitors nearly useless
AI Alignment Forum · Sep 24, 2026
Provably Safe, Yet Scalable Reinforcement Learning
arXiv · Jun 16, 2026
FAITH: Feasibility-Aware Safety-Filtered RL for High-Dimensional Systems
arXiv · Oct 9, 2026
A Unified Bellman Operator for Safety-Critical Reinforcement Learning
arXiv · Oct 9, 2026