Learning a Shield from Catastrophic Action Effects: Never Repeat the Same Mistake
Not on the map. Why?
Abstract (arXiv)
Agents that operate in an unknown environment are bound to make mistakes while learning, including, at least occasionally, some that lead to catastrophic consequences. When humans make catastrophic mistakes, they are expected to learn never to repeat them, such as a toddler who touches a hot stove and immediately learns never to do so again. In this work we consider a novel class of POMDPs, called POMDP with Catastrophic Actions (POMDP-CA) in which pairs of states and actions are labeled as catastrophic. Agents that act in a POMDP-CA do not have a priori knowledge about which (state, action) pairs are catastrophic, thus they are sure to make mistakes when trying to learn any meaningful policy. Rather, their aim is to maximize reward while never repeating mistakes. As a first step of avoiding mistake repetition, we leverage the concept of a shield which prevents agents from executing specific actions from specific states. In particular, we store catastrophic mistakes (unsafe pairs of states and actions) that agents make in a database. Agents are then forbidden to pick actions that appear in the database. This approach is especially useful in a continual learning setting, where groups of agents perform a variety of tasks over time in the same underlying environment. In this setting, a task-agnostic shield can be constructed in a way that stores mistakes made by any agent, such that once one agent in a group makes a mistake the entire group learns to never repeat that mistake. This paper introduces a variant of the PPO algorithm that utilizes this shield, called ShieldPPO, and empirically evaluates it in a controlled environment. Results indicate that ShieldPPO outperforms PPO, as well as baseline methods from the safe reinforcement learning literature, in a range of settings.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 9 of its 28 references that are in the map. First posted on arXiv 19 Feb 2022.
Builds on
9 of 28 references.
References · 9
- 2017Proximal Policy Optimization Algorithmscited by 15,215
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2017Constrained Policy Optimizationcited by 983
- 2017Safe Reinforcement Learning via Shieldingcited by 449
- 2018A Lyapunov-based Approach to Safe Reinforcement Learningcited by 297
- 2019IPO: Interior-point Policy Optimization under Constraintscited by 132
- 2021Safe Multi-Agent Reinforcement Learning via Shieldingcited by 61
- 2021Shielding Atari Games with Bounded Presciencecited by 14
- 2021Do Androids Dream of Electric Fences? Safety-Aware Reinforcement Learning with Latent Shieldingcited by 9
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 1.
5 papers.
- 2022Safe Reinforcement Learning via Shielding under Partial Observabilitycited by 56
- 2024Safe Reinforcement Learning in Black-Box Environments via Adaptive Shieldingcited by 6
- 2024Leveraging Approximate Model-based Shielding for Probabilistic Safety Guarantees in Continuous Environmentscited by 5
- 2023Approximate Shielding of Atari Agents for Safe Explorationcited by 2
- 2025Safe But Not Sorry: Reducing Over-Conservatism in Safety Critics via Uncertainty-Aware Modulationcited by 0
- 2025Safe But Not Sorry: Reducing Over-Conservatism in Safety Critics via Uncertainty-Aware Modulation21 Oct 2025
- 2024Safe Reinforcement Learning in Black-Box Environments via Adaptive Shielding28 May 2024
- 2024Leveraging Approximate Model-based Shielding for Probabilistic Safety Guarantees in Continuous Environments1 Feb 2024
- 2023Approximate Shielding of Atari Agents for Safe Exploration21 Apr 2023
- 2022Safe Reinforcement Learning via Shielding under Partial Observability2 Apr 2022