Paper

Recursive self-improvement of AI research agents

A two-loop self-editing agent that rewrites its own research harness, benchmarks each variant on hidden tasks, and promotes only higher-scoring agents.

arXiv ↗Sep 22, 2026

  • llm
  • ai agents
  • code optimization
  • evaluation
Nested outer/inner loop pipeline diagram explaining the method with task code
Nested outer/inner loop pipeline diagram explaining the method with task code

What it is

AIDE² lets an AI research agent rewrite and benchmark its own code, keeping only self-improvements that win on hidden evals. In an 8-day run it found seven accepted upgrades. Instead of optimizing external code only, the agent optimizes its own harness code in a two-loop setup: propose self-rewrites, grade them on hidden held-out AI R&D tasks, and keep only better agents.

Key results

  • Private grade rose from 0.703 to 0.778 in one 8-day 100-node run
  • AIDE85 matched or beat AIDEhuman on all 4 held-out benchmarks
  • Reward hacking fell to 32% from 55%, beating AIDEhuman's 39%

Shows that hidden-eval selection can drive self-rewrites that improve research-agent efficiency and transfer beyond the tasks used for selection.

One useful ML email a week.

Worth your time, not all of your time.

We track new ML work across papers, code, and data, then keep only the pieces worth a closer look. Selected, not collected.

Papers.Data.Code

The Weekly ML Signal

Selected, not collected.

One useful ML email a week: the papers, repos and datasets worth your attention.

Worth your time, not all of your time.