arXiv AI

LLM-Guided Program Evolution for Circle Packing: Breaking 10 Packomania Records for $28

The paper introduces Discovery Loop, a lightweight system that employs a large language model (LLM) to iteratively evolve optimization algorithms for the Packomania circle‑packing benchmark. Starting from a simple seed solver, the LLM proposes algorithmic improvements guided by a scoreboard and a history of prior ideas, evaluates each candidate against an independent verifier, and retains only successful changes. Within 15 iterations and a total LLM cost of $27.72, the system broke 10 Packomania records for N between 101 and 114, improving the best known solutions by 2.4%–5.4%. The work demonstrates that a cost‑efficient, LLM‑driven approach can rapidly advance state‑of‑the‑art solutions in a complex optimization domain, suggesting broader potential for democratizing automated scientific discovery.

arXiv AI
Sep 1

Test-Time Scaling for Scientific Equation Discovery

The paper investigates Test‑Time Scaling (TTS) for large language models (LLMs) in the context of automated scientific equation discovery, an open‑ended task where models iteratively search candidate equations using observed data for feedback. It frames equation discovery as a unified iterative search that encompasses Best‑of‑N, sequential refinement, tree search, and evolutionary methods, and studies how compute allocation—particularly search width—affects performance under fixed budgets. Experiments on the LLM‑SRBench dataset show that increasing search width with more compute improves results, while other factors like population‑branching split and controller choice have smaller impacts, indicating that controlling exploration versus exploitation is key to scaling LLM‑based equation discovery.

By Haowei Lin, Hubert Lim, Xiangyu Wang, Letian Huang, Di He
arXiv AI
Sep 18

Evolution or Illusion? Rethinking Evaluation in LLM Evolutionary Search

The paper critiques the common practice of evaluating large‑language‑model (LLM) evolutionary search methods using a single seed and fixed iteration budget, arguing that this approach is insufficient. By testing three search strategies across five optimization tasks and varying both the number of seeds (width) and iterations (depth), the authors find that optimal budget allocation depends on the strategy, task, and total budget, and that strategy rankings shift with different budgets. They propose a measurement protocol that maps the seeds‑by‑iterations frontier and offers practical guidance for researchers.

By Tal Oved, Roi Pony, Oshri Naparstek, Udi Barzelay
arXiv AI
Jul 29

Structured Scaling of AI Discovery Across Diverse Scientific Domains

arXiv:2604. 19341v2 Announce Type: replace-cross Abstract: Scientific discovery often requires many cycles of proposing, testing, and refining candidate solutions.

By Haotian Ye, Haowei Lin, Jingyi Tang, Yizhen Luo, Rahul Thapa, Caiyin Yang, Chang Su, Rui Yang, Ruihua Liu, Rundao Li, Zeyu Li, Pengwei Sun, Chong Gao, Dachao Ding, Guangrong He, Miaolei Zhang, Lina Sun, Wenyang Wang, Yuchen Zhong, Zhuohao Shen, Puheng Li, Pan Lu, Bianxiao Cui, Di He, Jianzhu Ma, Junfeng Li, Hexi Baoyin, Yejin Choi, Stefano Ermon, Xiaowen Chu, Tongyang Li, Yuzhi Xu, James Zou
arXiv AI
Jun 10

Towards Diverse Scientific Hypothesis Search with Large Language Models

arXiv:2606. 10587v1 Announce Type: cross Abstract: Large language models (LLMs) are on the rise for accelerating scientific discovery, most recently in advanced tasks such as generating valid scientific hypotheses.

By Haorui Wang, Parshin Shojaee, Kazem Meidani, Kunyang Sun, Jos\'e Miguel Hern\'andez-Lobato, Teresa Head-Gordon, Jiajun He, Chandan K. Reddy, Chao Zhang, Yuanqi Du