Dream-RSI: Recursive Self-Improvement through Evolving Worlds
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.
Introduction. Recursive self-improvement (RSI) has emerged as an ambitious goal for autonomous AI systems (Liu et al., 2026c). A common mechanism underlying RSI is an iterative discovery loop wherein agents generate candidate solutions, evaluate outcomes, incorporate feedback, and refine future iterations. Such discovery loops have driven substantial progress across scientific and algorithmic domains, including algorithm design (Novikov et al., 2025; Romera-Paredes et al., 2024), open-ended mathematical optimization (Anthropic, 2026; Georgiev et al., 2025), systems design (Cao et al., 2026; Jaber and Jaber, 2026), and agent self-improvement (Lee et al., 2026; Zhang et al., 2026b,c; Zheng et al., 2026a), with these discoveries increasingly feeding into the development of more capable AI systems. As agent capabilities improve and self-improvement targets become challenging, discovery increasingly requires long-horizon exploration over vast search spaces, often spanning thousands of proposal–evaluation cycles (OpenAI, 2026; Ye et al., 2026).
Discussion / Conclusion. We presented Dream-RSI, a framework for recursive self-improvement of exploration in recursive self improvement. By converting accumulated discovery history from static context into an active, replayable simulator, Dream-RSI addresses the core bottleneck of meta-optimization: delayed and expensive feedback, which is especially severe in long-horizon discovery settings. By ‘dreaming’ within replay simulators constructed from historical discovery trees, Dream-RSI evaluates candidate exploration policies rapidly and at negligible execution cost. The improved policies are then redeployed online to drive further discovery and expand the simulator pool, closing the recursive self-improvement 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.
Lines of inquiry this paper opens 24
Research framings built by reading the notes related to this paper — the questions it feeds into.
Can brute-force automated research substitute for iterative depth and human research intuition?- How does bilevel autoresearch balance outer loop cost against discovery improvements?
- What distinguishes artifact efficiency improvements from research process efficiency improvements?
- Do gains in optimization benchmark scores translate to gains in real research efficiency?
- Does delegating planning to agents change the speed of the research process?
- Can accumulated priors and outcome analysis speed up research automation?
- How are exploration policies refined against the simulator in practice?
- Does replay fidelity hold when policies explore branches history never visited?
- How much of DarwinX's gain comes from maintaining an archive versus single-lineage search?
- Can harness updates benefit agents equally across all model sizes?
- Why does the harness layer accumulate distributed behaviors over time?
- How many acceptable rewrites can recursive self-improvement sustain before returns diminish?
- How does this scoped definition relate to the survey's open-ended recursive self-improvement?
- Can autonomous research agents outperform hand-tuned hyperparameter search?
- How does compiling natural language goals into executable code enable objective evolution?
- Can AI systems generate and refine their own objective functions?
- How would a bi-level agent restructure objective functions during discovery?
- Why do self-improving agents concentrate progress in the fast non-parametric loop?