跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+0新增论文
+0其中 AI 相关
+0已有论文修订
+91新增 AI 导读

arXiv 最近完成扫描:2026-11-22 16:55 · 全站最近入库:2026-11-21 12:19各信源进度 →

统计口径与数据新鲜度

统计 2026-11-21 19:10 — 2026-11-22 19:10(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-22 16:55最近发现新增版本:2026-11-21 12:19库内论文最新更新时间:2026-11-20 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

29,158 已收录论文24,181 AI 相关8,992 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-22 16:52(北京时间)
版本更新 · v2arXiv:2609.33822

Vestrum: Learning the Verification, Retrieval and Structure of Agent Harnesses from a Few Long Episodes

Jayant Parashar, Eugene F. Douglass, William C. Bastian, Suchendra M. Bhandarkar

原文摘要

Agent harnesses decide what the model retrieves, decomposes, remembers and verifies, and most people use harnesses that are pre-built and fixed, such as Claude Code or a published memory system. Harness optimizers rewrite their own harness code rather than editing pre-built systems, and they learn from tens to hundreds of tasks, while long-horizon work offers a handful of episodes, each hundreds of tool calls long. We present Vestrum, which improves existing harnesses component by component. It reads full raw traces, states each failure as a recognizable class, and changes the one component where the error arose (a self-verification, a retrieval view, a decomposition step or a memory operation). Each change targets a failure that recurs across tasks of the same kind. Before anything runs, a generalization filter refuses changes that copy facts from the development tasks. Vestrum learns from one to ten long development episodes and improves tasks it has never seen in all five settings. On Claude Code, Vestrum raises Terminal-Bench 4 Hard from 63.7% to 70.3% of test checks at 1.03x the test cost. It raises expert cell-type agreement from 67.5% to 77.8% on held-out sections of one slide. On the GAM memory system, it raises UltraHorizon from 47.6 to 59.8, AMA-Bench from 64.2% to 74.2% and LoCoMo from 71.5% to 74.9%. It beats the GEPA prompt search we ran on the same data in every paired evaluation, and these gains hold under a test model different from the one Vestrum's search used. Across the searches, every self-verification the loop kept acts early: it checks an intermediate result against recorded evidence before the result is committed, or, on Terminal-Bench, requires an invariant and a probe before the first edit. In development, auditors that re-examined every finished answer broke more correct answers than they fixed, and the loop did not keep them.

cs.AI