← All concepts

evolutionary search

Evolutionary search is a way to solve problems by generating many candidate solutions, keeping the ones that score best, and then mutating those survivors to create new candidates. This cycle repeats until a good enough answer appears, mimicking biological evolution where small random changes accumulate and useful traits persist.

Across the papers, evolutionary search acts as a practical optimizer paired with AI systems. One study uses it to fairly compare language model search strategies by tracking token costs, another runs an agent loop that mutates benchmark tasks to keep difficulty balanced, and a third evolves robot object arrangements in simulation. The common thread is treating evolution as a resource-aware, adaptable engine for improving either the search itself or the data and behaviors it produces.

Papers
3
Released code
0
First seen
Oct 2026
Latest
Oct 2026

3 papers in the last two months, against 0 in the two before.

Start here

Two papers to read first, in the order they came out
  1. 1Token accounting shrinks evolutionary search’s apparent advantage over sampling

    LLM evolutionary search advantages shrink to 5% or less on most tasks when comparisons are token-matched and scorer exploits are removed.

    Oct 2026
  2. 2Evolving existing tasks creates harder, more diverse tool-use benchmarks

    An Unsupervised Environment Design loop with three LLM agents evolves tool-use benchmarks to match a solver's difficulty frontier, increasing task difficulty, diversity, and failure mode coverage.

    Oct 2026

The papers

Most central to this idea first, not most recent.

Concepts are extracted from each paper and reused across the corpus, so this page grows on its own as the desk reads.