Can search escape the entropy shell of language models?

The framing in Bidirectional Evolutionary Search (BES) is sharper than its method. It diagnoses two coupled failures shared by best-of-N and tree search: candidates are built almost entirely by autoregressive expansion, which confines them to a "narrow entropy shell" around the model's probability mass; and they are steered by sparse verification, a signal that only arrives at the end. BES attacks each axis separately — forward search adds evolution operators that recombine partial trajectories into candidates a single rollout would rarely produce, and backward search recursively decomposes the task into checkable sub-goals that supply dense intermediate feedback. The theoretical claim is that recombination escapes the entropy shell, and that backward decomposition can exponentially cut the samples needed to hit a correct answer.

This consolidates a cluster the vault has been circling. Can evolutionary search beat sampling and revision at inference time? is the direct forward-search precedent; How should we balance parallel versus sequential compute at test time? frames the dichotomy that BES claims to transcend with population-based recombination. The backward half is the more novel synthesis: it operationalizes Does planning direction affect how hard problems become? as a feedback-density mechanism rather than only a search-space pruner — sub-goals are valued because they are checkable, turning a sparse terminal signal into a dense one.

The honest caveat is that recombining partial trajectories assumes those fragments compose into coherent wholes, which is exactly where natural-language reasoning is brittle; "escapes the entropy shell" can also mean "drifts into incoherent regions the verifier was never calibrated for." And backward decomposition only helps when sub-goals are genuinely verifiable — on open-ended tasks the decomposition step inherits the same generation problem it was meant to bypass. It connects naturally to Can AI systems improve themselves through trial and error?: both replace a clean verification signal with empirical, recombinative search, and both live or die on the quality of the cheap check.