arXiv:2606.19559cs.AIcs.CL2026-06被引 1

让大模型主动识别任务模糊并请求澄清,提升交互智能。

Uncertainty Decomposition for Clarification Seeking in LLM Agents

论文配图:Uncertainty Decomposition for Clarification Seeking in LLM Agents
图 1 · 摘自论文原文
  • 用提示词分解不确定性,区分行动信心与请求模糊度。
  • 在两个新评测集上,澄清准确率比现有方法最高提升73%。
  • 适用于各类大模型,适合开发能主动沟通的智能代理。

近期研究指出,传统随机性/认知不确定性框架不足以支持交互式大语言模型(LLM)智能体,亟需具备可解释性、可分解性与可传达性的不确定性表示,以实现主动澄清请求与共享心智建模等新能力。实际部署限制——黑盒API、交互延迟预算及缺乏标注轨迹——排除了基于对数概率、多采样和训练的方法,使提示词估计成为部署时生成此类信号的唯一可行路径。本文提出一种简单提示词分解方法,将动作置信度与请求不确定性(u)分离,使智能体在任务定义模糊时主动请求澄清。为评估该方法,我们引入两个新增强澄清的基准测试集(WebShop-Clarification 和 ALFWorld-Clarification),其中50%的任务被故意设计为不完整。在五个主流LLM(GPT-5.1, DeepSeek-v3.2-exp, GLM-4.7, Qwen3.5-35B, GPT-OSS-120B)上系统对比本方法与ReAct+UE、UAM,覆盖标准WebShop、ALFWorld和REAL基准用于故障检测。平均来看,本方法在ALFWorld-Clarification上相比ReAct+UE提升澄清F1 73%,相比UAM提升36%;在WebShop-Clarification上对所有模型均更优,在ALFWorld-Clarification上四款模型优于基线,表明性能提升具有跨模型泛化性。

原文摘要 · Abstract (English)

Recent position papers argue that the classical aleatoric/epistemic uncertainty framework is insufficient for interactive large language model (LLM) agents and call for underspecification-aware, decomposed, and communicable uncertainty representations that can unlock new agent capabilities such as proactive clarification seeking and shared mental-model building. Practical deployment constraints -- black-box APIs, interactive latency budgets, and the absence of labeled trajectories -- rule out logprob-based, multi-sampling, and training-based methods, leaving prompt-based estimation as the most viable family for surfacing such signals at deployment time. We answer this call with a simple prompt-based decomposition that separates action confidence from request uncertainty (u), enabling the agent to ask for clarification when the task specification is ambiguous. To evaluate it, we introduce two clarification-augmented benchmarks (WebShop-Clarification and ALFWorld-Clarification) in which 50% of tasks are deliberately underspecified, and systematically compare the proposed decomposition against ReAct+UE and Uncertainty-Aware Memory (UAM) across five LLM backbones (GPT-5.1, DeepSeek-v3.2-exp, GLM-4.7, Qwen3.5-35B, GPT-OSS-120B) on these variants together with the standard WebShop, ALFWorld, and REAL benchmarks for fault detection. Averaged across the five backbones, the proposed decomposition improves clarification F1 on ALFWorld-Clarification by 73% over ReAct+UE and by 36% over UAM, and leads clarification F1 on every backbone on WebShop-Clarification and on four of five backbones on ALFWorld-Clarification, indicating that the gains generalize beyond a single LLM.

大模型不确定性主动澄清智能体

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。