让大模型学会自我探索,推理能力可随计算时间延长而持续提升
e3: Learning to Explore Enables Extrapolation of Test-Time Compute for LLMs
- 训练模型在推理时动态组合生成、验证等操作,实现自主探索
- 在1.7亿参数模型上达到AIME'25和HMMT'25最高分,支持2倍于训练预算的推理扩展
- 适合需要长时推理与强泛化能力的数学与逻辑任务场景
测试时扩展为提升大模型推理能力提供了新路径,其核心潜力在于外推性——即模型在超出训练最大令牌预算的情况下,仍能通过更长时间的“思考”提升对难题的表现。然而我们发现,现有大多数推理模型外推能力较差。本文提出e3方法,通过训练大模型在上下文内进行探索:即合理分配推理时间,串联生成、验证、修正等操作,或在确认答案前测试多个假设。e3的关键三要素为:(1)利用模型在不同能力上的不对称性,如将易完成的验证与难完成的生成结合,实现上下文搜索;(2)通过错误轨迹的“负梯度”信号增强强化学习中的探索,生成更长的搜索链;(3)设计课程学习策略,将任务难度与训练令牌预算耦合,引导探索结构。e3-1.7B模型在AIME'25与HMMT'25竞赛中取得最佳表现,并实现2倍于训练预算的外推。该模型不仅具备高pass@1得分,且在pass@k指标上优于基础模型。
原文摘要 · Abstract (English)
Test-time scaling offers a promising path to improve LLM reasoning by utilizing more compute at inference time; however, the true promise of this paradigm lies in extrapolation (i.e., improvement in performance on hard problems as LLMs keep "thinking" for longer, beyond the maximum token budget they were trained on). Surprisingly, we find that most existing reasoning models do not extrapolate well. We show that one way to enable extrapolation is by training the LLM to perform in-context exploration: training the LLM to effectively spend its test time budget by chaining operations (such as generation, verification, refinement, etc.), or testing multiple hypotheses before it commits to an answer. To enable in-context exploration, we identify three key ingredients as part of our recipe e3: (1) chaining skills that the base LLM has asymmetric competence in, e.g., chaining verification (easy) with generation (hard), as a way to implement in-context search; (2) leveraging "negative" gradients from incorrect traces to amplify exploration during RL, resulting in longer search traces that chains additional asymmetries; and (3) coupling task difficulty with training token budget during training via a specifically-designed curriculum to structure in-context exploration. Our recipe e3 produces the best known 1.7B model according to AIME'25 and HMMT'25 scores, and extrapolates to 2x the training token budget. Our e3-1.7B model not only attains high pass@1 scores, but also improves pass@k over the base model.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。