Infinite Problem Generator: Verifiably Scaling Physics Reasoning Data with Agentic Workflows
Aditya Sharan, Sriram Hebbale, Dhruv Kumar

TL;DR
This paper introduces the Infinite Problem Generator, an agentic framework that creates verifiable physics problems with guaranteed solutions, facilitating scalable and high-quality data for training reasoning models.
Contribution
The paper presents the IPG framework that synthesizes physics problems as executable code, ensuring mathematical consistency and enabling controllable curriculum generation.
Findings
Created ClassicalMechanicsV1 dataset with 1,335 problems
Established a strong correlation (R^2 ≈ 0.95) between formula count and code length
Demonstrated high structural diversity in generated problems
Abstract
Training large language models for complex reasoning is bottlenecked by the scarcity of verifiable, high-quality data. In domains like physics, standard text augmentation often introduces hallucinations, while static benchmarks lack the reasoning traces required for fine-tuning. We introduce the Infinite Problem Generator (IPG), an agentic framework that synthesizes physics problems with guaranteed solvability through a Formula-as-Code paradigm. Unlike probabilistic text generation, IPG constructs solutions as executable Python programs, enforcing strict mathematical consistency. As a proof-of-concept, we release ClassicalMechanicsV1, a high-fidelity corpus of 1,335 classical mechanics problems expanded from 165 expert seeds. The corpus demonstrates high structural diversity, spanning 102 unique physical formulas with an average complexity of 3.05 formulas per problem. Furthermore, we…
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.
Taxonomy
TopicsMachine Learning in Materials Science · Topic Modeling · Text Readability and Simplification
