- Rating
- 2
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Bidirectional Evolutionary Search (BES), a search framework for improving the quality of LLM-generated solutions during both post-training and inference. BES combines forward search with several evolutionary operators, including combination, deletion, translocation, and crossover, to generate new candidates from existing trajectories. It also introduces backward search that recursively decomposes a task into verifiable sub-goals, providing more fine-grained feedback to guide candidate selection.
The authors evaluate BES across multi-hop reasoning, logical reasoning, mathematical reasoning, competitive programming, and open problem solving. The experiments show improvements over several sampling and search baselines, particularly on challenging tasks where conventional post-training methods struggle to discover successful trajectories.
Critical strengths
-
Reasonable empirical improvements across multiple settings. The paper evaluates BES in both post-training and inference-time search, covering a reasonably broad range of tasks. The reported improvements over several existing search baselines suggest that combining evolutionary operators with goal decomposition can be practically useful.
-
A unified framework for candidate generation and verification. BES provides a relatively systematic way to combine candidate evolution with fine-grained verification. Although the individual components are not entirely new, integrating them into a single framework for both training-time sampling and inference-time search is a useful engineering contribution.
Critical weaknesses
-
Limited methodological novelty. My main concern is that BES appears to be largely an integration of existing ideas rather than a fundamentally new search algorithm. Evolutionary operators such as crossover, recombination, and mutation have been extensively explored in evolutionary computation and more recent LLM-based evolutionary search frameworks. Similarly, goal decomposition and intermediate verification are well-established ideas in planning and reasoning. While combining these components is reasonable, I find the proposed method conceptually rather incremental. The paper does not sufficiently establish what new algorithmic insight BES provides beyond this combination.
-
Insufficient evidence for the significance and generality of the proposed approach. Although the experiments report improvements, I am not fully convinced that they establish a sufficiently substantial advancement over existing search methods. For example, the improvements on AIME and LiveCodeBench are relatively modest in several settings, while BES introduces additional search and verification complexity. Furthermore, the ablation study mainly examines the removal of the two major components on a single logical reasoning benchmark, making it difficult to understand the individual contributions of the evolutionary operators and the conditions under which each component is genuinely beneficial. I would also like to see stronger evidence that the proposed framework provides a consistent advantage in terms of solution quality versus computational cost.
Questions for authors
Please see Weaknesses