Do No Harm: A Counterfactual Approach to Safe Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
Reinforcement Learning (RL) for control has become increasingly popular due to its ability to learn rich feedback policies that take into account uncertainty and complex representations of the environment. When considering safety constraints, constrained optimization approaches, where agents are penalized for constraint violations, are commonly used. In such methods, if agents are initialized in, or must visit, states where constraint violation might be inevitable, it is unclear how much they should be penalized. We address this challenge by formulating a constraint on the counterfactual harm of the learned policy compared to a default, safe policy. In a philosophical sense this formulation only penalizes the learner for constraint violations that it caused; in a practical sense it maintains feasibility of the optimal control problem. We present simulation studies on a rover with uncertain road friction and a tractor-trailer parking environment that demonstrate our constraint formulation enables agents to learn safer policies than contemporary constrained RL methods.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 36 references that are in the map. First posted on arXiv 19 May 2024.
Builds on
23 of 36 references.
References · 23
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2015High-Dimensional Continuous Control Using Generalized Advantage Estimationcited by 1,916
- 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
- 2017Counterfactual Multi-Agent Policy Gradientscited by 733
- 2018Behavioral Cloning from Observationcited by 482
- 2017Deep Reinforcement Learning: An Overviewcited by 327
- 2015Risk-Constrained Reinforcement Learning with Percentile Risk Criteriacited by 320
- 2019End-to-End Safe Reinforcement Learning through Barrier Functions for Safety-Critical Continuous Control Taskscited by 256
- 2017Hamilton-Jacobi Reachability: A Brief Overview and Recent Advancescited by 186
- 2019Constrained Reinforcement Learning Has Zero Duality Gapcited by 144
- 2018Deep Counterfactual Regret Minimizationcited by 102
- 2018Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Searchcited by 81
11 more
- 2013Counterfactual Probabilities: Computational Methods, Bounds and Applicationscited by 67
- 2021Direct Behavior Specification via Constrained Reinforcement Learningcited by 30
- 2022Counterfactual harmcited by 29
- 2020Reachability-based Trajectory Safeguard (RTS): A Safe and Fast Reinforcement Learning Safety Layer for Continuous Controlcited by 28
- 2022Sim-to-Lab-to-Real: Safe Reinforcement Learning with Shielding and Generalization Guaranteescited by 24
- 2023Solving Stabilize-Avoid Optimal Control via Epigraph Form and Deep Reinforcement Learningcited by 24
- 2022Safe Reinforcement Learning Using Black-Box Reachability Analysiscited by 22
- 2021On Blame Attribution for Accountable Multi-Agent Sequential Decision Makingcited by 13
- 2022Quantifying Harmcited by 10
- 2023Adaptive and Explainable Deployment of Navigation Skills via Hierarchical Deep Reinforcement Learningcited by 9
- 2022Infinite-Horizon Reach-Avoid Zero-Sum Games via Deep Reinforcement Learningcited by 6
Built on by
Citing papers per year: 2026: 1.
1 paper.