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 abstract states the system in one sentence: AIDE2 "proposes changes to its own code, benchmarks modified versions of itself on a suite of AI R&D tasks, and keeps the changes that perform best on hidden evaluations." It is the implementation of the loop defined in How does an AI agent improve its own research code?, applied to "a frontier AI research agent."
The result reported for it: "In an autonomous 8-day run, AIDE2 discovered seven successive improvements." The discussion adds that the loop "accepted seven rewrites, each under a fixed evaluation budget." Successive matters, since each accepted rewrite becomes the agent the next round edits, so the seven are a chain and not seven independent candidates.
The selection rule is where the vault's interest sits. Keeping what scores best on evaluations the agent is not scored on in the open is the "partition nothing that proposes changes can see" in Can deterministic checks protect LLM judges from failure?. It is also an external anchor in the sense of Can models reliably improve themselves without external feedback?: the loop rewrites the agent, and the scoring stays outside it. My reading, not the paper's: the excerpt says "hidden" and does not say hidden from the proposing agent, so the fit to the guardrail move is a reading (What exactly does hidden mean in AIDE2's evaluation system?).
Two things the excerpt leaves out. It says "keeps the changes that perform best", which does not say whether variants that lost are retained as stepping stones the way the Darwin Gödel Machine's archive does (Can AI systems improve themselves through trial and error?). And "a suite of AI R&D tasks" is not enumerated, so what the selection was tuned against is not visible.
Inquiring lines that read this note 17
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.
Do AI capability benchmarks accurately measure reasoning ability or just surface patterns? How can we verify agent claims against their actual capabilities and actions?- Did AIDE2's rewrites solve problems on a human checklist or search artifacts?
- What validates whether a rewritten agent is actually better?
- Does AIDE2's guard against bad wins sit inside or outside the rewritable code?
- How did AIDE2 guard against untrustworthy wins in its own loop?
- What are AIDE2's hidden evaluations hidden from, and what makes a win untrustworthy?
- What makes a win untrustworthy in hidden evaluation environments?
- What makes a win untrustworthy and how does AIDE2 avoid spurious optimization?
- What three distinct types of untrustworthy wins does AIDE2 need to prevent?
- What distinguishes genuine task improvement from evaluator exploitation?
- Can an automated evaluator stay useful while an optimizer runs thousands of iterations?
Related concepts in this collection 5
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
-
How does an AI agent improve its own research code?
Explores the feedback loop where an AI research agent modifies and tests its own codebase, with each successful change becoming the agent that proposes the next revision. This specificity matters because it distinguishes a narrow, defined mechanism from broader claims about open-ended self-improvement.
the loop this system implements
-
Can deterministic checks protect LLM judges from failure?
Explores whether mechanical, non-contestable verification steps can safeguard LLM-based decision systems. Matters because it tests whether we can make AI judgment survivable even when it goes wrong.
hidden evaluations as a selection filter, the third move
-
Can models reliably improve themselves without external feedback?
Explores whether self-improvement alone can sustain progress or if structural limits—like the generation-verification gap and diversity collapse—require external anchoring to work reliably.
the external anchor that lets a self-editing loop avoid circularity
-
Can AI systems improve themselves through trial and error?
Explores whether replacing formal proof requirements with empirical benchmark testing enables AI systems to successfully modify and improve their own code iteratively, and what mechanisms prevent compounding failures.
the same try-validate-keep recipe with an archive; the excerpt does not say whether AIDE2 has one
-
What problems did AIDE2's rewrites actually solve?
AIDE2 autonomously improved its own code over eight days. Did the seven accepted changes target real practitioner challenges in building agentic systems, or did they reflect artifacts of the system's own optimization process?
what the seven rewrites were
Related papers in this collection 8
Papers most semantically related to this note, ranked by cosine similarity in the embedding space.
- Recursive self-improvement of AI research agents
- The Red Queen Gödel Machine: Co-Evolving Agents and Their Evaluators
- Hyperagents
- Darwin Godel Machine: Open-Ended Evolution of Self-Improving Agents
- Self-Improvements in Modern Agentic Systems: A Survey
- PAST-Bench: Benchmarking the Foundations of Recursive Self-Improvement in Personal Agents
- LLM-as-a-Judge Is Not an Oracle: Why Self-Improving Agents Need Deterministic Guardrails
- Dream-RSI: Recursive Self-Improvement through Evolving Worlds
Original note title
AIDE2 proposes changes to its own code, benchmarks the modified versions on AI R&D tasks and keeps the ones that perform best on hidden evaluations — seven successive improvements in an autonomous 8-day run