Toward Recursive Self-Improvement in Physical AI
Organizations: National University of Singapore · Huazhong University of Science and Technology · Shanghai Jiao Tong University · Nanyang Technological University ·
Abstract
Recursive self-improvement (RSI) describes a system that improves not only its behavior but also the process by which it improves. Recent digital agents test this idea by rewriting their own code and checking each version with executable tests. Bringing these mechanisms into the physical world requires learning from partial observations through costly trials, while accounting for changing operating conditions and potentially irreversible consequences. We position RSI within robot learning and trace pathways from improving robot capabilities to improving the processes that generate them. We examine how physical experience can strengthen these improvement mechanisms and when the resulting gains can support further self-improvement of the mechanisms themselves. Gains carry forward only when feedback addresses remaining learning needs, the receiving component can use the change, its value survives changes in tasks or hardware, and continued practice remains safe and affordable. Existing studies, concentrated in manipulation, support behavioral improvement, benefits to later learning, and procedure improvement. Some systems also change the improver's knowledge or tools, but the physical studies reviewed here have yet to isolate gains attributable to recursion. We synthesize these findings into evaluation principles and research directions for machines that, trial by trial, safely improve the way they improve.
Figures & tables
| System | What changes | Simulation / offline | Hardware | Claim / status |
| Improving policies, world models, and knowledge (Section 3.1 ) | ||||
| D-World Wen and Wang , 2026 | Digital twin revised by a frozen LLM; residual-gated | – | Dual-arm one revision: depth residual 22.4 1.5 mm | Model accuracy |
| MobiAgent Liu et al. , 2026a | Skills from verified rollouts | RoboCasa 7.5% 27.5% | Astribot S1 32.5% 57.5% | Behavioral |
| Embodied Turing Machines Hu et al. , 2026b | Stateful decision code | RoboDojo, 42 bimanual tasks 70.24% | – | Behavioral |
| RoboRSI Wen et al. , 2026 | Branch-local patches after review, tests, replay | Four benchmarks +2.7 to 11.0 points over a fixed agent, adapting online on 3 of 4 | WheelSingleArm M1 104 case-study runs | Behavioral |
Appendix figures & tables5 assets
Supplementary material from the paper’s appendix.
Appendix
| Domain | Representative comparison | IF | U | DS | CP | Scope of support |
| Manipulation | FIERCE: refreshed vs frozen evaluator; DexTouch-WM: all-real vs half-generated data ( Tan et al., 2026b ; Qin et al., 2026 ) | Component and downstream tests on selected hardware tasks | ||||
| Navigation | AllDayNav: tests across rooms, episodes, and tasks ( Yin et al., 2026a ) | Cross-room/episode/task tests of memory and policy | ||||
| Locomotion | Intelligent Trial and Error: behavior search after damage ( Cully et al., 2015 ) | Real damaged-robot adaptation; a precomputed repertoire | ||||
| Flight | Agile quadrotor flight: residual-model learning and in-flight policy updates ( Ren et al., 2026 ) | Short-horizon adaptation on one quadrotor platform | ||||
| Robotic labs | Mobile chemist: measured outcomes guide the next experiment ( Burger et al., 2020 ) | Experiment-selection precedent; a supplied search algorithm | ||||
| System | Reported comparison | Setting and interpretation |
|---|---|---|
| SOAR Zhou et al. , 2025c | Mean success 28% 57%; released dataset about 30.5K trajectories | Ten evaluation scenes across five tabletop settings. The updated arXiv text (its Section 4 and Figure 5; the dataset size also appears in its abstract and Appendix E) reports these values. The PMLR landing-page abstract instead states 25K trajectories. |
| SI-EFM Ghasemipour et al. , 2025 | LanguageTable approximately 62–63% 87–88%; BananaTable approximately 63% 85% | Approximate plotted rates in the real-robot experiments. BananaTable practice uses about eight hours on two robot stations. The learned feedback checkpoint stays fixed during policy improvement. |
| HIL-SERL Luo et al. , 2025 | RAM insertion: 100% versus 29% for HG-DAgger; cycle time 4.8 versus 8.3 seconds | 100 trials per condition. Matched imitation comparison in the main results table. Intervention, reward classification, and compliant control jointly define the learning system. |
| RECAP Physical Intelligence et al. , 2026 | More than throughput on diverse laundry and espresso; roughly half the failure rate | Relative to supervised specialization of the same pretrained policy. |
| RAPolicy Yang et al. , 2026a | Joint-task success 52% 88% | One joint five-task setting, alongside four single-task settings. Online training uses one to two hours per setting and includes human interventions. |
| Term | Meaning | Section |
|---|---|---|
| Action chunk | A short sequence of future actions that a policy outputs at once. | 2.1 |
| Admission gate | A rule that turns protected evidence into a decision on whether a candidate update may run. | 4.3.3 |
| Attempt, retry, round | An attempt is one try at a task; a retry is a further attempt on the same task instance within one episode; a learning round ends with an update from which later episodes start. | 2.2 |
| Behavioral improvement | The revised system executes better under a common task test. | 2.2 |
| Bottleneck | The component hypothesized to limit the next improvement, given the available repairs. | 4.4 |
Recursive Self-Improvement
Recursive self-improvement studies AI systems that use feedback from their own work to modify and evaluate future versions.
See all 81 papers