mlsanityData to 7 Oct 2026

Self-Evolving Agents with Anytime-Valid Certificates

arXiv 2607.00871 ↗First posted 1 Jul 2026cs.AI cs.CLcited by 6

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

  1. 2022ReAct: Synergizing Reasoning and Acting in Language Modelscited by 8,355
  2. 2023Reflexion: Language Agents with Verbal Reinforcement Learningcited by 4,064
  3. 2021Prefix-Tuning: Optimizing Continuous Prompts for Generationcited by 3,878
  4. 2021The Power of Scale for Parameter-Efficient Prompt Tuningcited by 3,769
  5. 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,317
  6. 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,193
  7. 2022Scaling Laws for Reward Model Overoptimizationcited by 1,056
  8. 2023Teaching Large Language Models to Self-Debugcited by 963
  9. 2024Large Language Monkeys: Scaling Inference Compute with Repeated Samplingcited by 946
  10. 2022STaR: Bootstrapping Reasoning With Reasoningcited by 895
  11. 2023Reinforced Self-Training (ReST) for Language Modelingcited by 486
  12. 2015Illuminating search spaces by mapping elitescited by 406
22 more
  1. 2022CodeT: Code Generation with Generated Testscited by 369
  2. 2019Orthogonal Gradient Descent for Continual Learningcited by 361
  3. 2020Performative Predictioncited by 318
  4. 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 220
  5. 2022Game-theoretic statistics and safe anytime-valid inferencecited by 145
  6. 2024Is Model Collapse Inevitable? Breaking the Curse of Recursion by Accumulating Real and Synthetic Datacited by 143
  7. 2016Coin Betting and Parameter-Free Online Learningcited by 131
  8. 2017Quality and Diversity Optimization: A Unifying Modular Frameworkcited by 111
  9. 2019Hindsight Credit Assignmentcited by 74
  10. 2013A PAC-Bayesian bound for Lifelong Learningcited by 69
  11. 2020Generalisation Guarantees for Continual Learning with Orthogonal Gradient Descentcited by 68
  12. 2022Top-Down Synthesis for Library Learningcited by 57
  13. 2022Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyondcited by 27
  14. 2020Towards Safe Policy Improvement for Non-Stationary MDPscited by 26
  15. 2022Performative Reinforcement Learningcited by 25
  16. 2023A unified recipe for deriving (time-uniform) PAC-Bayes boundscited by 25
  17. 2024Magnetic Preference Optimization: Achieving Last-iterate Convergence for Language Model Alignmentcited by 20
  18. 2025A Theoretical Perspective: How to Prevent Model Collapse in Self-consuming Training Loopscited by 15
  19. 2023Would I have gotten that reward? Long-term credit assignment by counterfactual contribution analysiscited by 10
  20. 2025SGM: A Statistical Godel Machine for Risk-Controlled Recursive Self-Modificationcited by 7
  21. 2025Proximal Point Nash Learning from Human Feedbackcited by 4
  22. 2024Data-dependent and Oracle Bounds on Forgetting in Continual Learningcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 6.

6 papers.