Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loops

AI systems increasingly participate in their own improvement: revising their outputs, adapting and evolving their own harnesses during deployment, training on data they generate, and — in a growing research thread — conducting AI research itself. The literature describing this participation has exploded, but under a vocabulary (“self-refine,” “self-reward,” “self-play,” “self-evolve”) that conflates fundamentally different ambitions. We survey 1,250 arXiv papers (2024–2026) and organize them along two axes: what the system improves — its behavior in deployment, its policy through training, its evaluator, or the research process itself — and the degree of loop closure (human-in-the-loop to fully closed). The taxonomy separates bounded self-refinement — convergent, evaluable, and already industrial practice — from open-ended recursive self-improvement (RSI), which remains bounded by grounding requirements, collapse dynamics, and compute constraints on every side current evidence can measure.

Introduction. The idea that an artificial intelligence might improve itself — and that each improvement might make the next one easier — is among the oldest in the field. Good’s “intelligence explosion” argument [1] and Schmidhuber’s provably-optimal Gödel machines [2] framed recursive self-improvement (RSI) as a theoretical endpoint decades before any system could plausibly attempt it. What has changed is that fragments of the loop are now engineering practice. Large language models routinely critique and revise their own outputs, train on data they themselves generated, rewrite their own agent scaffolding, and — in systems like FunSearch [3] and AlphaEvolve [4] — discover algorithms that feed back into the infrastructure of AI development itself.

Discussion / Conclusion. We surveyed 1,250 recent papers on AI self-improvement through a two-axis taxonomy — what the system improves (outputs, policy, scaffolding, the research process) and who validates the improvement — and argued that the axis structure resolves what the “self-X” vocabulary obscures: bounded self-refinement and open-ended recursive self-improvement are different phenomena with different evidence bases, different theory, and different risk profiles. The evidence sorts cleanly. Bounded self-refinement is an engineering success: inference-time loops reliably improve outputs when grounded in external signals; training-time loops persist those gains and are industrial practice; agents accumulate skills and experience across episodes; and evolutionary discovery systems produce artifacts — algorithms, kernels, mathematical constructions — that feed back into AI development itself. Open-ended RSI, by contrast, remains bounded on every side we can measure: theoretically by grounding requirements and compute elasticities, empirically by collapse dynamics, and practically by the non-verifiability of exactly the judgments (what to work on, what counts as better) that would make the loop self-sufficient. These are not one difficulty.