Learning Lean Feedback for Efficient Proof-Candidate Evaluation on GPUs
Training language models for formal theorem proving requires large numbers of verifier calls.
ProofPaper ↗
Key points
- Slow checks and timeouts often leave GPUs waiting and withhold rewards from potentially correct proofs.
- We train neural evaluators to predict Lean 4 verdicts and compiler feedback on GPUs using 4.84M labelled programs.
- We compare two validity classifiers with a feedback model that annotates proof attempts with predicted goal states and error messages.
- After one GRPO epoch with hybrid rewards, the prover achieves nearly the same miniF2F pass@1 as with Lean-only rewards (62.2% versus 62.4%) and a pass@32 of 72.4% versus 71.3%.
Sources (1)
- [1]Learning Lean Feedback for Efficient Proof-Candidate Evaluation on GPUsarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 15, 01:46 PM
Training language models for formal theorem proving requires large numbers of verifier calls.
Slow checks and timeouts often leave GPUs waiting and withhold rewards from potentially correct proofs.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 15, 2026Each Reward to Its Relevant Tokens: Reward-Specific Token-Level Credit Assignment for Multi-Reward RL
- Oct 15, 2026Welcome FLUX.3 Image Klein in Diffusers
- Oct 15, 2026Learning to Think and Explore in 3D World
- Oct 15, 2026SCOPE: Semantic Bounded Credit Optimization for Prompt Engineering in Text-to-image Generation
- Oct 15, 2026EVA-Cap: Optimizing Audiovisual Video Captioning via Event-Centric Alignment
- Oct 14, 2026The Design Space of Tri-Modal Masked Diffusion Models