cs.ROOct 2, 2026

Does a Learned Corrector Beat a Simple Retreat? Evidence from a Frozen VLA

Authors: Chenchao Sheng, Zhuang Jiang, Liuhaichen Yang, Ningwei Bai, Zezhi Tang

Organizations: University College London (UCL), London, United Kingdom

Read PDF
Ask AI
Cite

Copy citation

DOINot available for this paper

Abstract

Before deploying runtime recovery for a frozen vision-language-action (VLA) policy, one must establish that an intervention improves success beyond ordinary run-to-run variation and that its complexity adds value over a simple action. We evaluate these questions on frozen π0.5π_{0.5} across four RoboTwin tasks. For each test seed, we pair rollouts with and without correction and include a same-seed base-policy re-run as a placebo. Seed-cluster intervals and prespecified comparison rules assess net gains against stochastic outcome changes. Across 3,888 paired episodes, the full pipeline raises success on beat_allowbreak block_allowbreak hammer by +13.5+13.5,pp (95% interval [+9.4,+17.7][+9.4,+17.7]), with no detectable gain on the other three tasks at the deployed weight. Among failed base episodes on the responsive task, 43.2%43.2\% succeed on a plain re-run, compared with 63.5%63.5\% after correction; many nominal rescues therefore reflect the base policy's own variability. A fixed-time trigger and scripted return to an earlier joint configuration produce a net gain with no detected difference from the learned pipeline across two rounds, although our prespecified equivalence criterion is not met consistently. Pausing and a constant-action control do not yield comparable gains. On this benchmark, the decision to intervene depends strongly on the task, and a paired placebo plus a simple retreat baseline are needed to establish what learned correction contributes.

Figures & tables

