Self-Evolving Agents with Anytime-Valid Certificates
Not on the map. Why?
Abstract (arXiv)
Self-evolving agents violate the assumption behind most learning-theoretic guarantees: the data, evaluator, components, and hypothesis space are produced by the policy being updated. We present SEA, an architecture that confines self-modification to a small steering adapter and a versioned harness around a frozen base model and admits each modification only through an anytime-valid gate that emits an auditable certificate against a fixed error budget. Five loop controllers compose published guarantees; because such gates can only select among behaviors the frozen base already produces, five verifier-in-the-loop mechanisms -- best-of-N, micro-step search, self-authored reproduction oracles, search-layer control, and self-repair -- supply the dense, grader-free signal the gates require, computed from the issue text alone. On a 52-instance SWE-bench Verified subset across four base models, base capability is the dominant, confound-free effect, and on two strong base models a deliberate no-op-composite control isolates the suite's contribution at +4 and +5 (textscGlm~5.2 24→28; textscGpt 29→34, the 65% best), with event logs confirming that its mechanisms fire and prevent regressions. Results are single-run on expensive evaluations; confirming run-to-run variance and adapting the per-task algorithm mix are future work.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 34 of its 45 references that are in the map. First posted on arXiv 1 Jul 2026.
Builds on
34 of 45 references.
References · 34
- 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
- 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
- 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
- 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
- 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,317
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
- 2022Scaling Laws for Reward Model Overoptimizationcited by 1,056
- 2023Teaching Large Language Models to Self-Debugcited by 963
- 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 946
- 2022STaR: Bootstrapping Reasoning With Reasoningcited by 895
- 2023Reinforced Self-Training (ReST) for Language Modelingcited by 486
- 2015Illuminating search spaces by mapping elitescited by 406
22 more
- 2022CodeT: Code Generation with Generated Testscited by 369
- 2019Orthogonal Gradient Descent for Continual Learningcited by 361
- 2020Performative Predictioncited by 318
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 220
- 2022Game-theoretic statistics and safe anytime-valid inferencecited by 145
- 2024Is Model Collapse Inevitable? Breaking the Curse of Recursion by Accumulating Real and Synthetic Datacited by 143
- 2016Coin Betting and Parameter-Free Online Learningcited by 131
- 2017Quality and Diversity Optimization: A Unifying Modular Frameworkcited by 111
- 2019Hindsight Credit Assignmentcited by 74
- 2013A PAC-Bayesian bound for Lifelong Learningcited by 69
- 2020Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descentcited by 68
- 2022Top-Down Synthesis for Library Learningcited by 57
- 2022Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyondcited by 27
- 2020Towards Safe Policy Improvement for Non-Stationary MDPscited by 26
- 2022Performative Reinforcement Learningcited by 25
- 2023A unified recipe for deriving (time-uniform) PAC-Bayes boundscited by 25
- 2024Magnetic Preference Optimization: Achieving Last-iterate Convergence for Language Model Alignmentcited by 20
- 2025A Theoretical Perspective: How to Prevent Model Collapse in Self-consuming Training Loopscited by 15
- 2023Would I have gotten that reward? Long-term credit assignment by counterfactual contribution analysiscited by 10
- 2025SGM: A Statistical Godel Machine for Risk-Controlled Recursive Self-Modificationcited by 7
- 2025Proximal Point Nash Learning from Human Feedbackcited by 4
- 2024Data-dependent and Oracle Bounds on Forgetting in Continual Learningcited by 3
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Self-Evolving Coding Agentscited by 2
- 2026Propose, Don't Judge: An Anytime-Valid Referee for LLM Agents That Mine Investment Factorscited by 0
- 2026Which Self-Improvements Should We Trust? Reliable Self-Improvement When Agents Reuse Their Benchmarkscited by 0
- 2026Protected Cores Are Not Enough: Certifying AI-Proposed Revisions of Temporal Specificationscited by 0
- 2026EvoSteer: Online Self-Evolving Graph Orchestration via Reference-Anchored Credit Assignmentcited by 0
- 2026Authorization for Self-Modifying AI Agent Populations: Conserving Authority across Replacement, Forking, and Rollbackcited by 0
- 2026Authorization for Self-Modifying AI Agent Populations: Conserving Authority across Replacement, Forking, and Rollback29 Sep 2026
- 2026EvoSteer: Online Self-Evolving Graph Orchestration via Reference-Anchored Credit Assignment29 Sep 2026
- 2026Protected Cores Are Not Enough: Certifying AI-Proposed Revisions of Temporal Specifications27 Sep 2026
- 2026Which Self-Improvements Should We Trust? Reliable Self-Improvement When Agents Reuse Their Benchmarks27 Sep 2026
- 2026Propose, Don't Judge: An Anytime-Valid Referee for LLM Agents That Mine Investment Factors22 Sep 2026
- 2026Self-Evolving Coding Agents4 Aug 2026