OptProver: Bridging Olympiad and Optimization through Continual Training in Formal Theorem Proving
Chenyi Li, Yanchen Nie, Zhenyu Ming, Gong Zhang, Kun Yuan, Zaiwen Wen

TL;DR
OptProver is a new model that effectively transfers Olympiad-level theorem proving skills to undergraduate optimization problems by addressing distribution shifts with specialized training and evaluation benchmarks.
Contribution
The paper introduces OptProver, a model that bridges Olympiad and optimization theorem proving through novel training techniques and a new Lean 4 benchmark.
Findings
OptProver achieves state-of-the-art Pass@1 and Pass@32 on the optimization benchmark.
The model maintains competitive performance on general theorem-proving tasks.
Specialized preference learning improves domain transfer effectiveness.
Abstract
Recent advances in formal theorem proving have focused on Olympiad-level mathematics, leaving undergraduate domains largely unexplored. Optimization, fundamental to machine learning, operations research, and scientific computing, remains underserved by existing provers. Its reliance on domain-specific formalisms (convexity, optimality conditions, and algorithmic analysis) creates significant distribution shift, making naive domain transfer ineffective. We present OptProver, a trained model that achieves robust transfer from Olympiad to undergraduate optimization. Starting from a strong Olympiad-level prover, our pipeline mitigates distribution shift through two key innovations. First, we employ large-scale optimization-focused data curation via expert iteration. Second, we introduce a specialized preference learning objective that integrates perplexity-weighted optimization with a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
