用批评模型引导推理与检索,提升大模型解难题能力。
Can We Further Elicit Reasoning in LLMs? Critic-Guided Planning with Retrieval-Augmentation for Solving Challenging Tasks
- 引入批评模型指导分步推理与检索,动态选择最优子目标。
- 在编程和数学证明等难题上,性能显著超越现有方法。
- 适合需要强逻辑与精准知识的复杂任务求解者使用。
当前最先进的大语言模型虽具备强大问题求解能力,但在复杂推理和事实正确性方面仍存挑战。现有方法结合思维链与检索增强生成(RAG)来分解问题并提升事实准确性,但在竞赛编程、数学证明等高难度任务上常因推理错误和无关知识检索而失效。为此,本文提出一种新框架CR-Planner,通过微调的批评模型指导推理与检索过程。CR-Planner通过迭代方式选择并执行子目标:首先由子目标批评模型评估候选路径,选出最有望的子目标;随后由执行批评模型对输出进行筛选,确保每一步质量。该过程结合检索信息与批评反馈,有效探索解空间。我们使用蒙特卡洛树搜索生成训练数据,系统化分析动作序列的长期影响。实验验证了其在竞赛编程、定理驱动的数学推理及复杂领域检索任务上的优越性,显著优于基线模型。
原文摘要 · Abstract (English)
State-of-the-art large language models (LLMs) exhibit impressive problem-solving capabilities but may struggle with complex reasoning and factual correctness. Existing methods harness the strengths of chain-of-thought and retrieval-augmented generation (RAG) to decompose a complex problem into simpler steps and apply retrieval to improve factual correctness. These methods work well on straightforward reasoning tasks but often falter on challenging tasks such as competitive programming and mathematics, due to frequent reasoning errors and irrelevant knowledge retrieval. To address this, we introduce Critic-guided planning with Retrieval-augmentation, CR-Planner, a novel framework that leverages fine-tuned critic models to guide both reasoning and retrieval processes through planning. CR-Planner solves a problem by iteratively selecting and executing sub-goals. Initially, it identifies the most promising sub-goal from reasoning, query generation, and retrieval, guided by rewards given by a critic model named sub-goal critic. It then executes this sub-goal through sampling and selecting the optimal output based on evaluations from another critic model named execution critic. This iterative process, informed by retrieved information and critic models, enables CR-Planner to effectively navigate the solution space towards the final answer. We employ Monte Carlo Tree Search to collect the data for training the critic models, allowing for a systematic exploration of action sequences and their long-term impacts. We validate CR-Planner on challenging domain-knowledge-intensive and reasoning-heavy tasks, including competitive programming, theorem-driven math reasoning, and complex domain retrieval problems. Our experiments demonstrate that CR-Planner significantly outperforms baselines, highlighting its effectiveness in addressing challenging problems by improving both reasoning and retrieval.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。