AdaRSI: On-Demand Recursive Self-Improvement for Embodied Agents

You already need task-specific training and want to reduce its memory or compute cost.

What you would change

Change only the training technique on a small controlled run after checking prerequisites.

Change only the training technique on a small controlled run after checking prerequisites.

Compare against

Your current training recipe with the same model, data split, and evaluation.

1. Locate the paper's implementation and check its license, model support, data needs, and hardware requirements. Stop here if you cannot obtain the required artifacts.
2. Save a small set of representative product tasks and expected outcomes. Keep evaluation tasks out of any training or tuning, and choose quality and cost limits before running.
3. Run the baseline and the proposed change on identical inputs. Keep other settings fixed and repeat paired runs to expose variation.
4. Save per-task outputs, failures, timings, and all usage costs. Review regressions before expanding the test.

What to measure

Held-out quality, peak memory, training time, and full compute cost to the target quality.

When to keep it

Keep the change only if it meets your preselected quality and latency limits and improves the metric you care about after setup and operating costs. Otherwise retain the baseline. This is an exploration plan, not a validated recommendation.

recommendation

watch

research area

efficient training

technical change

On-demand recursive self-improvement for embodied VLAs

published

2026-10-14

The method is specific to embodied VLA agents in simulation and requires executor fine-tuning plus a full retry-and-attribute harness, so it is relevant to the reader only if they operate robot-learning workloads; otherwise it is a useful design pattern (selective fine-tuning after failure attribution) worth tracking rather than adopting.

1. claim 01Paperraft inference
   Read the brief interpretation

   AdaRSI replaces indiscriminate fine-tuning of every failing sub-step (or harness-only refinement of a frozen executor) with a failure-attribution loop: a coding agent retries failing sub-steps from saved states, distinguishes harness errors from capability gaps, and fine-tunes only the sub-steps that remain unreliable using self-collected demonstrations. The cost is substantial supporting infrastructure: a checkpointable simulator environment, a coding agent to manage the loop, state saving and replay, and repeated fine-tuning runs of a VLA executor, which is feasible on a single GPU only for modest models. Failure modes include misattribution of harness versus capability errors, low absolute success (13.8% on unseen composites) that limits production readiness, distribution shift from self-collected demonstrations, and dependence on a resettable simulation that most real-world deployments lack.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source
2. claim 02Paperraft inference

   On RoboCasa365 with GR00T N1.5 and no human demonstrations, AdaRSI raises success on unseen composite tasks from 4.6% to 13.8% (about 3x), while using 28% of the GPU time and 22% of the demonstrations required by fine-tuning every sub-step.

   This is a Paperraft inference. It is not pinned to a verified PDF passage.

   Inspect the source