用回溯搜索优化大模型推理路径,让小模型更高效准确。
Retro-Search: Exploring Untaken Paths for Deeper and Efficient Reasoning
- 通过回溯搜索重构推理轨迹,发现更优更短的思考路径。
- 自改进使推理长度减少31.2%,数学基准提升7.7%。
- 小模型可优化大模型的推理数据,适合模型蒸馏与效率提升场景。
大型推理模型通过冗长复杂的推理轨迹展现出强大能力。对这类轨迹进行监督微调(即知识蒸馏)是提升学生模型推理能力的经济方式。然而,实证观察表明这些轨迹常次优,频繁切换思路,导致思考不足、过度思考甚至无效回应。本文提出Retro-Search,一种受MCTS启发的回溯搜索算法,用于从大模型中提炼高质量推理路径。该方法回顾性地修正推理轨迹,发现更好且更短的路径,从而让学生模型在更短、更快的推理中获得更强能力。本方法支持两种应用场景:自改进(模型用自身生成的优化路径微调)和弱到强改进(弱模型用更小模型修正强模型的推理轨迹)。自改进实验中,R1-distill-7B在自身优化后的轨迹上微调,平均推理长度减少31.2%,七项数学基准性能提升7.7%。弱到强改进中,使用比原模型小20倍的R1-distill-32B回溯修正R1-671B在OpenThoughts数据集上的轨迹,再以优化数据微调的Qwen2.5-32B,性能媲美原版R1-distill-32B,推理长度减少11.3%,性能提升2.4%。本工作反驳了近期认为搜索算法在大模型时代已无用的观点,证明即便前沿模型仍存在算法优化空间。
原文摘要 · Abstract (English)
Large reasoning models exhibit remarkable reasoning capabilities via long, elaborate reasoning trajectories. Supervised fine-tuning on such reasoning traces, also known as distillation, can be a cost-effective way to boost reasoning capabilities of student models. However, empirical observations reveal that these reasoning trajectories are often suboptimal, switching excessively between different lines of thought, resulting in under-thinking, over-thinking, and even degenerate responses. We introduce Retro-Search, an MCTS-inspired search algorithm, for distilling higher quality reasoning paths from large reasoning models. Retro-Search retrospectively revises reasoning paths to discover better, yet shorter traces, which can then lead to student models with enhanced reasoning capabilities with shorter, thus faster inference. Our approach can enable two use cases: self-improvement, where models are fine-tuned on their own Retro-Search-ed thought traces, and weak-to-strong improvement, where a weaker model revises stronger model's thought traces via Retro-Search. For self-improving, R1-distill-7B, fine-tuned on its own Retro-Search-ed traces, reduces the average reasoning length by 31.2% while improving performance by 7.7% across seven math benchmarks. For weak-to-strong improvement, we retrospectively revise R1-671B's traces from the OpenThoughts dataset using R1-distill-32B as the Retro-Search-er, a model 20x smaller. Qwen2.5-32B, fine-tuned on this refined data, achieves performance comparable to R1-distill-32B, yielding an 11.3% reduction in reasoning length and a 2.4% performance improvement compared to fine-tuning on the original OpenThoughts data. Our work counters recently emergent viewpoints that question the relevance of search algorithms in the era of large reasoning models, by demonstrating that there are still opportunities for algorithmic advancements, even for frontier models.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。