Saved in:
| Main Authors: | , , , , , , , , , , , , , , , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.19341 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910153431842816 |
|---|---|
| author | Ye, Haotian Lin, Haowei Tang, Jingyi Luo, Yizhen Yang, Caiyin Su, Chang Thapa, Rahul Yang, Rui Liu, Ruihua Li, Zeyu Gao, Chong Ding, Dachao He, Guangrong Zhang, Miaolei Sun, Lina Wang, Wenyang Zhong, Yuchen Shen, Zhuohao He, Di Ma, Jianzhu Ermon, Stefano Li, Tongyang Chu, Xiaowen Zou, James Xu, Yuzhi |
| author_facet | Ye, Haotian Lin, Haowei Tang, Jingyi Luo, Yizhen Yang, Caiyin Su, Chang Thapa, Rahul Yang, Rui Liu, Ruihua Li, Zeyu Gao, Chong Ding, Dachao He, Guangrong Zhang, Miaolei Sun, Lina Wang, Wenyang Zhong, Yuchen Shen, Zhuohao He, Di Ma, Jianzhu Ermon, Stefano Li, Tongyang Chu, Xiaowen Zou, James Xu, Yuzhi |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_19341 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Evaluation-driven Scaling for Scientific Discovery Ye, Haotian Lin, Haowei Tang, Jingyi Luo, Yizhen Yang, Caiyin Su, Chang Thapa, Rahul Yang, Rui Liu, Ruihua Li, Zeyu Gao, Chong Ding, Dachao He, Guangrong Zhang, Miaolei Sun, Lina Wang, Wenyang Zhong, Yuchen Shen, Zhuohao He, Di Ma, Jianzhu Ermon, Stefano Li, Tongyang Chu, Xiaowen Zou, James Xu, Yuzhi Machine Learning Artificial Intelligence 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. |
| title | Evaluation-driven Scaling for Scientific Discovery |
| topic | Machine Learning Artificial Intelligence |
| url | https://arxiv.org/abs/2604.19341 |