- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SparkVLA, a hierarchical Vision-Language-Action framework for long-horizon manipulation that jointly models subtask termination and adaptive action-chunk execution. Instead of using a separate stop detector and action-horizon selector, SparkVLA introduces a unified candidate set in which STOP competes directly with all possible action-prefix lengths. The framework further incorporates a history-aware subtask anchor, anchor-guided visual token pruning, and a stop-aware ranking objective trained from offline subtask-boundary annotations. Experiments on RoboCerebra, LIBERO, and three real-world manipulation tasks show consistent improvements over standalone VLAs, hierarchical baselines, and matched adaptive-chunking methods.
Critical strengths
The paper addresses an important and practical interface problem in hierarchical VLA systems: subtask termination and execution horizon are naturally coupled, yet are often handled independently. The proposed unified ranking formulation is simple, intuitive, and easy to integrate into existing hierarchical systems. The experimental evaluation is relatively comprehensive, including matched comparisons with DEHP, ACH, AQC, and AAC, interface-level ablations, executor transfer, proposal-shift diagnostics, and real-robot experiments. In particular, the matched study shows that SparkVLA improves complete-task success from 30.1% with factorized heads to 36.1%, while also substantially reducing premature subtask transitions. The physical experiments further support the practical value of the method, with SparkVLA outperforming both the base policy and AAC with matched Stop across all three tasks.
Critical weaknesses
The main limitation is that the conceptual novelty is somewhat incremental: treating STOP as another candidate in the action-prefix ranking space is elegant, but the paper occasionally overstates this as resolving a dependency that independent modules fundamentally cannot handle. A sufficiently expressive factorized model could in principle expose both heads to the same action proposal and context, so the empirical result is better interpreted as evidence for a useful inductive bias rather than a fundamental architectural necessity. In addition, the ordinal supervision is derived from recorded completion boundaries rather than counterfactual outcomes of the newly proposed action prefixes. Its validity therefore depends on alignment between the recorded trajectory and the executor proposal, which the authors themselves acknowledge, and the proposal-shift experiments show gradual performance degradation as this alignment decreases.
Questions for authors
My main question concerns the robustness of the boundary-derived supervision. Since the preferred prefix length is inferred from the remaining distance to the recorded completion boundary rather than from the actual outcome of each proposed prefix, how sensitive is SparkVLA when the executor proposal deviates more substantially from the recorded trajectory, especially under larger executor shifts or out-of-distribution states?
3 comments
Thank you for the detailed response; you have addressed most of my concerns, and I am happy to support acceptance of your paper.
We sincerely appreciate your recognition of our work and your support for acceptance! Your thoughtful comments have helped us clarify our presentation and strengthen the manuscript. Thank you for taking the time to read our responses and for the constructive discussion throughout the review process.
We thank the reviewer for recognizing the practical value of the shared decision interface and the matched and physical evaluations. We clarify the learning-bias contribution and present the proposal-shift and execution evidence addressing your main concern about boundary-derived supervision.
Question 1 and Critical Weakness 2: Robustness to proposal shifts and correction states
SparkVLA retains an advantage over joint categorical selection in each tested condition. We examine changes to the executor weights and correction states to assess sensitivity to both the proposal-generating model and the encountered states:
\hline \begin{array}{c}\textbf{Evaluation}\cr \textbf{condition}\end{array} & \begin{array}{c}\textbf{Categorical SR}\cr \textbf{(\\%)}\end{array} & \begin{array}{c}\textbf{SparkVLA SR}\cr \textbf{(\\%)}\end{array} & \begin{array}{c}\textbf{Gain (pp),}\cr \textbf{95\\% CI}\end{array} \cr \hline \text{Standard} & 33.5 & \mathbf{36.1} & \begin{array}{c}+2.61\cr [0.72, 4.50]\end{array} \cr \begin{array}{l}\text{Same architecture,}\cr \text{different executor weights}\end{array} & 31.3 & \mathbf{34.3} & \begin{array}{c}+3.00\cr [0.83, 5.17]\end{array} \cr \text{OOD correction states} & 27.8 & \mathbf{31.7} & \begin{array}{c}+3.83\cr [1.61, 6.06]\end{array} \cr \hline \end{array}$$ Gains use unrounded rates and paired intervals. The ordinal gains are +3.00 pp for changed executor weights and +3.83 pp for correction states, with paired confidence intervals above zero in both conditions. Correction states include contact recovery, slip handling, and obstacle avoidance. We additionally evaluate decision-outcome agreement on 2,000 held-out (state, proposal) pairs. Agreement compares predicted accept/reject decisions with the observed execution outcomes: $$\begin{array}{lrrr} \hline \textbf{Audit group} & \textbf{Pairs} & \begin{array}{c}\textbf{Joint categorical}\cr \textbf{(\\%)}\end{array} & \begin{array}{c}\textbf{SparkVLA}\cr \textbf{(\\%)}\end{array} \cr \hline \text{Accepted proposals} & \text{1,300} & 68 & \mathbf{90} \cr \text{Rejected proposals} & 500 & 65 & \mathbf{84} \cr \begin{array}{l}\text{OOD correction-state}\cr \text{proposals}\end{array} & 200 & 59 & \mathbf{81} \cr \hline \end{array}$$ SparkVLA improves both complete-task success in the shift evaluations and decision-outcome agreement in all three audit groups. Section 4.7 and Appendices A.2–A.3 now report the evaluation conditions, paired intervals, and executed-outcome measurements. ## Critical Weakness 1: Contribution and the role of factorization **The matched controls quantify the benefits of the shared decision interface and stop-aware ordinal training:** joint selection raises task success from 30.1% to 33.5%, and the full ordinal selector reaches 36.1%. The factorized control receives the same proposal and context as the joint selectors, with matched model capacity and training cases. The design makes STOP and continuation lengths directly comparable in one candidate space. Within this space, ordinal training uses the same boundary to supervise relative preferences among valid prefixes, including non-optimal candidates. This distinguishes the choice of interface from the choice of training objective. The data-volume ablation further shows an ordinal advantage of +3.17 pp at 50% training data and +3.78 pp at 25%. The matched comparisons demonstrate the benefits of the shared STOP–prefix decision space and stop-aware ordinal training. We have emphasized these contributions in the abstract and Sections 1 and 3.2. Appendix A.1 explains the matched comparisons and reports the data-volume ablation in Table 6.