Large Language Models (LLMs) are increasingly deployed in discovery domains such as math and science. The usual approach is to present the problem to the model and use its answer as the proposed solution. However, beyond this best guess, discovery can be enhanced by increasing test-time compute. In a process called pass@k, the model is allowed to explore the solution space and generate diverse candidate solutions. Unfortunately, the standard approach to post-training LLMs through Reinforcement Learning (RL) may limit pass@k: the model's output distribution narrows around high-reward outputs, causing the solution coverage to collapse. The alternative is to use Evolution Strategies (ES), a population-based, gradient-free post-training method that optimizes directly in weight space through random perturbations. As this paper shows, ES achieves consistently higher pass@k than RL and produces a broader output distribution with greater solution coverage. This coverage in turn makes it possible to achieve better results in e.g. standard math benchmarks. Thus, ES provides a better foundation for post-training in discovery problems and other domains where diverse solution coverage is critical.

PDF

arXiv:2608.12679 (2026).

@article{hayes:arxiv26, title={Beyond the Best Guess: Improving LLM Solution Coverage with Evolution Strategies}, author={Conor F. Hayes and Elliot Meyerson and Kajetan Schweighofer and Roberto Dailey and Babak Hodjat and Risto Miikkulainen and Xin Qiu}, journal={arXiv:2608.12679 }, month={ }, url="http://www.cs.utexas.edu/users/ai-lab?hayes:arxiv26", year={2026} }