Lean-STaR: Learning to Interleave Thinking and Proving
Haohan Lin, Zhiqing Sun, Sean Welleck, Yiming Yang
摘要
Traditional language model-based theorem proving assumes that by training on a sufficient amount of formal proof data, a model will learn to prove theorems. Our key observation is that a wealth of informal information that is not present in formal proofs can be useful for learning to prove theorems. For instance, humans think through steps of a proof, but this thought process is not visible in the resulting code. We present Lean-STaR, a framework for training language models to produce informal thoughts prior to each step of a proof, thereby boosting the model's theorem-proving capabilities. Lean-STaR uses retrospective ground-truth tactics to generate synthetic thoughts for training the language model. At inference time, the trained model directly generates the thoughts prior to the prediction of the tactics in each proof step. Building on the self-taught reasoner framework, we then apply expert iteration to further fine-tune the model on the correct proofs it samples and verifies using the Lean solver. Lean-STaR achieves better results on the miniF2F-test benchmark within the Lean theorem proving environment, significantly outperforming base models (43.4% → 46.3%, Pass@64). We also analyze the impact of the augmented thoughts on various aspects of the theorem proving process, providing insights into their effectiveness.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper23
- BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem ProvingRan Xin, Chenguang Xi, Jie Yang, Feng Chen 等ACL 2025 · 被引用 66 次
- AgentSynth: Scalable Task Generation for Generalist Computer-Use AgentsJingxu Xie, Dylan Xu, Xuandong Zhao, Dawn SongICLR 2026 · 被引用 36 次
- FATE: A Formal Benchmark Series for Frontier Algebra of Multiple Difficulty LevelsJiedong Jiang, Wanyi He, Yuefeng Wang, Guoxiong Gao 等ICLR 2026 · 被引用 26 次
- Learning to Reason via Mixture-of-Thought for Logical ReasoningTong Zheng, Lichang Chen, Simeng Han, R. Thomas McCoy 等ICLR 2026 · 被引用 23 次
- Process-Verified Reinforcement Learning for Theorem Proving via LeanMinsu Kim, Se-Young YunICLR 2026 · 被引用 16 次
它引用的顶会 Paper7
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah 等NeurIPS 2020 · 被引用 64,255 次
- Chain-of-Thought Prompting Elicits Reasoning in Large Language ModelsJason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma 等NeurIPS 2022 · 被引用 22,562 次
- STaR: Bootstrapping Reasoning With ReasoningEric Zelikman, Yuhuai Wu, Jesse Mu, Noah D. GoodmanNeurIPS 2022 · 被引用 1,126 次
- Llemma: An Open Language Model for MathematicsZhangir Azerbayev, Hailey Schoelkopf, Keiran Paster, Marco Dos Santos 等ICLR 2024 · 被引用 433 次
- miniF2F: a cross-system benchmark for formal Olympiad-level mathematicsKunhao Zheng, Jesse Michael Han, Stanislas PoluICLR 2022 · 被引用 342 次
相关 Paper
- STP: Self-play LLM Theorem Provers with Iterative Conjecturing and ProvingKefan Dong, Tengyu MaICML 2025
- ProofOptimizer: Training Language Models to Simplify Proofs without Human DemonstrationsAlex Gu, Bartosz Piotrowski, Fabian Gloeckle, Kaiyu Yang 等ICLR 2026 · 被引用 11 次
- Learn from Failure: Fine-tuning LLMs with Trial-and-Error Data for Intuitionistic Propositional Logic ProvingChenyang An, Zhibo Chen, Qihao Ye, Emily First 等ACL 2024 · 被引用 1 次
- DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree SearchHuajian Xin, Z. Z. Ren, Junxiao Song, Zhihong Shao 等ICLR 2025
- QDTSynth: Quality-Driven Formal Theorem Synthesis for Enhancing Proving Performance of LLMsLei Wang, Ruobing Zuo, Gaolei He, Jianlin Wang 等ACL 2025 · 被引用 1 次
