Paper Overview
Field: Machine Learning Authors: Yuhang Lai, Jiazhan Feng, Yee Whye Teh, Ning Miao Published: 2026-05-07 arXiv: 2605.06660Abstract
Large language models (LLMs) have shown strong capabilities in solving science and mathematics problems, but they struggle to generate valid, challenging, and novel questions—a key element for advancing LLM training and enabling autonomous scientific research. Existing problem generation methods either rely on costly human expert involvement or adopt naive self-play paradigms, which frequently produce invalid problems due to reward hacking.This work proposes VHG, a verifier-backed hard problem generation framework based on three-player self-play. By integrating an independent verifier into the traditional proposer-solver dual structure, the design constrains the proposer's reward to be determined jointly by problem validity (assessed by the verifier) and difficulty (assessed by the solver).
The authors instantiate two verifier variants:
- Hard symbolic verifier
- Soft LLM verifier
- Three-player self-play: proposer, solver, and independent verifier
- Reward design couples validity (verifier) with difficulty (solver) to mitigate reward hacking
- Two verifier instantiations: hard symbolic and soft LLM-based
- Significant improvements over baselines on indefinite integration and general math reasoning
and evaluate the framework on indefinite integration and general mathematical reasoning tasks. Experimental results show that VHG significantly outperforms all baseline methods by a clear margin.