paper-with-me

홈 › Papers

Leanabell-Prover-V2: Verifier-integrated Reasoning for Formal Theorem Proving via Reinforcement Learning

2025-07-11 · Xingguang Ji, Yahui Liu, Qi Wang, Jingyuan Zhang, Yang Yue, Rui Shi, Chenxi Sun, Fuzheng Zhang, Guorui Zhou, Kun Gai arxiv

We introduce our Leanabell-Prover-V2, a 7B large language models (LLMs) that can produce formal theorem proofs in Lean 4, with verifier-integrated Long Chain-of-Thoughts (CoT). Following our previous work Leanabell-Prover-V1, we continual to choose to posttrain existing strong prover models for further performance improvement. In our V2 version, we mainly upgrade the Reinforcement Learning (RL) with feedback provided by the Lean 4 verifier. Crucially, verifier feedback, such as indicating success or detailing specific errors, allows the LLM to become ``self-aware'' of the correctness of its own reasoning process and learn to reflexively correct errors. Leanabell-Prover-V2 directly optimizes LLM reasoning trajectories with multi-turn verifier interactions, together with feedback token masking for stable RL training and a simple reward strategy. Experiments show that Leanabell-Prover-V2 improves performance by 3.2% (pass@128) with Kimina-Prover-Preview-Distill-7B and 2.0% (pass@128) with DeepSeek-Prover-V2-7B on the MiniF2F test set. The source codes, curated data and models are available at: https://github.com/Leanabell-LM/Leanabell-Prover-V2.

📄 PDF Abstract BibTeX arXiv:2507.08649

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

Leanabell-Prover: Posttraining Scaling in Formal Reasoning

2025-04-08 · Jingyuan Zhang, Qi Wang, Xingguang Ji, Yahui Liu 외

Recent advances in automated theorem proving (ATP) through LLMs have highlighted the potential of formal reasoning with Lean 4 codes. However, ATP has not yet be revolutionized by the recent posttraining scaling as demon…

Automated Theorem Provingreinforcement-learningReinforcement Learning

Hilbert: Recursively Building Formal Proofs with Informal Reasoning

2025-09-26 · Sumanth Varambally, Thomas Voice, Yanchao Sun, Zhifeng Chen 외 arxiv

Large Language Models (LLMs) demonstrate impressive mathematical reasoning abilities, but their solutions frequently contain errors that cannot be automatically checked. Formal theorem proving systems such as Lean 4 offe…

Mathematical Reasoning

OpenProver: Agentic and Interactive Theorem Proving with Lean 4

2026-07-10 · Matěj Kripner, Milan Straka arxiv

In this system paper, we present OpenProver, an open-source system for LLM-driven automated theorem proving (ATP) with integrated Lean 4 formal verification. OpenProver integrates a Planner-Worker-Verifier architecture i…

Automated Theorem ProvingCode Generation

OProver: A Unified Framework for Agentic Formal Theorem Proving

2026-05-17 · David Ma, Kaijing Ma, Shawn Guo, Yunfeng Shi 외 arxiv

Recent progress in formal theorem proving has benefited from large-scale proof generation and verifier-aware training, but agentic proving is rarely integrated into prover training, appearing only at inference time. We p…

Why Agentic Theorem Prover Works: A Statistical Provability Theory of Mathematical Reasoning Models

2026-02-11 · Sho Sonoda, Shunta Akiyama, Yuya Uezato arxiv

Agentic theorem provers combine a reasoning model, retrieval, search, and a proof assistant verifier, yet it remains unclear which components actually improve finite-budget proof success and why they help on real mathema…

Mathematical Reasoning