Evaluation-driven Scaling for Scientific Discovery
About
Language models are increasingly used in scientific discovery to generate hypotheses, propose candidate solutions, implement systems, and iteratively refine them. At the core of these trial-and-error loops lies evaluation: the process of obtaining feedback on candidate solutions via verifiers, simulators, or task-specific scoring functions. While prior work has highlighted the importance of evaluation, it has not explicitly formulated the problem of how evaluation-driven discovery loops can be scaled up in a principled and effective manner to push the boundaries of scientific discovery, a problem this paper seeks to address. We introduce Simple Test-time Evaluation-driven Scaling (SimpleTES), a general framework that strategically combines parallel exploration, feedback-driven refinement, and local selection, revealing substantial gains unlocked by scaling evaluation-driven discovery loops along the right dimensions. Across 21 scientific problems spanning six domains, SimpleTES discovers state-of-the-art solutions using gpt-oss models, consistently outperforming both frontier-model baselines and sophisticated optimization pipelines. Particularly, we sped up the widely used LASSO algorithm by over 2x, designed quantum circuit routing policies that reduce gate overhead by 24.5%, and discovered new Erdos minimum overlap constructions that surpass the best-known results. Beyond novel discoveries, SimpleTES produces trajectory-level histories that naturally supervise feedback-driven learning. When post-trained on successful trajectories, models not only improve efficiency on seen problems but also generalize to unseen problems, discovering solutions that base models fail to uncover. Together, our results establish effective evaluation-driven loop scaling as a central axis for advancing LLM-driven scientific discovery, and provide a simple yet practical framework for realizing these gains.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Scaling Law Discovery | SLDBench extrapolation (test) | Parallel Scaling Fit1 | 20 | |
| Circle packing | Circle Packing (n=26) | Sum of Radii2.636 | 19 | |
| Data Science | Scaling Law Discovery lr&bsz | -- | 19 | |
| Mathematics | Erdős’ minimum overlap problem | Overlap Score38.0869 | 18 | |
| Mathematical Optimization | Autocorrelation Inequalities | AC20.9627 | 17 | |
| Scheduling | AtCoder Heuristic Contest ahc058 (official leaderboard) | Score8.49e+8 | 16 | |
| Circle packing | Circle Packing (n=32) | Sum of Radii2.9396 | 12 | |
| Autocorrelation Inequality Optimization | AC3 Inequality | AC3 Score1.4553 | 10 | |
| Denoising | Tabula Muris Senis Lung (held-out) | Score0.74 | 9 | |
| GPU Kernel Optimization | TriMul Local Triton 3.4.0 | Runtime (ms)1.137 | 9 |