跳到正文
Jones Ray

ScholarPulse 日报 2026-06-25

2026-06-25 学术简报:2 篇。RL后训练隐式提供步骤级评分的progress advantage,无需专门奖励模型训练。

今日速览

序号标题来源日期主题推荐等级
1Neglected Free Lunch from Post-training: Progress Advantage for LLM AgentsarXiv2026-06-24AI-Agent高
2The Unfireable Safety Kernel: Execution-Time AI Alignment for AI Agents and Other Escapable AI SystemsarXiv2026-06-24AI-Agent高

重点论文与技术动态

1. Neglected Free Lunch from Post-training: Progress Advantage for LLM Agents

一句话结论

RL后训练隐式提供步骤级评分的progress advantage,无需专门奖励模型训练。

一段话。
本研究推导出progress advantage,即RL训练策略与参考策略的对数概率比精确恢复最优优势函数,形成无标注、领域无关的评分信号,可直接作为标准RL后训练的副产品使用,显著简化LLM代理评估流程。

核心内容

方法与数据

价值判断

摘要 Process reward models enable fine-grained, step-level evaluation of LLMs, yet building them for agentic settings remains prohibitively difficult: long-horizon interactions, irreversible actions, and stochastic environment feedback make both human annotation and Monte Carlo estimation infeasible at scale. In this work, we show that reinforcement learning (RL) post-training already provides the ingredients for effective step-level scoring, eliminating the need for dedicated reward model training altogether. Concretely, we derive an implicit advantage under a general stochastic Markov decision process, which we term progress advantage -- log-probability ratio between the RL-trained policy and its reference policy exactly recovers the optimal advantage function. This formulation makes the resulting signal annotation-free, domain-agnostic, and available as a byproduct of the standard RL post-training pipeline. We validate the effectiveness of the progress advantage across three different applications: test-time scaling, uncertainty quantification, and failure attribution on five benchmarks and four model families. Across all settings, it consistently outperforms confidence-based baselines and, despite requiring no task-specific training, surpasses dedicated trained reward models. We complement these results with deeper analyses on characteristics of progress advantage, offering practical guidance for adoption in real-world agentic systems.

2. The Unfireable Safety Kernel: Execution-Time AI Alignment for AI Agents and Other Escapable AI Systems

一句话结论

Unfireable Safety Kernel通过执行时AI对齐成功防止了AI系统逃逸。

核心内容

方法与数据

价值判断

摘要 AI agents are granted access to tools, APIs, and other infrastructure, making them active principals in those systems. The dominant approach places controls inside the agent's own runtime: system prompts, output filters, and guardrail libraries. Any control in the agent's address space is reachable by inputs that influence it; this generalizes to any AI system with sufficient reach into its own runtime, a class we term escapable AI systems. We identify four properties that an authorization mechanism must satisfy for architectural control rather than for cooperative requests: process separation, pre-action enforcement on a structurally only path, fail-closed at both the request and system levels, and externalized signed evidence verifiable outside the controlled system's trust boundary. We position this layer as execution-time AI alignment, complementing training-time alignment (RLHF, Constitutional AI) and inference-time alignment. We present the Unfireable Safety Kernel, a Rust reference implementation realizing all four. Its fail-closed invariant is machine-checked at two levels: an SMT theorem (Z3) and an exhaustive bounded-model-checking proof of the production decision function (Kani, 4/4 harnesses). A Python-to-Rust migration was gated on byte-equivalence (1000/1000 fixtures; 17/17 adversarial classes). We evaluate the kernel governing a live, escapable AI system, a deterministic, self-improving world model, against an escape-seeking adversary driving its real self-modification seam: across 1,000 self-modifications, all 704 attempts on the safety-critical core are refused, with no escape; a further 300, under the operator kill switch, are also refused. A separate campaign of 6,240 authorization round-trips had no successful bypass. Against 3 contemporary systems claiming the agent control plane, the agent invokes control; here, it lacks that choice.