智能体
arxiv.org ·
@Valentin Malykh
投机不确定性:一种用于智能体编码的草稿模型门控方法
提出投机不确定性(SU)方法,通过小型开源草稿模型对智能体已生成的轨迹进行评分,无需访问logits或权重,即可预测失败可能性,并可用于路由、人工干预等下游策略。在Qwen3-Coder-480B等智能体上验证了有效性。
AI推荐理由 提出投机不确定性(SU)方法,仅从输出token预测智能体失败,无需内部访问,对提升编码智能体可靠性有直接价值。方法新颖,有实验支撑。
85
正文
计算机科学 > 机器学习
arXiv:2609.05274v1 (cs)
[提交于2026年9月4日]
标题:如何在智能体编码中推测不确定性?一种草稿模型门控方法
作者:康斯坦丁·格罗托夫,瓦伦丁·马利赫
查看论文PDF,标题为“如何在智能体编码中推测不确定性?一种草稿模型门控方法”,作者:康斯坦丁·格罗托夫和瓦伦丁·马利赫
查看PDF
HTML(实验性)
摘要:部署用于软件工程的LLM智能体会代价高昂地失败:它们自信地犯错,而糟糕的行为只有在昂贵的执行和重试之后才被识别。我们提出了推测性不确定性(SU),一种仅从黑盒智能体的输出令牌中恢复预测性失败信号的方法,无需访问logits、权重、激活或重复采样。通过反转推测解码,一个小型开放权重草稿模型在单次前向传播中对智能体已生成的轨迹进行评分。从这些推测性交叉似然中,我们通过分离推理和行动跨度提取阶段感知特征,并针对可验证目标进行校准。SU产生一个失败可能性分数,任何下游策略(如路由、人工干预或额外的测试时计算)都可以直接使用。为了证明该信号是可操作的,我们在软件工程智能体Qwen3-Coder-480B和闭源的Claude 3.5 Sonnet上实例化了一种这样的策略,即执行前否决门,在部署中将执行错误率降低6-8个百分点,令牌成本降低14-19%,无需重新训练即可转移到分布外基准,并跨智能体模型泛化。
评论:
主题:
机器学习 (cs.LG)
引用格式:
arXiv:2609.05274 [cs.LG]
(或
arXiv:2609.05274v1 [cs.LG] 用于此版本)
https://doi.org/10.48550/arXiv.2609.05274
点击了解更多
arXiv颁发的DOI(通过DataCite,待注册)
提交历史
来自:康斯坦丁·格罗托夫 [查看电子邮件]
[v1]
2026年9月4日星期五 15:30:22 UTC (94 KB)
全文链接:
访问论文:
查看论文PDF,标题为“如何在智能体编码中推测不确定性?一种草稿模型门控方法”,作者:康斯坦丁·格罗托夫和瓦伦丁·马利赫
查看PDF
HTML(实验性)
TeX源文件
查看许可证
当前浏览上下文:
cs.LG
新
|
近期
| 2026-09
更改浏览方式:
cs
参考文献与引用
NASA ADS
谷歌学术
语义学者
导出BibTeX引用
加载中...
BibTeX格式引用
×
加载中...
数据提供:
书签
书目工具
书目与引用工具
书目浏览器切换
书目浏览器(什么是浏览器?)
关联论文切换
关联论文(什么是关联论文?)
Litmaps切换
Litmaps(什么是Litmaps?)
scite.ai切换
scite智能引用(什么是智能引用?)
代码、数据、媒体
与本文相关的代码、数据和媒体
alphaXiv切换
alphaXiv(什么是alphaXiv?)
代码链接切换
CatalyzeX代码查找器(什么是CatalyzeX?)
DagsHub切换
DagsHub(什么是DagsHub?)
GotitPub切换
Gotit.pub(什么是Gotit.pub?)
Huggingface切换
Hugging Face(什么是Huggingface?)
ScienceCast切换
ScienceCast(什么是ScienceCast?)
演示
演示
Replicate切换
Replicate(什么是Replicate?)
Spaces切换
Hugging Face Spaces(什么是Spaces?)
Spaces切换
TXYZ.AI(什么是TXYZ.AI?)
相关论文
推荐与搜索工具
Influence Flower链接
Influence Flower(什么是Influence Flowers?)
核心推荐器切换
CORE推荐器(什么是CORE?)
IArxiv推荐器切换
IArxiv推荐器
(什么是IArxiv?)
作者
会议/期刊
机构
主题
关于arXivLabs
arXivLabs:与社区合作者的实验项目
arXivLabs是一个框架,允许合作者直接在我们的网站上开发和分享新的arXiv功能。
与arXivLabs合作的个人和组织都接受并认可我们的价值观:开放、社区、卓越和用户数据隐私。arXiv致力于这些价值观,并且只与遵守这些价值观的合作伙伴合作。
有一个能为arXiv社区增加价值的项目想法吗?了解更多关于arXivLabs的信息。
这篇论文的作者中哪些是背书人?|
禁用MathJax(什么是MathJax?)
查看原文(中文正文为 AI 翻译)
Computer Science > Machine Learning
arXiv:2609.05274v1 (cs)
[Submitted on 4 Sep 2026]
Title:How to Speculate about Uncertainty in Agentic Coding? A Draft-Model Gate Method
Authors:Konstantin Grotov, Valentin Malykh
View a PDF of the paper titled How to Speculate about Uncertainty in Agentic Coding? A Draft-Model Gate Method, by Konstantin Grotov and Valentin Malykh
View PDF
HTML (experimental)
Abstract:LLM agents deployed for software engineering fail expensively: they act confidently wrong, and bad actions are recognized only after costly execution and retry. We present Speculative Uncertainty (SU), a method that recovers a predictive failure signal for a black-box agent from its output tokens alone, with no access to logits, weights, activations, or repeated sampling. Inverting speculative decoding, a small open-weight draft model scores the agent's already-generated trajectory in a single forward pass. From these speculative cross-likelihoods we extract phase-aware features by separating the reasoning and action spans, and calibrate them against a verifiable objective. SU produces a failure-likelihood score that any downstream policy, such as routing, human intervention, or extra test-time compute, can consume directly. To show the signal is actionable, we instantiate one such policy, a pre-execution veto gate, on software engineering agents Qwen3-Coder-480B and closed-source Claude 3.5 Sonnet, cutting execution error rate by 6-8 percentage points and token cost by 14-19% in deployment, transferring to out-of-distribution benchmarks without retraining, and generalizing across agent models.
Comments:
Subjects:
Machine Learning (cs.LG)
Cite as:
arXiv:2609.05274 [cs.LG]
(or
arXiv:2609.05274v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2609.05274
Focus to learn more
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Konstantin Grotov [view email]
[v1]
Fri, 4 Sep 2026 15:30:22 UTC (94 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled How to Speculate about Uncertainty in Agentic Coding? A Draft-Model Gate Method, by Konstantin Grotov and Valentin Malykh
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.LG
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?)
IArxiv recommender toggle
IArxiv Recommender
(What is IArxiv?)
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?)