Sari la conținut

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCercetare AI

analiza aiqbench

This research addresses a critical gap in reinforcement learning safety by introducing an adaptive shielding framework that dynamically repairs Generalized Reactivity of rank 1 (GR(1)) specifications when environment assumptions are violated. By leveraging Inductive Logic Programming for online repair, the method maintains perfect logical compliance while preserving liveness properties and near-optimal reward performance, overcoming the rigidity of static symbolic controllers. The approach demonstrates significant improvements in robustness across case studies like Minepump and Atari Seaquest, offering a scalable path toward resilient AI agents in dynamic environments.
Sursă care acoperăarXiv
Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Adaptive GR(1) Specification Repair for Liveness-Preserving Shielding in Reinforcement Learning

arXiv2 min de cititArticolul și perspectiva sunt în engleză.

arXiv:2511.02605v3 Announce Type: replace Abstract: Shielding is widely used to enforce safety in reinforcement learning (RL), ensuring that an agent's actions remain compliant with formal specifications. Classical shielding approaches, however, are often static, in the sense that they assume fixed logical specifications and hand-crafted abstractions. While these static shields provide safety under nominal assumptions, they fail to adapt when environment assumptions are violated. In this paper, we develop an adaptive shielding framework based on based on Generalized Reactivity of rank 1 (GR(1)) specifications, a tractable and expressive fragment of Linear Temporal Logic (LTL) that captures both safety and liveness properties. Our method detects environment assumption violations at runtime and employs Inductive Logic Programming (ILP) to automatically repair GR(1) specifications online, in a systematic and interpretable way. This ensures that the shield evolves gracefully, ensuring liveness is achievable and minimally weakening goals only when necessary. We consider two case studies: Minepump and Atari Seaquest; showing that (i) static symbolic controllers are often severely suboptimal when optimizing for auxiliary rewards, and (ii) RL agents equipped with our adaptive shield maintain near-optimal reward and perfect logical compliance compared with static shields.

Abstract:Shielding is widely used to enforce safety in reinforcement learning (RL), ensuring that an agent's actions remain compliant with formal specifications. Classical shielding approaches, however, are often static, in the sense that they assume fixed logical specifications and hand-crafted abstractions. While these static shields provide safety under nominal assumptions, they fail to adapt when environment assumptions are violated. In this paper, we develop an adaptive shielding framework based on based on Generalized Reactivity of rank 1 (GR(1)) specifications, a tractable and expressive fragment of Linear Temporal Logic (LTL) that captures both safety and liveness properties. Our method detects environment assumption violations at runtime and employs Inductive Logic Programming (ILP) to automatically repair GR(1) specifications online, in a systematic and interpretable way. This ensures that the shield evolves gracefully, ensuring liveness is achievable and minimally weakening goals only when necessary. We consider two case studies: Minepump and Atari Seaquest; showing that (i) static symbolic controllers are often severely suboptimal when optimizing for auxiliary rewards, and (ii) RL agents equipped with our adaptive shield maintain near-optimal reward and perfect logical compliance compared with static shields.

Artificial Intelligence (cs.AI)

arXiv:2511.02605 [cs.AI]

(or arXiv:2511.02605v3 [cs.AI] for this version)

From: Alexander W. Goodall [view email] [v1] Tue, 4 Nov 2025 14:27:28 UTC (1,169 KB) [v2] Fri, 20 Feb 2026 17:44:58 UTC (1,134 KB) [v3] Mon, 24 Aug 2026 20:59:41 UTC (1,117 KB)

Text integral sub licența deschisă a publicației · 227 cuvinte

Subiecte conexe