Figure 1: The pipeline under test and the protocol that measures it. Left: the frozen policy, the stall monitor and the distilled corrector run at deployment; the privileged teacher and the counterfactual admission step run only on training seeds, where 87 of 175 candidate rescues are kept. Right, bbh: 63.5% of failed base episodes succeed under the intervention against a placebo of 43.2%, leaving +20.4+20.4 pp; below that, net effects for three conditions with 95% intervals, then the drift-cancelling difference between retreat and corrector, whose 90% interval (not drawn) leaves the ±5\pm 5 pp band (Section 3.3 ). Bottom: one bbh test seed, the same alarm at step 149, under the scripted retreat and under the corrector; four frames each, in order and not to scale.
Tasknnbb (%)Net (pp) [95% CI]ppρ/ρ0\rho/\rho_{0} (%)β/β0\beta/\beta_{0} (%)Placebo-corr. rescue / breakage
bbh (beat_block_hammer)97254.013.5 [9.4, 17.7]<10−4<10^{-4}63.5 / 43.229.1 / 36.820.4 [14.1, 26.2] / −- 7.6 [ −- 12.9, −- 2.5]
qr (rotate_qrcode)97260.80.6 [ −- 2.9, 4.2]0.7740.7 / 43.325.2 / 27.9−- 2.6 [ −- 8.8, 3.4] / −- 2.7 [ −- 7.2, 1.7]
a2b (place_a2b_left)97238.32.3 [ −- 1.0, 5.6]0.1822.5 / 20.830.4 / 33.61.7 [ −- 2.1, 5.6] / −- 3.2 [ −- 8.9, 2.2]
a2br (place_a2b_right)97234.0−- 0.8 [ −- 4.3, 2.5]0.6821.5 / 21.544.2 / 41.80.0 [ −- 4.2, 3.9] / 2.4 [ −- 3.7, 8.3]
pooled3,88846.83.9 [2.1, 5.7]2.3×10−52.3\times 10^{-5}34.4 / 30.030.9 / 34.2—
pooled without bbh2,91644.30.7 [ −- 1.4, 2.7]0.5126.4 / 26.431.6 / 33.1—
Table 1: Main table. Four RoboTwin tasks, 972 paired episodes each (324 seeds ×\times 3 repeats). bb : base success. Net: intervention minus base success (pp), with a 95% seed-cluster bootstrap interval and McNemar pp . ρ/ρ0\rho/\rho_{0} and β/β0\beta/\beta_{0} : rescue and breakage rates with their same-seed placebo. Placebo-corrected rescue =ρ−ρ0=\rho-\rho_{0} , breakage =β−β0=\beta-\beta_{0} .
Figure 2: The deployed corrector, and the ladder on bbh. Filled markers exclude zero throughout. (a) Net change in success rate per task and pooled, with each task’s base rate bb . (b) Placebo-corrected rescue and breakage. The upper line of each pair, marked ρ\rho , is ρ−ρ0\rho-\rho_{0} ; the lower, marked β\beta , is β−β0\beta-\beta_{0} . The two rates have different denominators and do not add. The privileged-planner row is blank here because that condition has no same-seed placebo, and it carries no interval in (c) because its per-episode pairs were not saved. (c) The ladder: six interventions sharing one trigger threshold, with 95% seed-cluster bootstrap intervals where available. The three retreat and pipeline rows run on 972 pairs, the rest on 324.
Figure 3: Replication round: four conditions on bbh, 972 pairs each, on one GPU in one time window. (a) Net change in success rate, with each arm’s base rate bb ; filled markers exclude zero at 95%. (b) Pairwise differences, five within the round (90% intervals, upper group) and three between rounds (95%, lower group), against a shaded ±5\pm 5 pp margin; pale red marks “no difference detected”, and the one dark marker is the pair of scripted conditions, the only comparison here that is equivalent. Every one of the eight contains zero, and the between-round net effects differ by at most 1.5 pp.
Ablationbbhqra2bpooledVerdict
Admission: all 175 vs admitted 87−- 1.1 [ −- 6.0, 3.9]0.5 [ −- 3.9, 4.8]−- 2.5 [ −- 6.6, 1.5]−- 1.0 [ −- 3.6, 1.5]equivalent
Admission: random 87 (draw a) vs admitted 87−- 4.2 [ −- 9.3, 0.9]−- 0.6 [ −- 4.9, 3.7]−- 2.8 [ −- 6.8, 1.2]−- 2.5 [ −- 5.1, 0.1]equivalent
Admission: random 87 (draw b) vs admitted 870.3 [ −- 4.3, 4.9]−- 0.6 [ −- 5.1, 3.9]−- 5.1 [ −- 9.0, −- 1.2]−- 1.8 [ −- 4.3, 0.7]equivalent
Trigger: timer vs monitor−- 2.0 [ −- 6.8, 2.9]0.3 [ −- 3.9, 4.5]−- 4.8 [ −- 8.5, −- 1.2]−- 2.2 [ −- 4.6, 0.3]equivalent
Teacher: rung 1 only (60 rescues)−- 4.3 [ −- 9.6, 0.9]−- 2.8 [ −- 7.1, 1.5]0.0 [ −- 4.0, 4.0]−- 2.4 [ −- 5.0, 0.3]equivalent
Hand-back depth: 20 steps vs 40−- 5.4 [ −- 10.6, −- 0.2]4.0 [ −- 0.2, 8.2]−- 3.1 [ −- 7.1, 0.8]−- 1.5 [ −- 4.1, 1.1]equivalent
Table 2: Component ablations. 648 paired episodes per task; control is a three-task corrector trained on the 87 admitted rescues (40-step hand-back). Entries are variant minus control in intervention success, with 95% intervals. Equivalence was preregistered for the pooled effect only; per-task columns carry no equivalence verdict. Verdict column: equivalent = 90% pooled interval inside ±5\pm 5 pp; worse = 95% pooled interval excludes zero and is negative.
Figure 4: Rescue–breakage plane. Circles: the deployed corrector, 972 pairs per task. Squares: the scripted retreat, 972 pairs on bbh (monitor + retreat) and 324 on the others (retreat). Open grey diamonds: the same-seed base re-run, the placebo; arrows run from each placebo to its corrector. The single dark marker is the privileged planner online, bbh only, 324 pairs and no placebo. Dotted: the break-even lines ρ/β=b/(1−b)\rho/\beta=b/(1-b) , one per task, each labelled with its task and that task’s base rate bb from the corrector arm. Only bbh sits well above its line under both interventions.
Figure 5: Component ablations: each variant minus the three-task control, 648 pairs per task. Left: per task, shaded by how much worse the variant is, so an unshaded cell is an improvement; boxed where the 95% interval excludes zero, and the intervals themselves are in Table 2 . Right: pooled, filled where the interval excludes zero; bars are 95% intervals. The shaded band is ±5\pm 5 pp: all eight pooled estimates fall inside it and two are graded worse. Equivalence verdicts use 90% intervals, which are not drawn (Section 3.3 ).
Figure 6: Sensitivity of the bbh effect to input noise and output delay, 972 pairs per condition. Top: net gain at four noise levels on the joint angles the corrector reads and at a four-step delay on its output; the leftmost point, at zero noise, is the clean reference. The noise ticks are not to scale. Bottom: the endpoint difference between each condition and the clean one, with 95% intervals, not the gaps between the points above, which are differences of net effects; the grey marker at zero noise is the clean condition against itself. All five contain zero, and the largest noise level has a bound at exactly zero. Two of the five exclude zero on their 90% intervals, which are not drawn. Read as differences of net effects, the same five span +0.3+0.3 to −5.3-5.3 pp (Section 3.3 ).
More in this topic

