Aug 2026· 5 citations· ⚡ 1 influential· 28 references
Computer Science
TL;DR
It is shown the contamination is structurally irreversible: removing a source skill after the fact cannot erase the flawed reasoning its descendants have already inherited, so post-hoc rollback recovers only a small fraction of the lost performance, making skill admission a pre-commit necessity rather than a post-hoc fix.
Abstract
Self-evolving agents accumulate capability by distilling reusable skills from their execution trajectories, but we find this process is not monotonic: past a critical pool size, newly added skills degrade performance instead of improving it. We formalize this capability-contamination phase transition and trace it to a structural cause: once a defective skill enters the decision context, it becomes reference material for distilling later skills, forming cross-round contamination chains. We further show the contamination is structurally irreversible: removing a source skill after the fact cannot erase the flawed reasoning its descendants have already inherited, so post-hoc rollback recovers only a small fraction of the lost performance. This makes skill admission a pre-commit necessity rather than a post-hoc fix, and motivates Verifier-as-Gatekeeper (VaG): a progressive trust hierarchy whose three heterogeneous critics - structural validity, behavioral harmlessness, and semantic consistency - filter each skill individually, coupled with a marginal-gain subset selection that removes combinatorial contamination at the top tier before skills reach the runtime context. On Terminal-Bench 2, unconditional accumulation rises to a peak and then degrades, giving back most of its gains as the pool keeps growing, and post-hoc removal of the culprit skills recovers only a small part of the drop - the empirical signature of irreversibility. In contrast, VaG improves every round, reaching 72% pass@1 with a pool roughly 5x smaller, and its frozen skill pool transfers positively to four other backbones and a second benchmark without re-evolution. Ablations confirm the three critics are complementary and mutually non-substitutable, each intercepting a largely disjoint class of harmful skills.
Systematic skill-bank audits reveal two recurring reliability failures: coalition pollution, where bank-level gains conceal negative coalition-level skill contributions, and cross-domain utility reversal, where source-beneficial skills reverse their effects after transfer.
Qiyan Zhao, Xiao-Feng Zhang, Bo Liu et al.· 0 citations
This work proposes SafeEvolve, which checks each skill when it is written and when a later task retrieves it, and introduces SkillMisevo-Gym, which clears every task session but keeps the skill library, so each of these steps can be checked separately.
This work argues that the binding constraint on sustained skill evolution is neither editing capability nor the number of iterations, but whether the evaluation feedback keeps supplying trustworthy evolution gradients, and introduces SkillEvo, in which trustworthy feedback generates the gradient and controllable govern...
Qian-Xi Yan, Chun-Rong Chen, Jiu-Zhou Zhao et al.· 0 citations
PoisonedEvolution is introduced, a trajectory-poisoning attack on self-evolving skill systems that exposes evidence promotion as a security boundary for self-evolving agents.
Jia-Luo Chen, Ling-Qi Jiang, Xin-Hao Deng et al.· 1 citation· ⚡1
This work argues that robust evolution implies Structural Invariance: a reasoning path is valid only if its core dependency graph remains isomorphic under counterfactual perturbations, and enforces this with Verifiable Counterfactual Simulation (VCS).
Run-Ze Fan, Yong Li· Proceedings of the Thirty-Fi...· 0 citations
Long-horizon web agents frequently fail without knowing where or why execution broke down. This issue is particularly pronounced in skill-based agentic web systems, where failures arise within composite skills whose internal decision processes are not directly traceable, making precise diagnosis and repair especially d...
Yuyang Li, Yiran Dou, Jiejing Shao et al.· Proceedings of the 32nd ACM...· 5 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduOct 15, 2026
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026