- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
To improve the generalization of Vision-Language-Action models to unseen tasks and environments, the paper proposes Reflective VLA, which explicitly incorporates historical observations, actions, and their consequences into the context. Specifically, the model uses previous observation–action–consequence tuples as in-context information, allowing it to reason not only about the current state but also about how previous actions affected the environment. Experiments show that this simple reflective context substantially improves VLA generalization across unseen tasks and environments.
Critical strengths
The main strength of the work lies in its use of observation–action–consequence tuples as in-context information for VLA models. Through controlled ablations and evaluations under distribution shifts, the authors provide empirical evidence that incorporating action consequences, beyond simply adding observation history, can improve generalization to unseen environments and configurations.
Critical weaknesses
- W1. Additional computational cost. The method requires processing multiple historical observation–action–consequence tuples, increasing the context length and consequently the computational and inference costs.
- W2. Limited analysis of the core mechanism. The proposed idea is relatively simple, and the paper could provide stronger evidence that the gains are specifically attributable to action consequences, rather than merely to additional temporal context.
Questions for authors
- Q1. Can the authors provide additional analysis or qualitative case studies to clarify why action consequences improve generalization, and whether the gains are specifically attributable to action consequences rather than simply to additional temporal context?
- Q2. Could the authors report the training time, GPU memory usage, and inference latency for different history lengths K, particularly relative to the shortest-context setting? This would clarify the computational trade-off introduced by longer reflective contexts.
- Q3. How sensitive is Reflective VLA to the quality of the observed action consequences? It would be useful to evaluate its robustness under noisy, ambiguous, or inaccurate consequence observations.
3 comments
Reply to Authors
Thank you for the clear and comprehensive response, which has addressed my concerns. I will keep my current rating.
Thank you for your follow-up and positive assessment. We are glad that our response addressed your concerns, and we appreciate your thoughtful review and constructive feedback.
Response to Reviewer rN2C
We thank the reviewer for the positive assessment and the precise questions.
Q1. Computational cost for different K.
Thank you for the suggestion. The cost for each K is:
Inference on one RTX 4090; training on H20 GPUs.
Inference. The overhead is small. Past triplets are KV-cached, so an 8× longer context costs 1.43× the latency and 0.38 GB more memory, and K=4 recovers most of the accuracy gain (76.7% vs. 77.8%) at 1.19×. Inference runs once per action chunk, not once per control step, so the extra 54 ms at K=8 is small relative to the chunk duration (one second on the real robot).
Training. All K frames of a sample are processed jointly, so we reduce the batch size per GPU as K grows and keep the number of supervised action targets per step constant (batch × K = 32). Even so, from K=1 to K=8 the total training time rises from 24 to 46 hours (1.9×) and the memory per GPU from 45 to 79 GB (1.8×). Memory is what limits us to K=8.
Q2. Are the gains due to action consequences or to more temporal context?
Attribution. Table 3a in the main paper compares contexts with the same length K that differ only in content:
Additional temporal context alone gives no gain: observation-only history stays at the reactive level on every split. The gain appears only when each executed action is paired with its observed consequence.
Why consequences help. The evaluated shifts change how commands map to observed motion, which a single frame does not reveal. Under robot calibration shift, for example, every command is offset by a hidden bias. A completed triplet exposes this bias as the difference between the commanded pose in A and the reached pose in O′, and the policy can then correct its subsequent commands. Observation-only history shows that the scene changed but not which command caused the change, so it cannot provide this evidence. This is consistent with (O,O′) staying at 55.1 on Rob. Calib† while the paired triplet reaches 61.3.
Q3. Sensitivity to the quality of consequence observations.
Noisy consequences. We add random LIBERO-Plus sensor noise (blur and fog) on top of a deployment shift (camera). The noise degrades all observations of the episode, including the consequence frames in the context:
Both policies lose the same 1.4 points, so Reflective VLA keeps its 5.7-point advantage.
Ambiguous or inaccurate consequences. These can mislead the policy, as our Conclusion notes. A simple safeguard is to discard triplets whose consequences are known to be unreliable; with an empty context, the same model runs at the reactive level (73.1%, Table 3b in the main paper). Detecting such consequences automatically is future work.
We thank the reviewer again for the constructive feedback.