通过动态调整计算资源,提升大模型长流程任务的可靠性与效率
DenoiseFlow: Uncertainty-Aware Denoising for Reliable LLM Agentic Workflows
- 将推理过程建模为带噪声的马尔可夫决策过程,实时评估每步语义不确定性
- 在6个基准上平均准确率83.3%,比最强基线高1.3%,成本降低40%-56%
- 适合需要高可靠性的复杂任务,如数学推理、代码生成和多跳问答
自主代理正被用于处理从数学推理到软件生成等复杂长程任务。尽管智能体工作流通过分解为多步推理链来支持这些任务,但随着序列变长,可靠性显著下降。微小的自然语言指令理解误差会在步骤间悄然累积,形成‘累积语义模糊’。现有方法常缺乏运行时自适应能力,依赖静态探索预算、反应式错误恢复或忽略不确定性的单路径执行。本文将多步推理建模为带噪声的马尔可夫决策过程(Noisy MDP),提出DenoiseFlow——一个闭环框架,包含三个协同阶段:(1) 感知每步的语义不确定性;(2) 根据风险估计自适应分配计算,动态选择快速单路径或并行探索;(3) 基于影响分析定位根因并实施精准修复。在线自校准持续对齐决策边界与验证器反馈,无需真实标签。在涵盖数学推理、代码生成和多跳问答的六个基准上,DenoiseFlow实现全基准最高准确率(平均83.3%,较最强基线+1.3%),同时通过自适应分支降低40%-56%成本。详细消融实验验证了框架的鲁棒性与通用性。代码已公开于https://anonymous.4open.science/r/DenoiseFlow-21D3/。
原文摘要 · Abstract (English)
Autonomous agents are increasingly entrusted with complex, long-horizon tasks, ranging from mathematical reasoning to software generation. While agentic workflows facilitate these tasks by decomposing them into multi-step reasoning chains, reliability degrades significantly as the sequence lengthens. Specifically, minor interpretation errors in natural-language instructions tend to compound silently across steps. We term this failure mode accumulated semantic ambiguity. Existing approaches to mitigate this often lack runtime adaptivity, relying instead on static exploration budgets, reactive error recovery, or single-path execution that ignores uncertainty entirely. We formalize the multi-step reasoning process as a Noisy MDP and propose DenoiseFlow, a closed-loop framework that performs progressive denoising through three coordinated stages: (1)Sensing estimates per-step semantic uncertainty; (2)Regulating adaptively allocates computation by routing between fast single-path execution and parallel exploration based on estimated risk; and (3)Correcting performs targeted recovery via influence-based root-cause localization. Online self-calibration continuously aligns decision boundaries with verifier feedback, requiring no ground-truth labels. Experiments on six benchmarks spanning mathematical reasoning, code generation, and multi-hop QA show that DenoiseFlow achieves the highest accuracy on every benchmark (83.3% average, +1.3% over the strongest baseline) while reducing cost by 40--56% through adaptive branching. Detailed ablation studies further confirm framework-level's robustness and generality. Code is available at https://anonymous.4open.science/r/DenoiseFlow-21D3/.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。