EvoX: Meta-Evolution for Automated Discovery

2026-02-26

AI Summary

This work proposes an adaptive evolutionary framework that addresses the limitations of existing AI-driven evolutionary methods, which typically rely on static search strategies and struggle to accommodate task heterogeneity or dynamically changing search spaces. The proposed approach uniquely enables the co-evolution of candidate solutions and search strategies by integrating large language models with a meta-evolutionary mechanism. This integration allows the system to dynamically select and mutate historical solutions while continuously updating its search policy, thereby autonomously balancing exploration and exploitation. Extensive experiments across nearly 200 real-world optimization tasks demonstrate that the method significantly outperforms state-of-the-art AI-based evolutionary algorithms such as AlphaEvolve and OpenEvolve, confirming its generality and effectiveness.

Technology Category

• Search and Optimization: Evolutionary Computation
• Machine Learning: Evolutionary Learning
• Humans and AI: Human-Aware Planning and Behavior Prediction

Application Category

• Search and Retrieval-Augmented AI: Large language models for search
• Economics, Online Markets and Human Computation: Uses of LLMs and GenAI for marketplace design, bidding, and strategic interactions
• User Modeling, Personalization and Recommendation: Large Language Models (LLM) for user modeling and recommendation

Abstract

Recent work such as AlphaEvolve has shown that combining LLM-driven optimization with evolutionary search can effectively improve programs, prompts, and algorithms across domains. In this paradigm, previously evaluated solutions are reused to guide the model toward new candidate solutions. Crucially, the effectiveness of this evolution process depends on the search strategy: how prior solutions are selected and varied to generate new candidates. However, most existing methods rely on fixed search strategies with predefined knobs (e.g., explore-exploit ratios) that remain static throughout execution. While effective in some settings, these approaches often fail to adapt across tasks, or even within the same task as the search space changes over time. We introduce EvoX, an adaptive evolution method that optimizes its own evolution process. EvoX jointly evolves candidate solutions and the search strategies used to generate them, continuously updating how prior solutions are selected and varied based on progress. This enables the system to dynamically shift between different search strategies during the optimization process. Across nearly 200 real-world optimization tasks, EvoX outperforms existing AI-driven evolutionary methods including AlphaEvolve, OpenEvolve, GEPA, and ShinkaEvolve on the majority of tasks.

Problem

• evolutionary search
• search strategy
• adaptation
• automated optimization
• LLM-driven optimization

Innovation

• meta-evolution
• adaptive search strategy
• LLM-driven optimization
• evolutionary search
• self-optimizing evolution