Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits 事件

Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits arXiv:2605.29268v1 Announce Type: new Abstract: LLM-guided evolutionary search (Evolve systems) has reached state-of-the-art results on mathematical and combinatorial tasks, yet most existing systems report only the best of many runs and leave the run-to-run distribution undocumented. We ask how a fixed budget of LLM calls should be allocated, and how reliably a single run reaches the reported numbers. Sweeping