arXiv:2605.11905cs.AI2026-05

提出分段监督新策略,提升大模型证明定理的成功率。

Rethinking Supervision Granularity: Segment-Level Learning for LLM-Based Theorem Proving

论文配图:Rethinking Supervision Granularity: Segment-Level Learning for LLM-Based Theorem Proving
图 1 · 摘自论文原文
  • 用局部连贯的证明片段构建训练数据,平衡细节与整体结构。
  • 在三个数据集上证明成功率超60%,优于原有逐步和整证方法。
  • 适合想提升推理模型性能的研究者,尤其关注自动化定理证明。

在 Lean 4 中使用大语言模型进行自动定理证明,通常采用逐步策略预测结合树搜索,或整篇证明生成。这两种范式代表了监督粒度的极端:前者提供密集局部信号但可能割裂连贯证明过程,后者保持全局结构但需复杂端到端生成。本文重新思考监督粒度作为证明轨迹上的训练数据构建问题,提出分段级监督策略,从证明轨迹中提取局部连贯的证明片段用于训练策略模型。该策略还可复用于推理阶段,触发短序列回滚以增强现有逐步模型。在 STP、LeanWorkbook 与 NuminaMath-LEAN 上训练的模型,在 miniF2F 测评集上分别达到 64.84%、60.90% 和 66.31% 的证明成功率,持续优于逐步与整证基线。目标感知回滚进一步提升现有逐步证明器性能,同时降低推理开销:使 BFS-Prover-V2-7B 成功率从 68.77% 提升至 70.74%,InternLM2.5-StepProver 从 59.59% 提升至 60.33%。结果表明,合适的监督粒度更契合证明结构与搜索需求。代码与模型已开源于 https://github.com/NJUDeepEngine/SEG-ATP。

原文摘要 · Abstract (English)

Automated theorem proving with large language models in Lean 4 is commonly approached through either step-level tactic prediction with tree search or whole-proof generation. These two paradigms represent opposite granularities for constructing supervised training data: the former provides dense local signals but may fragment coherent proof processes, while the latter preserves global structure but requires complex end-to-end generation. In this paper, we revisit supervision granularity as a training set construction problem over proof trajectories and propose segment-level supervision, a training data construction strategy that extracts locally coherent proof segments for training policy models. We further reuse the same strategy at inference time to trigger short rollouts for existing step-level models. When trained with segment-level supervision on STP, LeanWorkbook, and NuminaMath-LEAN, the resulting policy models achieve proof success rates of 64.84%, 60.90%, and 66.31% on miniF2F, respectively, consistently outperforming both step-level and whole-proof baselines. Goal-aware rollout further improves existing step-level provers while reducing inference costs. It increases the proof success rate of BFS-Prover-V2-7B from 68.77% to 70.74% and that of InternLM2.5-StepProver from 59.59% to 60.33%, showing that appropriate supervision granularity better aligns model learning with proof structure and search. Code and models are available at https://github.com/NJUDeepEngine/SEG-ATP.

定理证明大模型监督粒度Lean 4

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。