arXiv:2603.07416cs.LG2026-03被引 3

通过分治策略提升研究型AI的推理速度,兼顾效率与准确

DualSpec: Accelerating Deep Research Agents via Dual-Process Action Speculation

  • 针对不同操作类型设计差异化推测机制
  • 实测最高提速3.28倍,精度接近完整推理
  • 适合追求高效智能搜索的科研与开发场景

基于大语言模型的深度研究代理在处理长周期信息查询任务中日益流行,但因大量推理和频繁调用工具,常导致端到端延迟过高。推测框架通过重叠动作执行与推理来降低延迟,但现有方法通常采用统一推测策略且依赖严格动作匹配,限制了加速效果和鲁棒性。本文从动作异质性的角度重新审视推测-验证范式,发现搜索(Search)与访问(Visit)动作在推理需求和模型能力要求上存在根本差异:熵分析表明,搜索决策不确定性更高,显著受益于显式推理;而访问决策熵值较低,主要依赖模型容量。基于此双过程特性,我们提出DualSpec,一种配备轻量级置信度语义验证器的异构推测框架。跨多个模型和基准的实验表明,DualSpec在保持与完全推理代理相当精度的前提下,实现最高达3.28×的端到端加速。

原文摘要 · Abstract (English)

Large language model-based deep research agents have been increasingly popular for addressing long-horizon information-seeking tasks, but they often incur high end-to-end latency due to extensive reasoning and frequent tool use. Speculation frameworks aim to reduce latency by overlapping action execution with reasoning; however, existing approaches typically rely on uniform speculation strategies and strict action matching, which limits inference speedups and robustness. In this work, we revisit the speculate-verify paradigm for deep research agents through the lens of action heterogeneity. We show that \textit{Search} and \textit{Visit} actions exhibit fundamentally different reasoning and model capacity requirements: entropy-based analysis reveals that Search decisions have higher uncertainty and benefit significantly from explicit reasoning, whereas Visit decisions have lower entropy and depend primarily on model capacity. Motivated by this dual-process characteristic, we propose DualSpec, a heterogeneous speculation framework equipped with a lightweight, confidence-based semantic verifier. Experiments across multiple models and benchmarks demonstrate that DualSpec achieves up to 3.28$\times$ end-to-end speedup while maintaining accuracy comparable to fully reasoning agents.

推理加速大模型应用智能搜索

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