Harness 何时决定成败:Microsoft,可再查 vs 不可再观测惩罚差 92.5 pp
Harness 何时决定成败:Microsoft,可再查 vs 不可再观测惩罚差 92.5 pp
View PDF Abstract: Agent harnesses decide what a language model sees across turns: they drop old turns, summarize them, or replay the model's own earlier reasoning. We ask when these choices change whether an agent succeeds, not only what it costs, and report three findings....
Harness 模型决定成败 (arXiv:2610.26632)
“View PDF Abstract: Agent harnesses decide what a language model sees across turns: they drop old turns, summarize them, or replay the model'”
Abstract:Agent harnesses decide what a language model sees across turns: they drop old turns, summarize them, or replay the model's own earlier reasoning. We ask when these choices change whether an agent succeeds, not only what it costs, and report three findings. First, in a pre-registered synthetic probe, truncating the context window costs a low-cost reasoning model nothing in success when a needed fact can be looked up again (it looks the fact up instead), but drops its success to chance when the fact cannot be re-observed: the two penalties differ by 92.5 percentage points (90% CI [89.5, 95.5]). A pre-registered replication on one model from a second provider showed the same contrast. Once the fact was lost, that model chose no answer rather than guessing. Second, on ARC-AGI-3, where the benchmark's Standard harness trails its Provider Adapter harness by a wide margin, we decompose that gap one component at a time, for one model on four games. Summarizing old turns instead of dropping them, while keeping the Standard harness's invitation to take notes, recovers 86% of a 63-point gap without replaying the model's reasoning. The same harness without the invitation recovers 43%, and adding the provider's native replay of the model's reasoning recovers the remaining 57%. These are point estimates from one counted run per configuration and game, and the replay share depends on a single run. Third, in the benchmark's published runs and in ours, the Adapter's advantage in the probability of clearing a level it has reached is larger at deep levels than at early ones. This largely restates where runs stopped and does not separate a growing advantage from a constant one.
| Comments: | 14 pages, 3 figures, 4 tables. Pre-registered; code, pre-registration and cost ledger at this https URL |
| Subjects: | Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Machine Learning (cs.LG) |
| ACM classes: | I.2.7; I.2.11 |
| Cite as: | arXiv:2610.26632 [cs.AI] |
| (or arXiv:2610.26632v1 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2610.26632 arXiv-issued DOI via DataCite |
Submission history
From: Raimondas Lencevicius [view email]
[v1]
Mon, 19 Oct 2026 15:59:13 UTC (634 KB)
Source: Agent Control Flash News · arxiv.org
Related Products & Analysis
Cursor Agent 架构全景拆解:从影子工作区到多文件推演引擎
全面剖析 Cursor 在 Agent 模式下的底层技术实现,解析影子分支隔离、LSP 上下文剪枝以及预测性补全的核心架构细节与工程实践经验。
Vercel v0 推出全新多 Agent 协作画布与实时全栈部署预览
动态速评:v0 正在从单一组件生成器演进为全栈应用搭建协作台,尤其是与 Neon/Postgres 的直连极大降低了全栈原型验证成本。