AIBullisharXiv – CS AI · 14h ago6/10
🧠
Compute Allocation in Evolutionary Search: From Depth-Breadth to Multi-Armed Bandits
Researchers propose BaSE, a multi-armed bandit algorithm that optimizes how large language models allocate computational resources during evolutionary search tasks. By dynamically distributing LLM calls across parallel trajectories, BaSE improves mean fitness by 12.3% over existing baselines while addressing the reliability gap between reported best-case and typical run performance.