SEDIMA is a persistent hierarchical insight memory designed for evolutionary search agents that use large language models. It transforms raw search traces into natural‑language insights, clusters them by semantic similarity, and retrieves relevant guidance to inform future mutations, thereby accumulating transferable knowledge across runs and problems. When added as a drop‑in module, SEDIMA improves average final performance by 5.5% on AlgoTune and 6.6% on ALE‑Bench LITE, and reduces the number of iterations needed to reach baseline‑best performance by 32.3% on OpenEvolve.
Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains. However, existing LLM-driven evolutionary frameworks largely discard such knowledge, repeatedly rediscovering similar ideas and limiting opportunities for cross-run and cross-task learning.
arXiv:2608. 10795v1 Announce Type: new Abstract: Successful mutation strategies in evolutionary code search may contain reusable knowledge that is useful beyond a single run, and in some cases may transfer across related tasks and domains.
The paper introduces PACEvolve, a framework that improves self‑evolving agents powered by Large Language Models by addressing their tendency to become trapped in local contexts and repeat flawed hypotheses. It does so through three techniques: Hierarchical Context Management to prune memory, Momentum‑Based Backtracking to escape local minima, and a self‑adaptive Collaborative Evolution policy to balance refinement and knowledge transfer. These methods enable the agents to maintain a global view of search momentum and achieve state‑of‑the‑art results on complex evolutionary benchmarks.
Evolutionary search with large language models (LLMs) can stall when progress requires external knowledge the model lacks. Supplying relevant documents helps, but simply adding web search tool can kee...
arXiv:2609.40340v1 Announce Type: new Abstract: Evolutionary search with large language models (LLMs) can stall when progress requires external knowledge the model lacks. Supplying relevant documents...
arXiv:2609.00023v1 Announce Type: cross Abstract: In this paper, we introduce ES-AHD, a novel framework that fundamentally integrates Evolution Strategy (ES) into Large Language Model (LLM)-driven Au...
arXiv:2606. 14202v1 Announce Type: cross Abstract: Large Language Models (LLMs) have advanced Automatic Heuristic Design (AHD) by enabling heuristic generation through reasoning and code synthesis.
EvoTreeNAD is a genealogy‑guided evolutionary algorithm that autonomously discovers neural architectures without a predefined seed or search space. Starting from an empty root, it builds a persistent genealogy where each node represents a complete architecture; top‑percentile values from nodes and descendants steer lineage selection. The method combines an Idea Agent that proposes variants and a Code Agent that implements them, with theoretical analysis showing stationary variation regimes and empirical results demonstrating superior performance on CIFAR‑10/100 and MedMNIST‑v2 tasks.
MAPLE is a new agent that maintains and updates optimization problems through successive natural‑language requests, combining language‑based problem construction with mathematical programming and evolutionary search. It preserves the optimization program, accepted plans, earlier updates, and candidate solutions for future requests, enabling rapid adaptation to changing business constraints. In a benchmark of 15 trajectories and 180 updates across various operational domains, MAPLE completed all trajectories with high online scalar quality and Pareto hypervolume ratio, and maintained update validity and useful search information across substantial revisions.
arXiv:2606. 29082v1 Announce Type: cross Abstract: Would experience designing faster GPU kernels also help close in on a long-standing open mathematical conjecture?
Large language model (LLM) agents have achieved strong performance on a wide range of benchmarks, yet most evaluations assume static environments. In contrast, real-world deployment is inherently dynamic, requiring agents to continually align their knowledge, skills, and behavior with changing environments and updated task conditions.
arXiv:2610.00675v1 Announce Type: cross Abstract: Evolutionary approaches to LLM-driven discovery often generate new programs from a small set of selected ancestors. This keeps contexts manageable bu...