Paper Overview
Research area: NLP Authors: Akshat Gupta, Jermaine Lei, Alexander Lu, Gopala Anumanchipalli, Leshem Choshen Published: 2026-07-20 arXiv: 2607.18235 Categories: cs.CL, cs.AI
Key Findings
- Autonomous discovery systems such as OpenEvolve and TTT-Discover are commonly used as general-purpose harnesses, but in practice each is a composite system combining multiple design choices: archive handling, parent selection, exploration strategy, and budget allocation.
- Because discovery runs are expensive and inherently stochastic, existing framework comparisons typically use too few independent trials to separate genuine methodological improvements from run-to-run variance.
- The authors systematically decompose OpenEvolve-style evolutionary search and the TTT-Discover search framework into their constituent components.
- They evaluate 30 budget-matched harnesses across 12 model-problem pairs, using over 3.1 million LLM rollouts with repeated-trial statistical analysis.
Main Conclusion
Discovery harnesses suffer from a generalization problem: no fixed harness is consistently superior across all evaluated model-problem pairs. OpenEvolve variants frequently underperform simpler alternatives. Consequently, harness selection should be treated as a hyperparameter — tuned to the specific problem and underlying model — rather than as a universal scheme.
Proposed Solution
The paper proposes an adaptive-allocation approach that distributes evaluation budget dynamically, outperforming fixed harness selection.
--- *Auto-collected on 2026-07-22*