- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper argues that memory-conditioned VLA policies underuse memory because they are trained on annotated context but deployed on context written by a learned predictor, therefore suffer from a distribution shift. The authors add two components: 1. Noise-matched training; during training, the ground-truth subgoal is corrupted with wrong subgoals, empty context and coordinate jitter, at rates measured on the deployed predictor. For frame memory, NMT means training under the deployment frame-selection rule. 2. Counterfactual read-out probing (CRP). It measures how much the actions change under a memory swap, and is used for checkpoint selection. Results are shown on RMBench, RoboMME, a channel-corruption study and two real-robot tasks.
Critical strengths
- NMT makes the policy robust to a corrupted or uninformative memory channel. It scores 28.8 vs. 16.9 when 75% of episodes carry a wrong subgoal, and 18.1 vs. 6.9 with a placeholder. This is the claim the evidence supports cleanly, and it matters for any system whose memory module can fail.
- The frame-layout result is a useful caution. The same weights score 42.2 under their training layout and 24.5 under another. Comparisons of frame-memory mechanisms are therefore sensitive to the frame-selection rule, not only to the memory design.
Critical weaknesses
- NMT is not shown to help at deployment, which is the paper’s central claim.
- With the deployed predictor, the clean-trained and NMT policies score the same (27.5, 44/160; Table 3). Gains appear only under synthetic corruption of the channel.
- None of the headline results isolate NMT:
- RoboMME uses frame memory, with neither the predictor nor ν. Its 42.0 equals the 42.2 the same weights reach under their own training layout.
- RMBench has no with/without-NMT comparison.
- On hardware, the clean-context policy appears only in the probe, with no success rate. The frame variant, which uses no NMT, matches the NMT variant (19/40 on ARX).
- The evidence supports robustness to a corrupted memory channel, not a closed read-out gap.
- Neither of ROBIN’s distinguishing ideas is shown to matter.
- There is no comparison of noise matched to the predictor’s error rates against generic context noise or dropout.
- There is no comparison of ρ-based checkpoint retention against success-only selection.
- Without these, ROBIN reduces to context-noise augmentation. Its robustness benefit is what the cited noise-injection and conditioning-dropout work (Laskey et al., 2017; Ho & Salimans, 2022) would lead one to expect, so the contribution beyond them is not established.
Questions for authors
- Why do the two policies “coincide by construction” with the deployed predictor (l.394–395)?
- What is the clean-trained ARX policy in Fig. 3c? Why would it ignore an always-correct context, when in Table 3 the clean-trained policy follows its context closely?
2 comments
brief check-in
Dear Reviewer,
As the discussion period draws to a close, we wanted to share a brief three-line summary of the controls run directly from your review checklist, in case a quick index is helpful alongside our full reply above:
- Deployment behaviour & clean-to-corrupted trade-off (W1, Q1; Sec. 4.3, Table 3a, App. I Fig. 11 & Table 10): We replaced "coincide by construction" with the exact paired breakdown (14:14 discordant on validation; 20.31% vs 17.81% on 320 unseen test episodes, p = 0.26; parity across three weaker predictors) and plotted the full clean-to-corrupted curve (trading 69.38% vs 86.25% noiseless ceiling for 15.00% vs 2.50% under channel failure and 18.12% vs 6.88% on placeholders).
- Matched 10k-step ablations & checkpoint selection (W3; Table 3b, App. H Tables 7–9, App. K Table 12): Under an identical 10k pipeline from the released checkpoint, NMT beats clean-context continuation (+11.88 at 100% corruption, p = 6.6e-05; +13.12 on seed 7) and context dropout (+10.62, p = 1.5e-03), both reproduced in a 2nd NMT training run; generic 15%/15% and 4× rates confirm counterfactual wrong-subgoal exposure is decisive (with empirical rates as a zero-tuning default); and validation success selects the same 25k checkpoint across all 8 candidates.
- Channel isolation & ARX clean-BC baseline (W2, Q2; Sec. 4, Table 2, Fig. 3c, App. C): Sec. 4 now opens with a table isolating each channel's intervention, and Fig. 3c / App. C clarify why clean-context ARX BC collapses to the 0.0097 CRP noise floor (vs 0.045 for ROBIN) when memory matters only in the initial 30 steps.
Please let us know if any question remains open or if we can clarify anything further before the discussion window closes. Thank you again for your sharp and helpful feedback!
Response to Reviewer wDWR
We thank Reviewer wDWR for the sharp, focused critique and for highlighting both our channel-corruption robustness and frame-layout findings. We ran every requested control under a matched 10k-step budget from the released checkpoint (all manuscript revisions are highlighted in blue).
W1 — Does NMT help at deployment? NMT prevents catastrophic collapse when the memory channel fails while maintaining statistical parity on live online predictors. As you note in your first strength, resilience to a failing memory module matters for any learned predictor. Our new paired panels establish three facts:
W2 — Which results isolate NMT. Common Response 5 (now opening Sec. 4) maps every table to its isolating comparison. On subgoals, Table 3 and four controls isolate Eq. 6 (Common Responses 1–2). On frames, Table 2's greyed row isolates training under the deployed rule on identical weights (24.5 → 42.0, 14/16 tasks up), recovering the 42.2 of the original layout at 1/8th training cost while placing 10 vs 2 of 32 frames in the last 30 steps and setting Counting SOTA (k6P1 W3). RMBench compares full systems under official protocol (best M(1) mean 83.8 vs 79.0). On ARX hardware, both ROBIN variants lift memoryless π0.5 from chance (25.0) to 47.5, while Figure 3(c) directly contrasts clean-context BC against ROBIN (0.0097 noise floor vs 0.045; Q2).
W3 and the requested ablations. Every requested ablation is now run under the same 10k budget from the released checkpoint (Table 3(b); App. H, Tables 7–9; Common Response 2): Eq. 6 is tested directly against clean-context training with an identical pipeline, which it beats by +11.88 points at 100% corruption (p = 6.6e-05) and by +13.12 on a second seed; it beats context dropout by +10.62 (p = 1.5e-03; +9.38 on the second seed), with both margins reproducing on a second NMT training run in the identical control pipeline (+8.12, p = 7.2e-03; +6.88, p = 0.035). Both fourfold continuation and generic 15%/15% wrong-subgoal noise retain the gain (14.38 against 15.62, p = 0.85), showing that counterfactual wrong-subgoal exposure—rather than exact rate matching—is the active mechanism, with empirical predictor rates providing a tuning-free default; and validation success vs CRP select the same 25k checkpoint (App. K, Table 12; dQu3 Q1). Crucially, this separates NMT from conditioning dropout (Ho & Salimans, 2022), where empty slots mark absence explicitly and leave the policy credulous to wrong subgoals, and from DART (Laskey et al., 2017), which perturbs expert actions rather than retrieved context.
Q1 — Why do the two policies "coincide by construction"? That phrasing was imprecise and is replaced in Sec. 4.3 with the paired episode breakdown (App. I, Fig. 11; Common Response 3): equal 27.50 totals, 28 of 160 episodes decided differently (14:14, p = 1.00), reflecting the dose-response crossover band rather than construction.
Q2 — What is the clean-trained ARX policy in Fig. 3c, and why does it ignore context unlike Table 3's clean policy? It is π0.5 fine-tuned on the ARX demonstrations with annotated subgoals in its prompt, without NMT (now stated in Figure 3's caption). The difference stems from data incentives: on RoboMME, the current view never identifies the target, forcing BC to read the subgoal (86.25 clean vs 2.50 wrong). On ARX demonstrations, memory matters only in a brief initial window (removing the prefix raises ROBIN's action error by 38.6% over steps 1–30 vs 2.7% full-episode; App. C), giving standard BC negligible gradient on the memory slot—so swapping memory moves its actions by just 0.0097 (noise floor) vs 0.045 for ROBIN.