arXiv:2604.14243cs.LGcs.AI2026-04

在对手干扰下保证安全与最优,首次实现对抗性环境中的约束强化学习。

Optimistic Policy Learning under Pessimistic Adversaries with Regret and Violation Guarantees

  • 将外部干扰建模为对抗策略,同时乐观估计自身与对手行为。
  • 理论证明算法具有次线性遗憾和约束违规量,可保障长期性能。
  • 适合高安全要求场景,如自动驾驶、机器人控制中的鲁棒决策。

现实决策系统所处环境的状态转移不仅取决于智能体动作,还受不可控的外生因素影响——如竞争性智能体、环境扰动或战略对手——形式化为 $s_{h+1} = f(s_h, a_h, \bar{a}_h)+ω_h$,其中 $\bar{a}_h$ 为对手/外部动作,$a_h$ 为智能体动作,$ω_h$ 为加性噪声。忽略此类因素可能导致在孤立环境下最优的策略在部署时灾难性失败,尤其在需满足安全约束时。标准约束马尔可夫决策过程假设智能体是状态演化的唯一驱动者,该假设在安全关键场景中失效。现有鲁棒强化学习方法通过过渡核的分布鲁棒性应对,但未显式建模智能体与外生因素间的策略互动,且依赖对已知基准模型的强偏离假设。本文将外生因素建模为对抗策略 $\barπ$,与智能体共同决定状态转移,并研究智能体如何在对抗下保持最优与安全。据我们所知,这是首个研究显式对抗动态下的安全约束强化学习的工作。提出基于模型的 exttt{RHC-UCRL} 算法,同时对智能体与对手策略保持乐观,明确分离认知不确定性与偶然性不确定性。该算法实现了次线性遗憾与约束违规保证。

原文摘要 · Abstract (English)

Real-world decision-making systems operate in environments where state transitions depend not only on the agent's actions, but also on \textbf{exogenous factors outside its control}--competing agents, environmental disturbances, or strategic adversaries--formally, $s_{h+1} = f(s_h, a_h, \bar{a}_h)+ω_h$ where $\bar{a}_h$ is the adversary/external action, $a_h$ is the agent's action, and $ω_h$ is an additive noise. Ignoring such factors can yield policies that are optimal in isolation but \textbf{fail catastrophically in deployment}, particularly when safety constraints must be satisfied. Standard Constrained MDP formulations assume the agent is the sole driver of state evolution, an assumption that breaks down in safety-critical settings. Existing robust RL approaches address this via distributional robustness over transition kernels, but do not explicitly model the \textbf{strategic interaction} between agent and exogenous factor, and rely on strong assumptions about divergence from a known nominal model. We model the exogenous factor as an \textbf{adversarial policy} $\barπ$ that co-determines state transitions, and ask how an agent can remain both optimal and safe against such an adversary. \emph{To the best of our knowledge, this is the first work to study safety-constrained RL under explicit adversarial dynamics}. We propose \textbf{Robust Hallucinated Constrained Upper-Confidence RL} (\texttt{RHC-UCRL}), a model-based algorithm that maintains optimism over both agent and adversary policies, explicitly separating epistemic from aleatoric uncertainty. \texttt{RHC-UCRL} achieves sub-linear regret and constraint violation guarantees.

强化学习对抗环境安全约束鲁棒决策

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