通过提前检测推理中的不确定性,智能分配计算资源,提升大模型推理效率与准确率。
DeepLook: Deeper Thinking with Lookahead

- 在推理过程中动态监测不确定性,仅在关键节点投入额外计算
- 在4个数学竞赛数据集上平均减少87.3%的生成token数,同时提升准确率
- 无需训练,适用于多种大模型,适合需要高效推理的场景
推理时扩展已成为提升大语言模型推理能力的有效方法,尤其在复杂推理任务中效果优于单纯增加参数量。然而,现有方法在推理轨迹中计算资源分配效率低下。我们观察到,推理失败往往在得出错误答案前就已出现早期不确定性。为此,提出DeepLook——一种无需训练的监控-干预解码框架,将前瞻计算集中在不确定性瓶颈处。DeepLook将词级置信度聚合为段落级信号,当置信度相对于近期历史下降时触发,采用固定前瞻视野探索候选延续路径。各分支按平均前瞻置信度(ALC)排序,再通过投票进行剪枝与融合。在DeepSeek-R1-8B、Qwen3-32B、GPT-OSS-20B和GPT-OSS-120B四个竞赛类数学基准上,DeepLook实现了精度-耗 token 数的帕累托前沿转移:相比DeepConf-low,在16组设置中有11组提升精度,且平均减少87.3%的数据集级生成token数,包括在AIME25上提升+3.1(Qwen3-32B)、BRUMO25上提升+8.8(GPT-OSS-20B)。结果表明,选择性、前瞻性干预比均匀扩展整个推理轨迹带来更优的精度-成本权衡。代码已公开。
原文摘要 · Abstract (English)
Inference-time scaling has emerged as a powerful paradigm for improving large language model reasoning, often delivering larger gains on difficult reasoning tasks than parameter scaling alone. However, existing approaches remain inefficient in how compute is allocated within a reasoning trace. Motivated by the observation that reasoning failures often exhibit an early onset of uncertainty before a wrong answer become explicit, we introduce DeepLook, a training-free monitor-and-intervene decoding framework that concentrates lookahead compute at uncertainty bottlenecks. DeepLook aggregates token-level confidence into segment-level signals, triggers when confidence drops relative to recent history, and explores candidate continuations with fixed-horizon lookahead. Branches are ranked by Average Lookahead Confidence (ALC), the average segment-level confidence over rollout continuations, then pruned and aggregated through voting. On four competition-style mathematics benchmarks across DeepSeek-R1-8B, Qwen3-32B, GPT-OSS-20B, and GPT-OSS-120B, DeepLook shifts the accuracy--token-cost Pareto frontier: it improves accuracy over DeepConf-low in 11 of 16 settings while reducing dataset-level token generation by 87.3% on average, including gains of +3.1 on AIME25 with Qwen3-32B and +8.8 on BRUMO25 with GPT-OSS-20B. These results show that selective, future-aware intervention yields substantially stronger accuracy--cost trade-offs than uniformly scaling complete reasoning trajectories. Code is available here.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。