做强化学习验证或RNN策略安全的团队，终于有了一个能给出概率性保证的实用工具，比传统过近似方法更精准，值得关注。
针对循环神经网络（RNN）在部分可观测强化学习中的策略验证难题，研究者提出RNN-ProVe框架。该框架通过策略驱动采样近似隐藏状态空间，并利用统计误差界给出行为违规的高置信度概率估计。实验表明，RNN-ProVe在单智能体和多智能体任务中，比现有工具提供更定量、更可行的概率保证，且能扩展到循环和多智能体场景。
Probabilistic Verification of Recurrent Neural Networks for Single and Multi-Agent Reinforcement Learning
History-dependent policies induced by recurrent neural networks (RNNs) rely on latent hidden state dynamics, making verification in partially observable reinforcement learning (RL) challenging. Existing RNN verification tools typically rely on restrictive modeling assumptions or coarse over-approximations of the hidden state space, which can lead to overly conservative or inconclusive results. We propose $\textbf{RNN}$ $\textbf{Pro}$babilistic $\textbf{Ve}$rification ($\texttt{RNN-ProVe}$), a probabilistic framework that $\textit{estimates the likelihood}$ of undesired behaviors in RNN-based policies. $\texttt{RNN-ProVe}$ uses policy-driven sampling to approximate the set of hidden states that are feasible under a trained policy, and derives statistical error bounds to produce bounded-error, high-confidence estimates of behavioral violations. Experiments on partially observable single-agent and cooperative multi-agent tasks show that $\texttt{RNN-ProVe}$ yields more quantitative, feasibility-aware probabilistic guarantees than existing tools, while scaling to recurrent and multi-agent settings.