Research

Dream-RSI: Recursive Self-Improvement through Evolving Worlds

Use past discovery trees as a replay environment for improving exploration policies cheaply.

Tong Zheng, Xidong Wu, Zheng Zhang, Zhankui He, Chaoyi Zhang, Benjamin Coleman, Ruoqiao Wei, Di Bai, Haolin Liu, Rui Liu, Xue Wang, Yue Zhuan, Wang-Cheng Kang, Renkai Xiang, Heng Huang, Xinwu Cheng, Yunsong GuoSep 14, 2026arXiv preprint13 min readUniversity of Maryland; Google DeepMind; University of Virginia
IMPORTANTAI AgentsAdvanced

Key takeaway

Dream-RSI alternates online exploration, replay construction and offline policy improvement; it reports lower discovery cost across several domains.

Updated on Sep 23, 2026

01

Abstract

Dream-RSI turns completed discovery trajectories into a replayable simulator. Alternative exploration policies can be evaluated offline against recorded histories before selected policies are redeployed for new online discovery.

02

Introduction

Long-horizon scientific discovery requires repeated proposal and evaluation cycles. The central challenge is improving exploration without paying the full cost of repeatedly executing expensive discovery trajectories.

03

Problem

Fixed exploration policies cannot adapt efficiently, while online meta-policy optimization is expensive because candidate policies require long rollouts before meaningful feedback becomes available.

04

Background

The approach connects agentic scientific discovery with model-based reinforcement learning, replay-based evaluation, recursive self-improvement, and exploration-policy optimization.

05

Methodology

Online exploration creates a discovery tree. Completed branches become replayable history. Alternative policies are evaluated offline, a promising policy is selected, and the updated policy is deployed online.

Figure 1

Formula notes

Mathematical details

Parallel exploration action set

Equation
A(T;W)={C⊆A(T):∣C∣≤W}A(\mathcal{T};W)=\{C\subseteq A(\mathcal{T}):|C|\leq W\}

An exploration action is a batch of eligible nodes expanded in parallel.

C
-batch
T
-discovery tree
W
-workers
A(T)
-eligible nodes

Pareto reward

Equation
pareto.reward=pareto.auc−λ⋅parallel_penalty\text{pareto.reward}=\text{pareto.auc}-\lambda\cdot\text{parallel\_penalty}

Replay policy quality balances attainment and efficient probing.

lambda
-penalty weight
pareto.auc
-area under attainment curve
parallel_penalty
-effective sequential rounds / total probes

06

Architecture

The architecture contains a fixed discovery agent, an exploration-policy layer, a discovery tree containing states and artifacts, and a replay pool used for offline controller evaluation.

07

Dataset

Experiments cover eight scientific discovery tasks spanning algorithm engineering, mathematical optimization, and GPU kernel engineering.

08

Training

The improvement target is the exploration policy rather than the underlying foundation model. Offline replay is used to evaluate policy changes cheaply before online deployment.

09

Experiments

Evidence highlights

  • 01Trajectory infrastructure
  • 02Offline optimization
  • 03Online final gate
  • 04Provenance

10

Baselines

The principal comparisons are fixed exploration and SimpleTES, with reported comparisons including up to 162x fewer calls than SimpleTES and more than 50x budget savings on several optimization tasks.

11

Results

Reported experiments show substantial reductions in exploration calls and budget in several tasks, with gains ranging from fewer generations to improved GPU-kernel performance depending on the comparison.

12

Ablation

The key factors are replay coverage, policy selection, online validation, and the quality of recorded trajectories; the stored material does not provide a complete component-by-component ablation.

13

Limitations

Replay can only evaluate behavior represented in historical trajectories. Stale histories, coverage gaps, controller overfitting, and offline-to-online disagreement can produce misleading improvements.

14

Conclusion

Dream-RSI provides a practical route to recursive improvement of exploration policies by converting expensive discovery history into reusable offline evaluation data. Online validation remains authoritative.

15

References

Dream-RSI primary paper and cited work on scientific discovery agents, model-based reinforcement learning, recursive self-improvement, exploration-policy optimization, and SimpleTES.

Source trail

Primary papers, implementation pages, and external source records used to ground this explainer.

Continue reading

Related research

Browse all research
Machinoai Logo
Machinoai

Your edge in the AI era. Deep dives into machine learning concepts, paper explainers, verified industry jobs, and developer tools.

© 2026 Machinoai. All rights reserved.