Skip to main content
Aggregate arXiv cs.AI 人工智能 15 Aug 2026 - 14:30

Beyond the Best Guess: Improving LLM Solution Coverage with Evolution Strategies

RSS 官方收录 · 可信分层展示

关键摘要

arXiv:2608.12679v1 Announce Type: new Abstract: 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 …
  • However, beyond this best guess, discovery can be enhanced by increasi…
  • In a process called pass@k, the model is allowed to explore the soluti…

摘要引擎:抽取

正文提要

arXiv:2608.12679v1 Announce Type: new Abstract: 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.

来源:https://arxiv.org/abs/2608.12679

打开官方原文 站点原文页 可信分区 本信源更多 今日简报 分享图 RSS 稍后再看列表