Overview
This paper (arXiv: 2509.05823) studies how model post-training and test-time inference design affect natural-language proof generation for hard olympiad mathematics.
Field: Machine Learning Authors: Ivan Moshkov, Stephen Ge, George Armstrong Published: 2026-09-11
Key Points
- Starting from Nemotron 3 Ultra, the authors train two specialist checkpoints using supervised fine-tuning (SFT) and reinforcement learning (RL), and evaluate checkpoint choice, verification, and refinement strategies.
- They present an open-model test-time-compute pipeline that runs entirely in natural language — no formal prover, external tools, or internet access.
- Three Nemotron 3 Ultra checkpoints (the general-availability model plus the two post-trained specialists) drive an iterative search that generates, verifies, and refines candidate proofs.
- A separate high-compute selection stage then chooses each final submission.
- The system scored 30 out of 42 points at IMO 2026, surpassing the gold-medal threshold.
- The two post-trained checkpoints
- Training data, plus training and inference code
- The submitted solutions
- Nemotron-IMO-Bench — a new benchmark of 200 novel olympiad-level problems
Open Releases
The team publishes:
Original Abstract (excerpt)
> We study how model post-training and test-time inference design affect natural-language proof generation for hard olympiad mathematics. Starting from Nemotron 3 Ultra, we train two specialist checkpoints using supervised fine-tuning and reinforcement learning, and evaluate checkpoint choice, verification, and refinement. Based on these findings, we present an open-model test-time-compute pipeline. The system operates entirely in natural language, with no formal prover, external tools, or internet access.
---
*Auto-collected on 2026-09-12.*