Self-Evolving Agents
Overview
Self-evolving agents are systems that use experience from task execution to change how they solve future tasks, rather than relying only on a fixed model or hand-designed workflow. Common approaches store and refine reusable skills or memories, optimize prompts and agent harnesses, train policies with reinforcement learning, or co-evolve task generators, environments, and teams of agents. These methods are tested in settings such as web and GUI use, coding, embodied robotics, scientific workflows, and reasoning benchmarks, with feedback ranging from execution outcomes to verifiers and paired validation. A central challenge is making improvements transfer to new tasks without forgetting earlier abilities or introducing unsafe behavior; reliable evaluation, update verification, and long-term monitoring remain open problems.
Latest papers
427 papers104 papers in the last four weeks, up 148% on the four weeks before. 0.6% of all new papers.
FinEvolveBench: A Benchmark for Self-Evolving Agents on Low-Repetition Tasks with Implicit Rewards
OpenSkill: Open-World Self-Evolution for LLM Agents
MLEvolve: A Self-Evolving Framework for Automated Machine Learning Algorithm Discovery
Towards Healthy Evolution: Exploring the Role and Mechanisms of Human-Agent Interaction in Self-Evolving Systems
Agentic Software: How AI Agents Are Restructuring the Software Paradigm
EpiEvolve: Self-Evolving Agents for Streaming Pandemic Forecasting under Regime Shifts
VASO: Formally Verifiable Self-Evolving Skills for Physical AI Agents
Autonomous heterogeneous catalyst discovery with a self-evolving multi-agent digital twin
Scaling Self-Evolving Agents via Parametric Memory
TMEM, a self-evolving parametric memory framework in which the agent not only compresses history into explicit memory but also absorbs distilled supervision into fast LoRA weights via lightweight online updates, genuinely altering its future behavior within a single episode. We formalize this as an agentic decision process with fast-weight rollout dynamics: actions are sampled from , while extraction actions produce supervision that updates for subsequent decisions. This view makes the extraction policy directly optimizable by RL: training improves not only task actions but also the quality of the data used for online LoRA adaptation. We further propose SVD-based initialization of the LoRA subspace to accelerate online convergence. Experiments on LoCoMo, LongMemEval-S, multi-objective search, and CL-Bench show that TMEM consistently outperforms summary-based and retrieval-based baselines across different model scales.