跳到正文
Jones Ray

ScholarPulse 日报 2026-07-24

2026-07-24 学术简报:2 篇。OpenForgeRL提供了一个开源框架,使AI代理能在任意环境中端到端训练,无需框架原生支持。

今日速览

序号标题来源日期主题推荐等级
1OpenForgeRL: Train Harness-native Agents in Any EnvironmentarXiv2026-07-23RAG高
2Benchmarking Agents for Proving Theorems in Quantum Algorithms and Quantum InformationarXiv2026-07-23AI-Agent高

重点论文与技术动态

1. OpenForgeRL: Train Harness-native Agents in Any Environment

一句话结论

OpenForgeRL提供了一个开源框架,使AI代理能在任意环境中端到端训练,无需框架原生支持。

核心内容

方法与数据

价值判断

摘要 Modern AI agents rely on elaborate inference harnesses such as Claude Code, Codex, and OpenClaw to drive multi-turn reasoning, tool use, and access to external systems. While powerful, these complex harnesses also make agents hard to train end-to-end with open infrastructure, whose SFT/RL stacks cannot natively express stateful, multi-process harness inference. To address this, we present OpenForgeRL, an open-source framework for training harness-based agents end-to-end in diverse environments. OpenForgeRL achieves this with a lightweight proxy that serves the harness's model calls while recording them as training data for a standard RL codebase (e.g., veRL), and a Kubernetes orchestrator that runs each rollout in its own remote container, together enabling training on any harness in any environment at scale. By decoupling training and inference, OpenForgeRL allows researchers to easily train, study, and improve agents directly in the real harnesses and environments they are deployed with. We validate our framework across diverse, complex harnesses and environments, spanning tool/claw-based agents and multimodal GUI browser- and computer-use agents. Using only hundreds to a few thousand tasks, OpenForgeClaw reaches 31.7 pass^3 and 55.9 pass@3 on ClawEval and 33.7 on QwenClawBench. OpenForgeGUI reaches 37.7 on OSWorld-Verified, 63.0 on Online-Mind2Web, and 72.3 on WebVoyager. Both outperform open baselines of similar size on nearly all benchmarks, and in the GUI setting match or surpass models several times larger. Beyond benchmarks, we analyze how harness choice (e.g., ZeroClaw, OpenClaw, Codex) and RL shape agent behavior. We find that some harnesses are substantially harder to learn than others, and that RL improves agentic reliability, such as self-verification, tool coverage, and completing multi-step plans, though critical abilities such as error recovery remain weak.

2. Benchmarking Agents for Proving Theorems in Quantum Algorithms and Quantum Information

一句话结论

AI代理在量子算法和信息理论定理证明中表现有限,但验证库增强可显著提升性能。

一段话。
论文构建了Lean-QuantumAlg-Bench(36任务)和Lean-QIT-Bench(40任务)两个Lean 4基准,评估了GPT-5.5等四个模型在任务基线和库增强(LAD)设置下的表现,最高难度加权分数达60.4/100和59.6/100,LAD提升性能并揭示了量子模拟等领域的系统性弱点。

核心内容

方法与数据

价值判断

摘要 Formal verification is becoming increasingly practical for quantum computing, yet the ability of AI agents to construct machine-checkable proofs in this domain remains unmeasured. We introduce Lean-QuantumAlg-Bench and Lean-QIT-Bench, two Lean 4 benchmarks containing 36 and 40 theorem-completion tasks for quantum algorithms and quantum information theory, respectively. Every task compiles in a fixed environment and is evaluated by deterministic proof checking and targeted semantic review, with difficulty weights assigned before model execution. We evaluate four models-GPT-5.5, Kimi K3, DeepSeek V4-Pro, and MiniMax M3-within a common theorem-proving framework under two settings: a task-only baseline and library-augmented deduction (LAD), which additionally provides access to a verified domain library. The highest difficulty-weighted scores are 60.4 out of 100 on the quantum-algorithm benchmark and 59.6 out of 100 on the quantum-information benchmark. LAD improves both score and completion rate in all eight model-benchmark comparisons, with gains of up to 15.9 points, providing evidence that verified libraries can strengthen domain-specific proof agents. The results reveal recurring weaknesses of agentic proving in areas such as quantum simulation, quantum learning, quantum information measures, and entanglement theory. Monetary and wall-clock costs per score point also vary substantially across models, highlighting important capability-efficiency trade-offs. We expect these benchmarks to establish a reproducible baseline for developing more capable and reliable proof agents, and to pave the way toward self-evolving AI scientists for advancing quantum information science.