arXiv:2605.22207eess.SYcs.LG2026-05中稿 · L4DC Conference

用核方法在未知系统中实时学安全函数,保障强化学习探索不踩雷。

Kernel-Based Safe Exploration in Deep Reinforcement Learning

  • 用核嵌入表示安全函数,动态迭代更新
  • 探索中自动识别并修正危险动作,确保概率安全
  • 适合对安全性要求高的连续控制场景

深度强化学习在真实世界部署时安全性是主要挑战。一种有前景的方法是联合学习策略与 extit{屏障函数}——从状态到实数的函数,能为初始状态赋低值,对不安全状态赋高值,并在每步转移后期望值递减,从而限制到达不安全状态的概率。此前方法直接从探索数据中学习屏障函数,需大量数据或对系统动力学施加限制。本文提出 extit{基于核的安全探索(KBSE)}算法,可在未知随机系统中通过核嵌入联合学习最优策略与屏障函数。屏障以条件均值嵌入形式表示,随探索迭代优化,提供更强的概率安全保证。探索过程中利用已学屏障识别安全违规,一旦发现即干预动作,将其替换为安全动作,确保探索始终处于可接受风险范围内。我们在多个复杂连续控制基准任务上评估了该算法,结果表明KBSE能在不降低奖励累积的前提下合成具有概率安全性的控制策略。

原文摘要 · Abstract (English)

Safety has been a major concern when deploying deep reinforcement learning algorithms in the real world. A promising direction that ensures that the learned policy does not visit unsafe regions is to learn a \emph{barrier function} along with the policy. A barrier is a function from states to reals that assigns low values to the initial states, high values to the unsafe states, and decreases in expectation on each transition; such a function can be used to bound the probability of reaching unsafe states. Previous attempts learned a barrier function directly from exploration data, but this required either large amounts of data or restrictions on the system dynamics. In this paper, we show how kernel embeddings can be used to learn barrier functions during deep reinforcement learning for stochastic systems with unknown dynamics. Our algorithm, \emph{kernel-based safe exploration (KBSE)}, learns an optimal policy and a barrier simultaneously during exploration. The barriers are computed iteratively, represented as conditional mean embeddings, and provide better probabilistic safety guarantees with more exploration. The exploration algorithm uses the learned barrier functions to identify safety violations. In the case of violation, it intervenes to modify the unsafe action to a safe action, thereby ensuring that the exploration is restricted to actions that bound the probability of reaching unsafe states. We evaluate KBSE on several complex continuous control benchmarks. Experimental results establish our new algorithm to be suitable for synthesizing control policies that are probabilistically safe without degradation in reward accumulation.

强化学习安全控制核方法

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。