让隐式推理模型通过并行采样与评分实现高效推理扩展
Parallel Test-Time Scaling for Latent Reasoning Models
- 引入蒙特卡洛丢弃与高斯噪声实现连续空间采样
- 用分步对比学习训练的潜空间奖励模型提升轨迹选择效果
- 首次实现隐式推理模型的并行测试时扩展,适合追求高效推理的研究者
并行测试时扩展(Parallel TTS)是提升大语言模型性能的关键方法,通常通过并行采样多个基于词元的思维链并以投票或搜索聚合结果。近年来,隐式推理在连续向量空间中进行中间推理,比显式思维链更高效,但其能否同样受益于并行TTS仍未知,主要受限于连续空间缺乏采样机制及高级轨迹聚合所需的概率信号。本文通过引入两种受不确定性启发的随机策略(蒙特卡洛丢弃与加性高斯噪声)解决采样问题,并设计一个分步对比目标训练的潜空间奖励模型(LatentRM),用于对潜空间推理路径打分与引导。大量实验与可视化分析表明,两种采样策略均能随计算资源有效扩展,展现出不同探索动态;而LatentRM可实现有效轨迹选择。本工作为连续空间中的可扩展推理开辟了新方向。代码与检查点已发布于 https://github.com/ModalityDance/LatentTTS。
原文摘要 · Abstract (English)
Parallel test-time scaling (TTS) is a pivotal approach for enhancing large language models (LLMs), typically by sampling multiple token-based chains-of-thought in parallel and aggregating outcomes through voting or search. Recent advances in latent reasoning, where intermediate reasoning unfolds in continuous vector spaces, offer a more efficient alternative to explicit Chain-of-Thought, yet whether such latent models can similarly benefit from parallel TTS remains open, mainly due to the absence of sampling mechanisms in continuous space, and the lack of probabilistic signals for advanced trajectory aggregation. This work enables parallel TTS for latent reasoning models by addressing the above issues. For sampling, we introduce two uncertainty-inspired stochastic strategies: Monte Carlo Dropout and Additive Gaussian Noise. For aggregation, we design a Latent Reward Model (LatentRM) trained with step-wise contrastive objective to score and guide latent reasoning. Extensive experiments and visualization analyses show that both sampling strategies scale effectively with compute and exhibit distinct exploration dynamics, while LatentRM enables effective trajectory selection. Together, our explorations open a new direction for scalable inference in continuous spaces. Code and checkpoints released at https://github.com/ModalityDance/LatentTTS
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。