arXiv Machine Learning

PACEvolve: Enabling Progress-Aware Consistent Evolution

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.

arXiv AI
Jun 6

MLEvolve: A Self-Evolving Framework for Automated Machine Learning Algorithm Discovery

arXiv:2606. 06473v1 Announce Type: new Abstract: Large language model (LLM) agents are increasingly applied to long-horizon tasks such as scientific discovery and machine learning engineering (MLE), where sustained self-evolution becomes a key capability.

By Shangheng Du, Xiangchao Yan, Jinxin Shi, Zongsheng Cao, Shiyang Feng, Zichen Liang, Boyuan Sun, Tianshuo Peng, Yifan Zhou, Xin Li, Jie Zhou, Liang He, Bo Zhang, Lei Bai
arXiv AI
Aug 18

Evolving Ensemble of Agents

arXiv:2605. 09018v4 Announce Type: replace-cross Abstract: We introduce the Evolving Ensemble of Agents (EvE), a decentralized framework that organizes existing, highly capable coding agents into a live, co-evolving system for algorithmic discovery.

By Zongmin Yu, Liu Yang
arXiv AI
Jul 7

Evolutionary Ensemble of Agents

arXiv:2605. 09018v3 Announce Type: replace-cross Abstract: We introduce Evolutionary Ensemble (EvE), a decentralized framework that organizes existing, highly capable coding agents into a live, co-evolving system for algorithmic discovery.

By Zongmin Yu, Liu Yang
arXiv AI
Sep 7

OR-Agent: Bridging Evolutionary Search and Structured Research for Automated Heuristic Design

OR-Agent is a multi‑agent research framework that automates heuristic design for optimization problems by structuring heuristic search as a tree‑based workflow with explicit hypothesis generation and systematic backtracking. It introduces a hierarchical, optimization‑inspired reflection system that uses short‑term reflections as verbal gradients, long‑term reflections as verbal momentum, and memory compression as semantic weight decay to guide research dynamics. Experiments on classical combinatorial optimization tasks and simulation‑based cooperative driving scenarios show that OR‑Agent outperforms strong evolutionary search baselines, with all code and data publicly available.

By Qi Liu, Ruochen Hao, Can Li, Wanjing Ma