- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes SceVLA, a dynamic-depth VLA framework with sparse exits, specialized action-token streams, and directed cross-exit attention. Deeper-exit streams reuse shallower-stream features through detached connections, while a separately trained router decides when to stop computation. Experiments on CALVIN and RoboTwin 2.0 report over 2× policy-query speedups, with a small performance drop on CALVIN and a larger drop on RoboTwin.
Critical strengths
- Clear practical motivation. The paper addresses VLA inference latency by improving intermediate action predictions and allocating computation across a small set of exits.
- Useful component comparisons. The token and attention ablations show that the complete model achieves better adaptive performance than shared-token and non-collaborative variants on both benchmarks.
Critical weaknesses
- Marginal routing gains in the main CALVIN result. With VLM-only initialization, the fixed shallow exit already achieves 4.34 AvgLen at 64.3 ms, compared with 4.36 at 68.9 ms for adaptive inference. The average exit depth of 8.1 further shows that the adaptive policy operates almost entirely at the shallowest exit. Thus, the headline CALVIN speedup primarily demonstrates the strength of the shallow exit, while the incremental contribution of dynamic routing is marginal.
- Substantial performance loss on RoboTwin. The reported 2.13× speedup reduces success from 85.5% to 72.7%. Accuracy–latency curves and comparisons at matched computational budgets are needed to assess whether this trade-off is consistently favorable.
- Unspecified routing thresholds. Neither the main paper nor Appendix A reports the values or selection procedure for the training error tolerances and inference stopping thresholds. These settings determine when the policy exits and are necessary to reproduce the reported accuracy–latency trade-off.
- Missing real-world validation of latency benefits. The paper reports lower policy-query latency only in simulation, without demonstrating benefits in physical robot execution. Real-robot experiments should establish whether these reductions improve task throughput or responsiveness, particularly compared with asynchronous execution strategies such as RTC [1], where applicable.
[1] Real-time execution of action chunking flow policies. Advances in Neural Information Processing Systems, 2026.
Questions for authors
See weaknesses.