Adaptive Probabilistic Shielding by Learning MDPs for Safe Reinforcement Learning

• URL: http://arxiv.org/abs/2608.19836v1
• Date: Thu, 20 Aug 2026 09:37:44 GMT
• Title: Adaptive Probabilistic Shielding by Learning MDPs for Safe Reinforcement Learning
• Abstract summary: We study the problem of computing a shield in the setting where the transition graph of the MDP is known.<n>As the RL agent explores the environment, we estimate the transition probabilities.<n>While the shield may be conservative initially, it adapts as the model estimate becomes more precise.
• Score: 13.82610991481171
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Probabilistic shielding is a technique for safe reinforcement learning (RL). Typically, a static observer -- called the shield -- constrains the learning agent's actions to those for which acting safely remains feasible. Traditionally, the shield is computed from the transition probabilities of the underlying Markov decision process (MDP). Thus, this technique is not applicable when the MDP model is not given a priori, which, unfortunately, is the case in typical RL applications. In this paper, we study the problem of computing a shield in the setting where the transition graph of the MDP is known, but the transition probabilities are unknown. Our approach integrates probabilistic shielding with online model learning: as the RL agent explores the environment, we estimate the transition probabilities. From this estimate, we compute a shield. While the shield may be conservative initially, it adapts as the model estimate becomes more precise. Thus, the shield improves in tandem with the RL agent. This paradigm of adaptive probabilistic shielding raises a number of challenges, such as when to recompute the shield and how to balance between exploration and safety during learning. We empirically evaluate multiple variants of this paradigm across several environments.

Related papers

• Robust Shielding for Safe Reinforcement Learning [55.99069346593732]
  Shielding is an effective approach to formally guarantee the safety of reinforcement learning agents in Markov decision processes (MDPs)<n>We introduce a novel shielding framework for robust MDPs with sets of transition probabilities.<n>Our experiments show that our shields for learned MDPs guarantee safety in unknown MDPs while recovering strong expected return as the number of samples increases.
  arXiv  Detail & Related papers  (2026-05-29T19:01:12Z)
• Interval POMDP Shielding for Imperfect-Perception Agents [0.5729426778193399]
  Autonomous systems that rely on learned perception can make unsafe decisions when sensor readings are misclassified.<n>We study shielding: given a proposed action, a shield blocks actions that could violate safety.<n>Experiments show that our shielding approach improves the safety of the system over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-04-22T16:12:37Z)
• Probabilistic Shielding for Safe Reinforcement Learning [51.35559820893218]
  In real-life scenarios, a Reinforcement Learning (RL) agent must often also behave in a safe manner, including at training time.<n>We present a new, scalable method, which enjoys strict formal guarantees for Safe RL.<n>We show that our approach provides a strict formal safety guarantee that the agent stays safe at training and test time.
  arXiv  Detail & Related papers  (2025-03-09T17:54:33Z)
• Lazy Layers to Make Fine-Tuned Diffusion Models More Traceable [70.77600345240867]
  A novel arbitrary-in-arbitrary-out (AIAO) strategy makes watermarks resilient to fine-tuning-based removal. Unlike the existing methods of designing a backdoor for the input/output space of diffusion models, in our method, we propose to embed the backdoor into the feature space of sampled subpaths. Our empirical studies on the MS-COCO, AFHQ, LSUN, CUB-200, and DreamBooth datasets confirm the robustness of AIAO.
  arXiv  Detail & Related papers  (2024-05-01T12:03:39Z)
• Shielded Reinforcement Learning for Hybrid Systems [1.0485739694839669]
  Reinforcement learning has been leveraged to construct near-optimal controllers, but their behavior is not guaranteed to be safe. One way of imposing safety to a learned controller is to use a shield, which is correct by design. We propose the construction of a shield using the so-called barbaric method, where an approximate finite representation of an underlying partition-based two-player safety game is extracted.
  arXiv  Detail & Related papers  (2023-08-28T09:04:52Z)
• Model-based Dynamic Shielding for Safe and Efficient Multi-Agent Reinforcement Learning [7.103977648997475]
  Multi-Agent Reinforcement Learning (MARL) discovers policies that maximize reward but do not have safety guarantees during the learning and deployment phases. Model-based Dynamic Shielding (MBDS) to support MARL algorithm design.
  arXiv  Detail & Related papers  (2023-04-13T06:08:10Z)
• Robust Control for Dynamical Systems With Non-Gaussian Noise via Formal Abstractions [59.605246463200736]
  We present a novel controller synthesis method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous control system into a finite-state model that captures noise by probabilistic transitions between discrete states. We use state-of-the-art verification techniques to provide guarantees on the interval Markov decision process and compute a controller for which these guarantees carry over to the original control system.
  arXiv  Detail & Related papers  (2023-01-04T10:40:30Z)
• Online Shielding for Reinforcement Learning [59.86192283565134]
  We propose an approach for online safety shielding of RL agents. During runtime, the shield analyses the safety of each available action. Based on this probability and a given threshold, the shield decides whether to block an action from the agent.
  arXiv  Detail & Related papers  (2022-12-04T16:00:29Z)
• Automata Learning meets Shielding [1.1417805445492082]
  Safety is still one of the major research challenges in reinforcement learning (RL) In this paper, we address the problem of how to avoid safety violations of RL agents during exploration in probabilistic and partially unknown environments. Our approach combines automata learning for Markov Decision Processes (MDPs) and shield synthesis in an iterative approach.
  arXiv  Detail & Related papers  (2022-12-04T14:58:12Z)
• Sampling-Based Robust Control of Autonomous Systems with Non-Gaussian Noise [59.47042225257565]
  We present a novel planning method that does not rely on any explicit representation of the noise distributions. First, we abstract the continuous system into a discrete-state model that captures noise by probabilistic transitions between states. We capture these bounds in the transition probability intervals of a so-called interval Markov decision process (iMDP)
  arXiv  Detail & Related papers  (2021-10-25T06:18:55Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.