Which Self-Improvements Should We Trust? Reliable Self-Improvement When Agents Reuse Their Benchmarks
Not on the map. Why?
Abstract (arXiv)
As recursive self-improvement (RSI) rapidly advances, reliable evaluation becomes critical for guiding adaptive search. RSI typically relies on finite evaluation resources, such as fixed benchmarks, to determine which modifications are retained and what is proposed next. However, when these finite resources are repeatedly reused, new candidates are proposed based on feedback from the same evaluation set, so the search trajectory can adaptively overfit and empirical improvement may not reflect genuine population improvement on the underlying task distribution. Some existing methods account for multiple comparisons but assume that candidates are chosen independently of the evaluation set, and therefore do not control this adaptive dependence. To address this, we propose REUSE (Risk-controlled Evaluation Under Sequential Evolution), a certified evaluation and promotion framework that allows a fixed evaluation set to support repeated adaptive decisions while providing statistical guarantees. For a user-specified error level α, with probability at least 1-α, every promoted modification is a genuine population improvement on the underlying task distribution. REUSE achieves this by strictly limiting the evaluation feedback returned to the search process and accounting for possible promotion histories within the error budget. We develop detailed statistical theory for RSI evaluation in this setting, including simultaneous error control, valid lower bounds on cumulative improvement, and a characterization of the fundamental limits of adaptive evaluation reuse. In live self-improvement experiments, REUSE commits substantially fewer false promotions than evaluation frameworks from current RSI systems and error-controlled baselines, reducing the proportion of false promotions from up to 20.7% to 0%, while achieving final true population performance comparable to the best baselines.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 37 of its 62 references that are in the map. First posted on arXiv 27 Sep 2026.
Builds on
37 of 62 references.
References · 37
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
- 2022Scaling Laws for Reward Model Overoptimizationcited by 1,095
- 2024The AI Scientist: Towards Fully Automated Open-Ended Scientific Discoverycited by 1,071
- 2025AlphaEvolve: A coding agent for scientific and algorithmic discoverycited by 867
- 2023Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolutioncited by 551
- 2024Automated Design of Agentic Systemscited by 407
- 2025Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agentscited by 356
- 2017Information-theoretic analysis of generalization capability of learning algorithmscited by 303
- 2018Time-uniform, nonparametric, nonasymptotic confidence sequencescited by 229
- 2022Defining and Characterizing Reward Hackingcited by 203
25 more
- 2020Estimating means of bounded random variables by bettingcited by 169
- 2022Game-theoretic statistics and safe anytime-valid inferencecited by 155
- 2018Categorizing Variants of Goodhart's Lawcited by 149
- 2023Self-Taught Optimizer (STOP): Recursively Self-Improving Code Generationcited by 148
- 2015Algorithmic Stability for Adaptive Data Analysiscited by 88
- 2015Generalization in Adaptive Data Analysis and Holdout Reusecited by 83
- 2025A Self-Improving Coding Agentcited by 79
- 2015The Ladder: A Reliable Leaderboard for Machine Learning Competitionscited by 69
- 2014Optimal Inference After Model Selectioncited by 67
- 2026PostTrainBench: Can LLM Agents Automate LLM Post-Training?cited by 64
- 2025Huxley-G"odel Machine: Human-Level Coding Agent Development by an Approximation of the Optimal Self-Improving Machinecited by 53
- 2026Rethinking the Evaluation of Harness Evolution for Agentscited by 48
- 2026Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loopscited by 35
- 2014Preventing False Discovery in Interactive Data Analysis is Hardcited by 34
- 2016Online Rules for Control of False Discovery Rate and False Discovery Exceedancecited by 21
- 2026PACE: Anytime-Valid Acceptance Tests for Self-Evolving Agentscited by 13
- 2025SGM: A Statistical Godel Machine for Risk-Controlled Recursive Self-Modificationcited by 8
- 2019Online control of the familywise error ratecited by 7
- 2026Towards Reliable LLM Evaluation: Correcting the Winner's Curse in Adaptive Benchmarkingcited by 7
- 2026Self-Evolving Agents with Anytime-Valid Certificatescited by 6
- 2025On The Statistical Limits of Self-Improving Agentscited by 5
- 2026Automated Researchers Can Mitigate Well-characterized Alignment Failurescited by 5
- 2026Self-Authored Verification Is Unreliable in Heuristic Self-Improving Agentscited by 4
- 2026What Fits (Into Few Tokens) Doesn't Overfit: Compression and Generalization in ML Research Agentscited by 3
- 2026Signed Compression Progress on a Sealed Audit is Goodhart-Resistantcited by 1
Built on by
Not cited yet.