Robot Failure Recovery

Robot failure recovery studies how robots detect, diagnose, and respond to errors, damage, and unexpected physical interactions.

See all 73 papers

Explore similar work

CardsList
Oct 23, 2026

If at First You Don't Succeed, Backtrack: Lightweight Recovery for Frozen VLAs

Vision-Language-Action (VLA) models perform well on robotic manipulation, yet remain brittle once their own actions carry them into states their training data barely covers. Recovering from such failures usually requires recovery demonstrations, policy retraining, or a separate model at inference time. We introduce Backtrack, a lightweight failure detection and recovery mechanism for frozen VLAs that needs none of these. A small failure prediction head, trained only on outcome-labeled rollouts of the frozen policy, reads the VLA's existing internal representations to estimate whether the current episode will fail. When the predicted failure probability exceeds a threshold, a controller pauses the policy, retraces the arm's recently achieved motion, and hands control back to the unchanged policy so it can retry from an earlier configuration. The head adds only 0.48-0.88% to the policy's parameter count. We evaluate Backtrack on LIBERO with three VLAs spanning two action-generation families: SmolVLA and ππ0.5, which use flow-matching action experts, and the autoregressive ππ0-FAST. On LIBERO-Long, the suite of long-horizon multi-step tasks and the one on which all three policies fail most often, Backtrack reduces each policy's failure rate by 19-48%, raising success by up to 7.4 percentage points; on the three shorter suites, where control success is already 85-99%, its effect is smaller. On MetaWorld, all twelve controller configurations tested with SmolVLA improve on the unassisted policy.

Thomas Landeg, Thierry Tambe

Stanford University · ETH Zurich

Vision-Language-Action ModelsRobotic Manipulation
AskPDF
Aug 5, 2026

Retrieve in Time, Correct in Frequency

Frozen vision-language-action (VLA) policies generate temporally extended action chunks, but long-horizon manipulation remains vulnerable to accumulated execution error and visual aliasing across task stages. Successful rollouts provide useful corrective evidence, yet current frame retrieval can return progress-misaligned actions,while direct replay or time-domain fusion can overwrite the reactive structure of the policy proposal. We introduce Retrieve in Time, Correct in Frequency (RTCF), a training-free test-time correction framework that improves frozen VLA performance with low model-side overhead.RTCF separates which experience to retrieve from which part of its action to transfer. Progressive Memory Alignment (PMA) causally aligns the growing visual execution history with complete successful trajectories through incrementally updated monotonic frontiers, jointly identifying a relevant memory and the current aligned memory position without stage labels. From the aligned action chunk,RTCF transfers a coefficient-wise-clipped low-frequency residual on motion channels. Higher-frequency components and gripper decisions remain inherited from the frozen policy. Across four LIBERO suites and 2,000 episodes per condition, RTCF raises aggregate success from 86.4% to 88.4% and improves LIBERO-Long from 61.6% to 68.6%.These gains require no parameter updates, repeated VLA inference, or additional GPU resources: correction can be performed on the client CPU after a single policy invocation, and the median latencies sum to only 10.99 ms per action chunk

Yuze Fan, Yue Cao, Pengjie Gao +7

Research Institute of Tsinghua University in Shenzhen · Tongji University · Everwise-Tech Co., Ltd. +2

Robotic ManipulationVision-Language-Action Models
AskPDF
Oct 17, 2026

Retrieval-triggered Action Projection Adjustment for Frozen VLA Policies: An Empirical Study and Failure Analysis

Frozen Vision-Language-Action (VLA) policies cannot incorporate previously encountered failures without updating the underlying model. We present retrieval-triggered projection correction (RTPC), an auditable external-memory wrapper for frozen OpenVLA policies that retrieves stress-collected local-depth records and applies translation-only projection correction while keeping rotation and gripper commands unchanged. RTPC is evaluated on CALVIN single-task manipulation using primary and independent replication cohorts. In the primary evaluation, RTPC reduced a depth-based near-collision or stall proxy event rate without changing task-success count. However, this reduction was not reproduced in the independent replication, and retrieved correction directions were not distinguishable from random same-family directions. Analysis identifies endpoint coupling, batch sensitivity, and the lack of a trigger-matched memory-free baseline as limitations for attributing effects to retrieval-based correction. These findings do not establish physical safety improvement or memory-specific benefits, but provide an empirical evaluation and failure analysis of retrieval-conditioned intervention for frozen VLA policies.

Jinming Wang, Ruiheng Zhang, Yong Wang +2

Department of Computer Science and Technology, Hainan Bielefeld University of Applied Sciences, Danzhou, China

Vision-Language-Action ModelsVLA Model AdaptationRobotic Manipulation
AskPDF