让大模型推理更准更省,避免中途遗忘前期信息。
Stepwise Informativeness Search for Efficient and Effective LLM Reasoning
- 推理时主动回溯前步关键信息,防止遗忘
- 减少冗余内容,提升结论准确率10%以上
- 适合需要可靠逻辑链的复杂任务场景
大语言模型在多步推理中通过生成自由文本推理链取得进展,但研究发现模型在长上下文中间阶段容易丢失前期信息。这导致后续步骤可能忽略早期关键内容,产生不可靠且重复的推理。为此,我们提出分步信息量搜索方法,在推理时引入两种选择策略:基于根基的筛选优先关注被忽视的早期步骤;基于新颖性的筛选鼓励提出新结论。通过自奠基策略,要求模型在每步推理前显式引用相关前期步骤作为前提。在四个推理数据集上的实验表明,该方法显著提升推理准确性,生成更高质量、错误与冗余更少的推理链。
原文摘要 · Abstract (English)
Advances in Large Language Models (LLMs) have significantly improved multi-step reasoning through generating free-text rationales. However, recent studies show that LLMs tend to lose focus over the middle of long contexts. This raises concerns that as reasoning progresses, LLMs may overlook information in earlier steps when decoding subsequent steps, leading to generate unreliable and redundant rationales. To address this, we propose guiding LLMs to generate more accurate and concise step-by-step rationales by (1) proactively referencing information from underutilized prior steps, and (2) minimizing redundant information between new and existing steps. We introduce stepwise informativeness search, an inference-time tree search framework incorporating two selection heuristics: grounding-guided selection which prioritizes steps paying higher attention over underutilized steps; and novelty-guided selection which encourages steps with novel conclusions. During rationale generation, we use a self-grounding strategy that prompts LLMs to explicitly reference relevant prior steps to provide premises before deduction at each step. Experimental results on four reasoning datasets demonstrate that our approach improves reasoning accuracy by generating higher-quality rationales with reduced errors and redundancy.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。