Beneath the Surface: What We Overlook When We Talk About Agent Evolution

Xiaobo Wang, Zimu Wang, Siyu Ye, Jiaqi Li, Min Tang, Jun Bai, Yuling Shi, Ruobing Wang and 8 others

University of Science and Technology of China · University of California, Berkeley · Simple Agent Lab · Beijing Institute for General Artificial Intelligence · Shanghai Jiaotong University

Published November 5, 2026 · on the feed November 9, 2026 · ▲ 25 · arXiv 2611.07624

Agents Dead link arXiv ↗Hugging Face ↗

The abstract

Agent harness evolution enables recursive self-improvement (RSI) without updating model weights. We examine whether higher benchmark scores yield reliable, efficient, and transferable improvement. We evaluate four methods across harnesses, general and coding tasks. Repeated evaluations, controlled agent expansion, component interventions, and admission replays reveal recurring patterns. All sixteen evolved agents gain previously uncovered tasks while losing previously covered ones. In one general-task case, reliability rises by 5.2 points despite losing ten previously covered tasks. Most reliability gains also increase deployment cost. Specific changes usually outperform generic reminders, but their benefits can change when combined. The highest-scoring agent does not yield the largest mean improvement in any of our four pools, and stricter admission can discard useful alternatives. Transfer selectively preserves gains: coverage usually falls on the general-task target across both harness types and paradigms, but rises on the coding target with the outer-layer-only harness. These findings motivate preservation-aware evaluation, tested decision rules, and explicit applicability conditions. As a constructive follow-up, EvoAudit turns these diagnostics into revisions of select, analyze, mutate, and gate, achieving the best performance.

The Brief

2:16

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Beneath the Surface. What We Overlook When We Talk About Agent Evolution. By Xiaobo Wang and fifteen others, from the University of Science and Technology of China, the University of California, Berkeley, and three other institutions. Published on the fifth of November.

Agent harness evolution promises recursive self-improvement without touching model weights: the agent's surrounding machinery is revised, and the benchmark score goes up. This work asks whether a higher score actually means improvement that is reliable, efficient and transferable. Its answer is that the headline number hides a good deal. Evolution trades tasks rather than simply adding them, reliability tends to be bought with cost, and the best-scoring agent is not the best source of improvement.

Four evolution methods were evaluated across harnesses, on general and on coding tasks, using repeated evaluations, controlled agent expansion, component interventions and admission replays. The pattern is consistent. All sixteen evolved agents gain tasks they previously missed while losing tasks they previously solved. In one general-task case, reliability rises by five point two points even though ten previously covered tasks are lost.

Most reliability gains also raise deployment cost. Specific changes usually beat generic reminders, but their benefits can shift once they are combined. In none of the four pools does the highest-scoring agent yield the largest mean improvement, and a stricter admission rule can throw away useful alternatives. Transfer keeps gains only selectively. Coverage usually falls on the general-task target, across both harness types and paradigms, yet it rises on the coding target when the harness changes only its outer layer.

These are observations about four methods and the harnesses and task pools they were run on, and the transfer result depends on which target and which kind of harness is involved. What the authors draw from them is a set of requirements rather than a universal law: evaluation that tracks what is preserved as well as what is gained, decision rules that have themselves been tested, and explicit statements of when a result applies.

As a constructive follow-up, EvoAudit turns these diagnostics into revisions of four steps in the evolution loop: select, analyze, mutate and gate. With those revisions it achieves the best performance. The broader lesson is about reading a rising curve. A score can climb while the set of things an agent can do quietly shifts underneath it, and only looking at what was lost alongside what was won reveals that.

Paper Quest · 7 chapters · about 41 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

The score keeps rising. The wall here is knowing whether that means anything.

You keep a model's weights frozen and let an evolution method rewrite the prompts, skills and code around it. Generation after generation, the benchmark score climbs.

The road ahead

  1. 1 · The problem ~7 min A rising benchmark score during agent evolution may hide lost tasks, higher cost and weak results on unseen tasks.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~9 min Score gains hide traded tasks, rising cost and selective transfer, so each evolution decision needs evidence of its own.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Evolve agents with four methods, measure per-task gains and losses, probe each decision, then turn the findings into revised operators.
  6. 6 · The experiment ~6 min You’ll guess: Of the sixteen evolved agents studied, how many gained new tasks without losing any they previously solved?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.