Tag
An empirical study of OpenEvolve 0.4.0 shows that LLM-guided evolutionary search can discover valid improved algorithms yet select invalid programs when the working fitness function fails to capture the full task specification, revealing a gap between discovery quality and selection quality. The authors independently verify algorithm quality across circle-packing and approximate k-nearest-neighbors tasks using multiple Gemma 4 configurations and search budgets.
The paper introduces GRAFT, an execution-guided genetic recombination method for automated LLM agent design that uses parent-specific execution evidence to guide semantic crossover, achieving 82.0% mean test accuracy across six reasoning and programming settings—9.8 points above the strongest baseline.
Inventa is a framework for automated scientific discovery using decentralized autonomous research units that evolve ideas via mutator agents, verified shared knowledge, and adaptive orchestrators. It leads five benchmarks including EurekaBench (73.6% vs 56.2% for CORAL) while using far fewer model calls.
HACE 是一个联合进化专业基础模型与 LLM 智能体的框架,通过 reciprocal learning 和进化搜索优化二者交互机制,在推荐系统、蛋白质功能预测和晶体稳定性预测三个领域均超越现有自我改进方法。
This paper introduces component-aware feedback for LLM-guided evolutionary search, logging which component edits changed which fitness metrics in an attribution memory, achieving baseline-quality performance in one-third of the search budget and 7.2% higher nDCG@10 on Bright reranking tasks.
EvoDuet introduces a bilevel optimization framework that co-evolves solutions and web search queries with fixed LLM parameters, using a retrieval gate to decide when to fetch new documents versus reusing stored ones. Across 21 tasks it boosts OpenEvolve's normalized discovery gain notably (e.g., 61.3% to 82.3% with Gemini-3.8-Flash), surpassing prior best scores on eight tasks and generalizing across different evolutionary search scaffolds.
The paper introduces MILO, a framework that co-evolves agent harnesses alongside the search strategy used to discover them, using island-based evolutionary search with mutator agents and an orchestrator. On Terminal-Bench 2.1, PaperBench, and DeepSWE, MILO-discovered harnesses outperform state-of-the-art harnesses and search methods, even exceeding the Terminal-Bench 2.1 leaderboard's top entry while using 26% fewer tokens.
HARDEN introduces a constrained evolutionary search to generate more challenging evaluation cases for language models while preserving expected outputs, demonstrating significant accuracy reductions across benchmarks.
EvoRank is an LLM-guided evolutionary system for discovering multi-objective learning-to-rank pipelines in e-commerce, which demonstrates transferable improvements over baselines and includes auditing tools.
This paper critiques single-point evaluations for LLM evolutionary search, showing that optimal performance depends on varying seeds and iterations, and proposes a budget-grid evaluation protocol.
ArchAgent v2 from Google DeepMind automates multi-level data prefetcher design using agentic algorithm discovery, outperforming hand-designed solutions in the Data Prefetching Championship.
Introduces StorySpark, a module-wise evolutionary search framework for LLM-based story premise generation, demonstrating consistent gains in originality and downstream story quality.
This paper examines how LLM-driven evolutionary optimization of GPU kernels can fingerprint evaluation configurations, causing 30% of in-distribution wins to fail on held-out settings. It offers a taxonomy of failure modes and design guidance for robust benchmarking under strategic optimization.
This paper introduces RelayEvolve, a training-free framework for cost-efficient LLM-driven evolution that adaptively hands off populations from cheap to strong models, achieving high scores across benchmarks under fixed inference budgets.
This paper introduces DyCA, a framework for LLM-assisted evolutionary search that uses dynamic instance clustering to improve tail robustness under heterogeneous instance distributions, outperforming existing LES baselines on four algorithm design tasks.
DarwinX evolves LLM agent harnesses via natural-selection-style population search with frozen model weights, improving verified performance across multiple benchmarks without benchmark-specific patching.
This paper proposes using linguistic rules alone as prompt compressors without LM forward passes, achieving performance similar to advanced strategies under light-to-moderate compression.
GAE introduces a framework combining graph neural networks, reinforcement learning, and LLM fine-tuning to overcome bottlenecks in evolutionary program search, achieving state-of-the-art performance on symbolic regression for complex nonlinear oscillator systems.
Introduces an evolutionary neural architecture search framework (EvoTS) for discovering task-adaptive Transformer-like models for multivariate time-series forecasting. The approach uses a modular genome representation and achieves competitive performance on ETT benchmark datasets.
This paper introduces Evolution Fine-Tuning (EFT), a mid-training paradigm that teaches LLMs to evolve solutions across optimization tasks by converting evolutionary search trajectories into supervision. The authors construct the Finch Collection dataset of 156K trajectories across 371 tasks and show that fine-tuned models generalize to held-out tasks and match state-of-the-art performance on several benchmarks.