- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes SMTD, a speculative decoding framework for efficient multi-trajectory generation in VLA-based driving. Experiments demonstrate substantial VLA inference speedups with considerable planning performance.
However, I have the following concerns:
C1. Insufficient ablation studies. The contributions of individual components to the overall speedup are not clearly isolated, making it difficult to assess the necessity of each design choice.
C2. Unclear source of PDMS improvements. Although speculative sampling preserves the target distribution, SMTD achieves higher Oracle PDMS than standard autoregressive sampling. Further analysis is needed to explain these gains and assess their statistical reliability.
C3. Incomplete end-to-end efficiency evaluation. The reported latency excludes online candidate selection. Measuring the full generation-and-selection pipeline would provide stronger evidence of the method's practical efficiency.
Critical strengths
see above
Critical weaknesses
see above
Questions for authors
see above
Response to Reviewer KGET: Component Effectiveness, PDMS Improvements, and End-to-End Latency
Thank you for highlighting the importance of component ablations, the source of PDMS improvements, and complete pipeline timing. Our additional experiments demonstrate three complementary roles: speculative decoding improves generation efficiency, multiple candidates increase access to high-quality trajectories, and UOCS improves the final choice. All experiments below evaluate the complete NAVSIM test split, with three repetitions and mean results reported.
C1. Effectiveness of the three components
We evaluated all eight combinations of speculative decoding (SD), multiple candidates (MC), and UOCS. Configurations share the target model and sampling settings, using the same frozen UOCS wherever enabled. With SD off, AR shares prefill and batches branches. MC off permits one sampled trajectory; MC on permits four sampled trajectories plus the reference. Without UOCS, selection uses a fixed independent uniform draw. With one eligible trajectory, the selector returns that trajectory. Every configuration includes fresh reference generation.
SD improves efficiency. With MC and UOCS enabled, SD reduces end-to-end latency from 9.342 to 8.784 s, a 6.0% reduction. The fully enabled configuration takes 8.784 s in the ablation and 8.895 s in the separate pipeline-timing experiment in C3.
MC improves candidate quality. With SD enabled, expanding from one sampled trajectory to four candidates plus the reference raises Oracle PDMS from 86.82 to 94.92. Excluding the reference still yields 94.91, demonstrating the contribution of generated candidates.
UOCS improves the final choice. On the same N=4 SMTD pool, UOCS raises Selected PDMS from 90.36 to 92.17 while Oracle remains 94.92. It also exceeds the expected score of uniform selection, 90.67. Feature extraction and selection together cost approximately 26 ms. These results show how the three components combine efficient generation, stronger candidate coverage, and quality-aware selection.
C2. Why multiple candidates improve PDMS while preserving the target distribution
The key is repeated sampling: more draws increase the chance that the candidate pool contains a high-quality trajectory. Let q be the probability that one trajectory exceeds a quality threshold for a given scene. For N independent draws,
$ P(\text{at least one high-quality trajectory})=1-(1-q)^N. $
This probability increases with N without changing any individual trajectory's distribution. Multi-candidate planning exploits this opportunity; speculative decoding improves generation efficiency, and UOCS selects the final output.
The results support this mechanism. As N increases from 2 to 4 to 8, SMTD's Oracle PDMS rises from 93.14 to 94.92 to 95.64, while Selected PDMS increases from 89.66 to 92.17 to 92.96. The ablation further shows that expanding from one to four generated candidates, excluding the reference, raises Oracle PDMS by 8.09 points.
At the same N, AR and SMTD can produce different realized candidate pools, so their measured Oracle scores need not coincide. Increasing N explains the benefit over single-trajectory planning; differences between decoders at fixed N can reflect finite sampling variation. SMTD's effectiveness comes from efficiently generating useful alternatives from the target distribution and selecting among them, without requiring a change to that distribution.
C3. Complete end-to-end latency
The original table measures candidate-generation latency. We additionally measured the complete planning pipeline, including greedy reference generation, candidate generation, and online selection:
$ T_{\mathrm{E2E}}=T_{\mathrm{pre/post}}+T_{\mathrm{reference}}+T_{\mathrm{candidates}}+T_{\mathrm{UOCS}}. $
The reference is freshly generated by ordinary autoregressive greedy decoding of the frozen OneVL target, using token-wise argmax. UOCS time includes feature extraction, prediction, and final selection.
Online selection adds approximately 24-29 ms, while reference generation contributes approximately 4.55 s.