Learning to Compose: Recursive Self-Improvement of Shared Executable Stacks for Zero-Shot Long-Horizon Robot Manipulation
Organizations: Beijing Jiaotong University · New York University · University of Southern California · PKU-HEC joint lab for industrial intelligence, Peking University ·
Abstract
Individually competent robot skills can fail when composed: tools may lack a required capability, completion signals may misrepresent physical progress, and one skill may leave a state that violates its successor's prerequisites. We introduce Recursia, a recursive self-improvement framework that treats the shared executable stack, rather than individual task programs, as the persistent unit of improvement. The stack integrates tools, skills with execution contracts, handoffs, and verifiers. Source-side execution traces guide failure attribution and the generation of missing tools or repairs to existing shared components. Generality checks, mechanism tests, and paired selection and regression gates determine which changes become the next parent. The resulting stack is frozen and reused through declarative task adapters, allowing source-derived changes to support new compositions without target-side code repair. Experiments cover LIBERO-Pro Long simulation and a physical Franka FR3 equipped with a Franka Hand. In simulation, Recursia improves success over ASPIRE by 5.8 percentage points under Pos perturbations and 15.1 points under Task perturbations. Across three physical compositional target tasks, it improves mean success over the Skill Document Only baseline by 40 percentage points. Analyses of constituent execution, candidate rejection, and inference drivers distinguish local mechanism improvements from complete task success and characterize the cost of feedback-conditioned orchestration. These results examine shared executable interfaces as a concrete mechanism for compositional transfer in robot programming.
Figures & tables
| Task | SD-only | Recursia |
|---|---|---|
| T1: Shared basket | 0.0 | 20.0 |
| T2: Reassigned plates | 60.0 | 80.0 |
| T3: Bowl–mug dependency | 20.0 | 100.0 |
| Average | 26.7 | 66.7 |
| Entry | Failure | Repair | Recorded Result |
|---|---|---|---|
| N=10 | Lack of front/middle reference relations | Shared instance selection and relation dispatch | Dispatch ; gains measured on source tasks. |
| N=11 | Rotary localization, pinch, and arc defects | Shared turn-on/off driver | Turn-on in each panel. |
Appendix figures & tables2 assets
Supplementary material from the paper’s appendix.
Appendix
| Query | Required fields | Allowed values |
|---|---|---|
| Point localization | abstain , x , y , confidence , reason | Boolean abstention; integer pixel coordinates; confidence: low , medium , or high . |
| Mask selection | choice , reason | A candidate image label, or none . |
| Identity / mask review | verdict , reason | yes , no , or unsure . |
Robotic Manipulation
Robotic manipulation studies how robots perceive, plan, and control physical interactions to grasp, move, assemble, and use objects.
See all 1,685 papers