最新资讯
dev.to 你的 Agent Harness 应具备的 17 项能力 dev.to 离线 AI 记忆中 0.8 余弦阈值为何失效 dev.to Kimi K3.1 Pro 开放权重:自托管 2.8T 模型前的开发者清单 dev.to 如何通过工具调用引导模型以提升 Harness 质量 dev.to AI Agent 审计轨迹不等于对话记录 dev.to 精简 MCP server 工具数量:更少工具、更小影响面,双重收益 dev.to 为什么 git checkout 无法撤销 AI 编码 agent 的改动? wechat AI短剧门槛降降降!实测即梦短剧工作室:剧本分镜预演一条龙,伙伴计划长期护航 dev.to 让模型改写文档前,先量化事实保真度 dev.to 回放 153 个 Claude Code 与 Codex 会话,审计 Agent 的生产影响范围 dev.to 银行 77 意图分类最便宜 LLM:GPT-6.1 Terra 每次成功任务 $0.000727 theinformation.com Chesky的副业:Airbnb向CEO新设AI实验室出售IP
多元动态
登录 注册
智能体 arxiv.org ·

当智能体放慢速度时:通过每词元 Elo 分析理解 LLM 智能体的测试时策略

原文 我的收藏

该论文研究 LLM 智能体在开放式任务中如何自适应分配测试时算力,提出 Elo-per-token 分析:跟踪每个 token 预算下找到的最优解,并用 Bradley-Terry 模型将任务内排序聚合为跨任务的 Elo 评分。在四个通用智能体、四个开放式基准(会话最长 1 亿 token)及三个反馈驱动的 LLM 优化框架上实验发现:智能体初期把 token 转化为 Elo 的速度快于独立采样参考,但边际收益递减并最终低于参考;而 AtCoder Heuristic Contest 上最强人类选手随比赛时间呈超线性提升,说明智能体放慢后仍有较大提升空间。作者定义缩放拐点为边际 Elo 增益等于独立采样参考时的每会话预算,并据此在 FrontierCS Polyomino Packing 上把 1 亿 token 拆分到并行会话,相比单长会话提升 +264 Elo、相比十个短会话提升 +355 Elo。

AI推荐理由 arXiv 新论文(2026-09-14 提交),作者含 Luke Zettlemoyer、Alex Dimakis、Alvin Cheung 等知名研究者,事实明确、信息密度高。提出 Elo-per-token 分析方法,用 Bradley-Terry 模型把不同分数尺度的开放式任务排序聚合为 Elo,在四个通用智能体和四个开放式基准上做最长 1 亿 token 的会话实验,并给出“缩放拐点”定义:边际 Elo 增益等于独立采样参考时的每会话预算。据此在 FrontierCS Polyomino Packing 上把 1 亿 token 拆分为并行会话,比单长会话 +264 Elo、比十个短会话 +355 Elo。局限是结论基于特定基准与智能体配置,摘要未给出全部实验细节,需读全文验证。

82

正文

Computer Science > Computation and Language arXiv:2609.15309 (cs) [Submitted on 14 Sep 2026] Title:When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis Authors:Kaiyuan Liu, Qiuyang Mang, Bo Peng, Wenhao Chai, Hanchen Li, Shreyas Pimpalgaonkar, Luke Zettlemoyer, Alex Dimakis, Alvin Cheung View a PDF of the paper titled When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis, by Kaiyuan Liu and 8 other authors View PDF Abstract:Large language model (LLM) agents allocate test-time compute adaptively as they revise solutions, use tools, explore alternatives, and decide when to stop. This test-time strategy makes it difficult to measure how agent performance scales. We study open-ended tasks that provide continuous scores for intermediate submissions, making progress observable throughout long trajectories. We propose Elo-per-token analysis, which tracks the best solution found at each token budget and uses a Bradley-Terry model to aggregate within-task orderings into Elo ratings across tasks with different score scales. We apply it to four general-purpose agents on four open-ended benchmarks, with sessions of up to 100M tokens, and to three feedback-driven LLM optimization harnesses in controlled single-task interventions. Independent sampling provides a theoretically characterized reference, for which Elo grows linearly with log compute. Against this reference, agents can initially convert tokens into Elo faster than independent sampling, but their marginal gains diminish and eventually fall below the reference. In contrast, the strongest historical human contestants improve superlinearly over contest time on shared AtCoder Heuristic Contest tasks, providing evidence of continual learning and substantial headroom after agents slow down. We define the scaling inflection point as the per-session budget where marginal Elo gains match the independent-sampling reference. Using this point as the per-session budget, we split 100M tokens across parallel sessions on FrontierCS Polyomino Packing, gaining +264 Elo over one long session and +355 over ten short sessions. Subjects: Computation and Language (cs.CL) Cite as: arXiv:2609.15309 [cs.CL] (or arXiv:2609.15309v1 [cs.CL] for this version) https://doi.org/10.48550/arXiv.2609.15309 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Qiuyang Mang [view email] [v1] Mon, 14 Sep 2026 09:57:49 UTC (453 KB) Full-text links: Access Paper: View a PDF of the paper titled When Agents Slow Down: Understanding LLM Agents' Test-Time Strategies via Elo-per-token Analysis, by Kaiyuan Liu and 8 other authors View PDF TeX Source view license Current browse context: cs.CL new | recent | 2026-09 Change to browse by: cs References & Citations NASA ADS Google Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

来源报道 · 1 篇 · 以下链接均前往原始媒体

← 返回精选动态 原文

更多内容