- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
SNaP gives a narration-conditioned VLA two fast-weight memory banks for each episode. One stores token associations from the policy's own subtask descriptions, and the other stores proprioceptive history. Learned queries read a fixed number of context tokens for both the next narration and action prediction. The banks use normalized delta updates; the backbone and address networks stay fixed during deployment. Evaluation covers three real-robot tasks: hidden object locations, visual cue counting, and a two-drink recipe. Average success is 90.0%, compared with 66.7% for MemER. The authors also remove earlier events from the context to test their effect on later subtask predictions.
Critical strengths
The large gap on Cued Bean Scooping is convincing: 28/30 successes for SNaP against 40.0% for MemER and 50.0% for past-sentence conditioning. Here the policy has to remember the earlier cue and count completed transfers, so recalling an object location alone is not enough. On Two-Drink Recipe, 23/30 successes gives some evidence that the benefit extends to a longer sequence with repeated operations. All methods use the same demonstrations, making these comparisons easier to interpret.
I found the interventions in Figure 5 and Appendix D more informative about context use than success rates alone. Removing a blink or a completed scoop changes the predicted count in the expected direction, with the current observation and policy kept fixed. These are small experiments. The authors report subtask-prediction accuracy here and clearly distinguish it from closed-loop task success.
Critical weaknesses
I am less convinced that the experiments identify the benefit of self-narration itself. Every Table 1 variant has the narration bank; there is no comparison with a similarly sized fast-weight memory over sensory or visual features alone. The nonlinear address network gives very large gains, but it also adds capacity, as the authors acknowledge. Past-sentence conditioning is a relevant baseline, though I could not judge the comparison without more detail on its retained history length and training configuration. Since the claimed contribution is how history is represented, I would want a matched control that already gives the policy access to history.
Appendix B.1 leaves me with a further concern about training. Second-stage writes use argmax predictions under teacher forcing, and the action branch still receives annotated current narration. B.3 also reconstructs preceding narration context from annotations. At deployment, autoregressive narrations both build the memory and condition actions. This is a substantial mismatch, with no measurement of its practical effect. The 0.9 confidence gate may help, but the paper has no stage-2 or gate ablation and no analysis of errors committed to narration memory. Even with the encouraging robot results, it is unclear how much the recursive memory depends on the constrained task vocabulary and histories. I recommend weak reject because this issue and the missing memory control leave the main contribution insufficiently established.
Questions for authors
-
How does a capacity-matched fast-weight policy without historical narration perform on the counting tasks? Could you also compare retaining only the latest narration with retaining the accumulated narration bank?
-
Please specify what history the past-sentence baseline retains and how it is truncated. Does it receive comparable narration supervision and sequence training?
-
How much does the second training stage improve performance? During actual rollouts, how often does the confidence gate reject a correct narration or commit an incorrect one?
As the discussion period is closing soon and no response from the author, I will keep my rating.