用自然语言和强化学习提升大模型定理证明能力
DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learning
- 构建12.1万条高质非形式化数学定理数据集,支持复杂推理
- 提出新强化学习策略,使模型在变体题中推理更稳健
- 适合研究大模型数学推理与自动证明的学者参考
定理证明是评估大语言模型复杂推理能力的重要基准。然而,传统自动化定理证明方法依赖形式化系统,与大模型通过预训练获得的非形式化自然语言知识不匹配。本文提出DeepTheorem,一个基于自然语言的综合性非形式化定理证明框架。该框架包含12.1万条高质量、覆盖多数学领域的国际数学奥林匹克(IMO)级非形式化定理及其证明,经严格标注正确性、难度与主题类别,并构建系统化的可验证定理变体。我们设计了一种新型强化学习策略(RL-Zero),利用这些变体激励模型进行鲁棒数学推理。同时提出综合结果与过程评估指标,评估证明正确性及推理步骤质量。大量实验表明,相比现有数据集与监督微调方案,DeepTheorem显著提升大模型定理证明性能,达到当前最优准确率与推理质量。研究结果表明,DeepTheorem有望从根本上推动自动化非形式化定理证明与数学探索的发展。
原文摘要 · Abstract (English)
Theorem proving serves as a major testbed for evaluating complex reasoning abilities in large language models (LLMs). However, traditional automated theorem proving (ATP) approaches rely heavily on formal proof systems that poorly align with LLMs' strength derived from informal, natural language knowledge acquired during pre-training. In this work, we propose DeepTheorem, a comprehensive informal theorem-proving framework exploiting natural language to enhance LLM mathematical reasoning. DeepTheorem includes a large-scale benchmark dataset consisting of 121K high-quality IMO-level informal theorems and proofs spanning diverse mathematical domains, rigorously annotated for correctness, difficulty, and topic categories, accompanied by systematically constructed verifiable theorem variants. We devise a novel reinforcement learning strategy (RL-Zero) explicitly tailored to informal theorem proving, leveraging the verified theorem variants to incentivize robust mathematical inference. Additionally, we propose comprehensive outcome and process evaluation metrics examining proof correctness and the quality of reasoning steps. Extensive experimental analyses demonstrate DeepTheorem significantly improves LLM theorem-proving performance compared to existing datasets and supervised fine-tuning protocols, achieving state-of-the-art accuracy and reasoning quality. Our findings highlight DeepTheorem's potential to fundamentally advance automated informal theorem proving and mathematical exploration.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。