A research team from Google, Google DeepMind, the University of Maryland and the University of Virginia has introduced Dream-RSI, a framework that uses an AI agent’s previous discovery history to improve how it searches. The agent first explores algorithm design, mathematical optimization or GPU-kernel engineering and records its decisions and results as a tree. A separate policy-development loop then tests thousands of alternative exploration strategies against that stored tree, without rerunning the underlying experiments. The strongest strategy returns online for the next round. In the paper’s tests, Dream-RSI reached competitive or better results while reducing discovery cost, including up to 162 times fewer agent calls than SimpleTES on one algorithm task.

The technical shift happens one layer above the model. Dream-RSI leaves the coding agent unchanged and tries to improve the rules that decide where to branch, what to run in parallel and when to stop. That design turns paid-for history into a laboratory for cheaper decisions, yet it also confines imagination to paths the earlier search actually visited. A policy can avoid recorded dead ends while remaining blind to a route no one has tried. For scientific work, the evaluator and the stopping rule therefore carry as much authority as the model producing each proposal. This is early research, far from proof of unrestricted self-improvement or artificial general intelligence. The project page says full code and reproduction scripts are still being prepared. Dream-RSI turns yesterday’s search into tomorrow’s policy; the next audit is whether it can learn from a mistake the old tree never recorded.