不训练不调优,纯采样就能激发大模型的推理潜力
Reasoning with Sampling: Your Base Model is Smarter Than You Think
- 用自洽采样算法利用基础模型自身概率分布
- 在数学、编程、知识问答任务上接近甚至超越强化学习微调效果
- 无需训练或验证器,适合广泛场景
前沿推理模型在多个领域表现出色,主要依赖强化学习(RL)对大语言模型(LLM)进行后训练。然而,现有研究多关注强化学习中涌现出的新行为是否源于基础模型本身。本文从新角度出发,探讨仅通过推理时的纯采样能否激活基础模型的类似推理能力。受马尔可夫链蒙特卡洛(MCMC)方法启发,我们提出一种基于基础模型自身似然的简单迭代采样算法。在多个基础模型上,该算法在单次任务(single-shot)场景下显著提升推理表现,覆盖MATH500、HumanEval和GPQA等基准,性能几乎媲美甚至超过强化学习微调结果。此外,该采样器避免了强化学习后训练中常见的样本多样性下降问题。关键的是,该方法无需额外训练、精心构建数据集或验证器,具有广泛适用性,尤其适用于难以验证的领域。
原文摘要 · Abstract (English)
Frontier reasoning models have exhibited incredible capabilities across a wide array of disciplines, driven by posttraining large language models (LLMs) with reinforcement learning (RL). However, despite the widespread success of this paradigm, much of the literature has been devoted to disentangling truly novel behaviors that emerge during RL but are not present in the base models. In our work, we approach this question from a different angle, instead asking whether comparable reasoning capabilites can be elicited from base models at inference time by pure sampling, without any additional training. Inspired by Markov chain Monte Carlo (MCMC) techniques for sampling from sharpened distributions, we propose a simple iterative sampling algorithm leveraging the base models' own likelihoods. Over different base models, we show that our algorithm offers substantial boosts in reasoning that nearly match and even outperform those from RL on a wide variety of single-shot tasks, including MATH500, HumanEval, and GPQA. Moreover, our sampler avoids the collapse in diversity over multiple samples that is characteristic of RL-posttraining. Crucially, our method does not require training, curated datasets, or a verifier, suggesting broad applicability beyond easily verifiable domains.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。