- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies how to correct a deployed flow-matching VLA policy using demonstrations while preserving its existing capabilities. It combines an extrapolated velocity target with retained-feature gradient projection and adjusts the projection strength across correction frames. Experiments on SafeLIBERO and VLA-Arena show improved retention relative to supervised fine-tuning, with a trade-off in correction performance.
Critical strengths
The paper addresses a useful deployment problem and demonstrates meaningful retention gains across two policy architectures. For example, on SafeLIBERO, QwenGR00T retention improves from 74.9% with SFT to 85.3%, while safe success remains comparable. The method introduces no additional inference cost. The component ablations are informative: adaptive projection improves retention from 80.6% to 85.3% over fixed projection, with similar safe success.
Critical weaknesses
Critical Weaknesses
- The added value over established retention methods is not sufficiently demonstrated. The approach builds on GPM, with the main additions being the guided target and adaptive protection. The fixed-projection ablation is useful, but the paper lacks comparisons with replay, output distillation, or the parameter-merging approach already discussed in its related work. Such comparisons matter because the method accesses the original retain dataset. The adaptive mechanism is also mainly analyzed on one model and benchmark, without reported variation across training seeds.
- The exact-preservation claim in Section 3.3 and Appendix B.3 needs qualification. The basis parameterization preserves permanently masked, zero-initialized columns under a fixed mask. With sample-dependent ranks, however, other samples can update columns protected for a given sample, and existing AdamW momentum can affect updates even when the current gradient is masked. Per-sample gradient filtering therefore does not establish that the accumulated parameter change is zero in every sample’s protected subspace. This does not invalidate the empirical gains, but the claimed guarantee is too broad. Relevant references: Gradient Projection Memory; Robust Finetuning of VLA Robot Policies via Parameter Merging. Both concern approaches already discussed by the manuscript; the concern is the comparison, not missing citations.
Questions for authors
Questions For Authors
- Under adaptive ranks, what exactly is guaranteed: a constraint on each sample’s gradient, the optimizer update, or the accumulated parameter change? How is optimizer momentum handled?
- Which baselines use the retain dataset during adaptation, and how were their hyperparameters selected?
- Are results from additional training seeds already available for fixed versus adaptive projection? These would help assess whether the reported improvement is stable.