Does recursive self-improvement sustain gains or hit diminishing returns?
The paper claims recursive self-improvement counters diminishing returns in R&D spending, but the evidence shows only a count of seven accepted rewrites. Do the gains from each rewrite actually compound, or does the loop exhaust cheap fixes first and then plateau?
The paper frames its significance as a counter to a trend: "increased cumulative spending on R&D yields diminishing returns. Sustained self-improvement offers a way to counter this trend" (Can recursive self-improvement speed up the research process itself?). The evidence in the excerpt is a count: "seven successive improvements" in "an autonomous 8-day run" (Can an AI agent reliably improve itself through hidden evaluation?).
A count does not distinguish two pictures. In one, each accepted rewrite makes the proposer better at finding the next, so gains compound. In the other, the loop takes the cheap fixes first and each later rewrite finds less, so the loop meets diminishing returns of its own, only sooner. Both are compatible with seven accepted rewrites. The excerpt gives neither the size of each gain nor when in the eight days each was found nor whether the run stopped because of the budget or because candidates stopped winning.
There is a second way returns could fall. The selection tasks are a fixed suite scored under a fixed evaluation budget, and the vault holds that a fixed evaluator saturates as an agent improves (Why do fixed benchmarks fail as agents grow stronger?). Eight days is a short horizon for that dynamic. The excerpt reports no gaming, and it also reports a rewrite class aimed at "untrustworthy wins" (What exactly does hidden mean in AIDE2's evaluation system?).
What would answer it: the score at each of the seven accepted rewrites, their timing, and a longer run. The paper's own section 3.2 and 3.3 numbers are cited in the excerpt and not reproduced. Until then the excerpt supports "the loop found seven improvements that transferred" and not "self-improvement counters diminishing returns."
Inquiring lines that read this note 6
This note is a source for these research framings, grouped by the broader line of inquiry each explores. Scan the bold lines of inquiry; follow any specific question forward.
Why does self-revision fail to improve and instead amplify confidence? How can evaluation criteria remain robust against agent gaming? Can AI systems safely improve themselves recursively?- How many acceptable rewrites can recursive self-improvement sustain before returns diminish?
- How would a parametric self-improvement loop differ from a non-parametric one?
- How does this scoped definition relate to the survey's open-ended recursive self-improvement?
- How do hidden evaluations and out-of-distribution benchmarks address recursive self-improvement risks?
Related concepts in this collection 4
This note in its neighbourhood — explore the map, then jump to a related concept in the list below.
Click a node to walk · click center to open · click Open in graph to see this note in the full knowledge graph
-
Can recursive self-improvement speed up the research process itself?
Current AI research agents improve the artifacts they produce—faster training, cheaper inference—but not the pace of discovery itself. Can automating an agent's own code creation close that gap?
the premise the count is asked to support
-
Can an AI agent reliably improve itself through hidden evaluation?
AIDE2 rewrites its own code and selects improvements based on hidden evaluations. But what are these evaluations hidden from, and does the partition actually prevent gaming or circularity?
the run whose curve is missing
-
Why do fixed benchmarks fail as agents grow stronger?
Fixed evaluation criteria become vulnerable to gaming once optimizers improve enough. Explores whether static rewards are fundamentally unsuitable for self-improving systems and what breaks first.
the mechanism by which a fixed selection suite would lose signal over a longer run
-
Do self-improving agents really split into two distinct loops?
Explores whether modern self-improving agents can be understood through a clean abstraction separating fast scaffold updates from slow model weight updates, and whether this framework actually explains the field's recent progress.
the fast loop this run sits in; the survey's bounds on open-ended loops are the claim a longer run would test
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loops
- Mind the Gap: Examining the Self-Improvement Capabilities of Large Language Models
- Recursive self-improvement of AI research agents
- RRSI: Regularized Recursive Self-Improvement of Agent Harnesses
- Toward Self-Improvement of LLMs via Imagination, Searching, and Criticizing
- PAST-Bench: Benchmarking the Foundations of Recursive Self-Improvement in Personal Agents
- Dream-RSI: Recursive Self-Improvement through Evolving Worlds
- Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents
Original note title
does recursive self-improvement keep paying after seven rewrites or do returns diminish inside the loop — the excerpt reports seven accepted rewrites in an 8-day run and neither their sizes nor their spacing