- Rating
- 3(+1)
- Confidence
- 4(+1)
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes ChainVLA for long-horizon manipulation. At each query, the policy uses memory of earlier task progress and the unexecuted actions from its previous prediction. The goal is to keep track of what has happened while maintaining continuity between action chunks. The method reports strong results on RMBench and LIBERO, with ablations of the memory components, action continuation, and stage supervision.
Critical strengths
-
The paper addresses a practical problem: long tasks require both memory of earlier events and continuity between action chunks. ChainVLA brings these together and reports promising results on RMBench and LIBERO. Removing either component leads to a large drop in success.
-
The smoothing controls are useful. They show that reducing command discontinuities alone does not recover task success. The separate tests of memory retrieval and the two ways of using the previous action tail also help explain the gains.
Critical weaknesses
-
The main RMBench result uses extra stage supervision. Removing it and switching to periodic memory writes lowers success from 62.8% to 53.4%, but this changes two things at once. It is also unclear whether external baselines receive equivalent supervision, making the source of the reported advantage difficult to assess.
-
The paper includes matched internal simplifications, such as removing tail tokens, but lacks a comparison with an established learned action-continuation method under the same memory and supervision setup. The ablations establish the value of the tested components, but do not show whether the proposed integration outperforms an alternative learned continuation design. There are also no real-robot experiments. Real-robot testing is especially relevant here because the method aims to maintain motion across action chunks. Smaller command jumps in simulation do not guarantee smoother movement on a robot. Delays and tracking errors may make the previous action tail less useful, and the current experiments do not test this.
Questions for authors
-
How are the stage labels obtained? Do they require manual annotation, or are they derived from the simulator? Do any of the comparison methods receive equivalent supervision? Can you separate the benefit of stage supervision from the choice of when to write memories?
-
Do you have a comparison that keeps the same memory module and supervision, but uses an existing learned action-continuation method? This would help me judge what the proposed integration adds.
Thank you Authors.
Thank you for the detailed response and additional experiments. The controlled RTC comparison, direct stage and memory analysis, and additional seeds help address my concerns, although the seed study and real-robot evaluation are limited in scope; I will maintain my score since it justifies the current state of the paper and rating is positive so I am with you.
Thank you again and Good luck.