Dream-RSI: Recursive Self-Improvement through Evolving Worlds

Tong Zheng, Xidong Wu, Zheng Zhang, Zhankui He, Chaoyi Zhang, Benjamin Coleman, Ruoqiao Wei, Di Bai and 9 others

Google · University of Maryland, College Park · Google DeepMind · University of Virginia

Published September 14, 2026 · on the feed September 15, 2026 · ▲ 245 · arXiv 2609.14858

The abstract

Recursive self-improvement is becoming increasingly vital for autonomous AI agents, where progress hinges on discovering high-value solutions across complex domains. The driver of this process is effective exploration, however, managing and improving exploration strategies remains a major bottleneck. Current systems face a fundamental dilemma: fixed strategies fail to adapt as search spaces scale, while online policy optimization requires navigating vast meta-search spaces under delayed and expensive feedback over long-horizon rollouts. We introduce Dream-RSI, a framework for scalable and recursively self-improving exploration. A lightweight orchestration layer makes exploration explicit and programmable while leaving the underlying coding agent unchanged. Our key insight is that accumulated discovery history can serve as a replay simulator over the realized search space. By performing dreaming in the replay simulator constructed from historical discovery trees, Dream-RSI secures immediate, low-cost off-policy feedback to evaluate and refine exploration policies without invoking repetitive, expensive online evaluations. The improved policy is subsequently redeployed online to drive further discovery, continuously expanding the simulator pool in a self-improving loop. Across algorithm engineering, mathematical optimization, and GPU kernel engineering, Dream-RSI achieves competitive or improved discovery quality while substantially reducing discovery cost in several settings.

The Brief

2:42

A short podcast summary of the paper. Written and voiced by AI.

Transcript

Dream-RSI. Recursive Self-Improvement through Evolving Worlds. By Tong Zheng and sixteen others, from Google, the University of Maryland, College Park, and two other institutions. Published on the fourteenth of September. Its code repository is a placeholder: a readme, and nothing to run yet.

Recursive self-improvement is becoming increasingly vital for autonomous AI agents, whose progress hinges on discovering high-value solutions across complex domains. The driver of that process is effective exploration, and managing and improving exploration strategies remains a major bottleneck. Current systems face a fundamental dilemma. Fixed strategies fail to adapt as search spaces scale. Online policy optimization, the alternative, has to navigate vast meta-search spaces under feedback that is delayed and expensive, across long-horizon rollouts. Keep the strategy fixed and it stops fitting; try to learn it online and every lesson is slow and costly. Neither option lets exploration improve cheaply.

Dream-RSI is a framework for exploration that scales and improves itself recursively. Its key insight is that accumulated discovery history can serve as a replay simulator over the search space that has actually been realized. The searches already run are a record of what exploring that space looks like, and that record can be used again.

A lightweight orchestration layer makes exploration explicit and programmable, and it leaves the underlying coding agent unchanged. Dream-RSI then performs what it calls dreaming, inside the replay simulator constructed from historical discovery trees. Dreaming gives immediate, low-cost off-policy feedback for evaluating and refining exploration policies, without invoking repetitive, expensive online evaluations. The coding agent that does the actual work is untouched. What changes is the exploration policy that directs it.

The loop closes from there. The improved policy is redeployed online to drive further discovery. New discovery adds to the history, which expands the simulator pool, which gives the next round of dreaming more to work with.

The evaluation spans three domains: algorithm engineering, mathematical optimization, and GPU kernel engineering. Across them, Dream-RSI achieves competitive or improved discovery quality, while substantially reducing discovery cost in several settings. The claim is framed as cost as much as quality: similar or better discoveries, found more cheaply in several of the settings.

Exploration policies are expensive to test in the world and cheap to test against a record of it. Dream-RSI turns each past search into practice ground for the next one, so the history grows and the policy that explores it improves together, which is the recursive part of the name. Dreaming, here, is rehearsal on memories.

Paper Quest · 7 chapters · about 40 min

Play this paper

Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.

Chapter 1 🧩 · The problem

Search is cheap to start and expensive to steer. That is the wall.

Your coding agent searches for better solutions over thousands of propose-and-test cycles. How it spends that effort, which branches to open and when to stop, decides whether the search pays off.

The road ahead

  1. 1 · The problem ~7 min A coding agent's long search succeeds or fails on how its effort is spent, and improving that spending strategy cheaply remains a major bottleneck.
  2. 2 · What came before ~3 min
  3. 3 · The key idea ~8 min Finished searches are recorded as trees of real outcomes, so new strategies can be replayed over them for instant, cheap feedback, then redeployed to grow the record.
  4. 4 · Choose your own research ~3 min
  5. 5 · Build the method ~8 min Run real searches with the current strategy, turn their trees into replay simulators, improve the strategy by dreaming, then send it back online.
  6. 6 · The experiment ~6 min You’ll guess: Across algorithm engineering, mathematical optimization and GPU kernel engineering, what did Dream-RSI do to discovery cost?
  7. 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Join free to play the whole quest ›

Free, with Google or an email address. Your stars and progress are kept.

KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.