- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes QCache-VLA, a training-free framework for faster vision-language-action (VLA) inference. It combines action-aware quantization of the VLM backbone, residual-based caching in the diffusion action expert, and an INT8 runtime backend. The authors evaluate it on RoboTwin, LIBERO, and real-world manipulation tasks.
Critical strengths
• The paper addresses both major sources of inference cost rather than optimizing only the VLM or the action expert. The end-to-end measurements are especially useful: on an RTX 4090, latency falls from 168 ms to 38 ms and GPU memory use drops by about 37%. The breakdown also shows why the runtime backend matters—quantization alone does not improve latency.
• The low-computation results are striking. With only two fully computed expert steps, QCache-VLA reaches 78.0% average success on RoboTwin’s easy π₀.₅ tasks, compared with 15.6% for EfficientVLA and 11.6% for DiCache at the same step budget (Appendix Table 5). The corresponding hard-task results show a similar gap.
• I find the motivation for action-aware quantization convincing. A small reconstruction error within the VLM need not translate into a small error in the policy’s final action.
Critical weaknesses
• I am not sure how much the dynamic gate contributes in the setting where QCache-VLA performs best. At δ = 1.0, Table 3(b) reports an average of 2.0 fully computed steps. The experimental setup says that these are the first and final steps, which Algorithm 3 requires to be computed in full anyway. This suggests that the gate rarely rejects reuse at intermediate steps. The two-step results are impressive, but they do not tell us whether a fixed scheme that always reuses the calibrated residual between the first and final steps would work just as well.
• Appendix Table 5 compares methods at matched numbers of fully computed steps, which is helpful. However, EfficientVLA and DiCache are paired with MBQ, while QCache-VLA uses its own quantization method. It is therefore difficult to separate the benefit of the cache from that of quantization. Comparisons using the same quantized checkpoint would help. I would also be interested in why QCache-VLA’s advantage is much larger at two fully computed steps than at three or five.
• I could not find a direct ablation of the action-aware selection loss in Eq. (9). Table 3(a) tests the smoothing and reconstruction components, but does not keep the smoothing candidates fixed and compare the proposed directional loss with a local reconstruction loss. Without this comparison, it is hard to judge how much the selection objective itself contributes.
Questions for authors
• At δ = 1.0, how often does the gate reject cache reuse? How does it compare with fixed first-and-final-step caching using the same residual calibration?
• Can the authors isolate the effects of caching and quantization on the same checkpoint, and directly compare the selection loss in Eq. (9) with a local reconstruction loss?
5 comments
W2 & Q2: Disentangling Quantization and Caching Effects and Understanding the Advantage at Two Full Evaluations
A2: We thank the reviewer for pointing out the confounding effects of different quantization methods. We agree that the original Appendix Table 5 combines EfficientVLA and DiCache with MBQ, whereas QCache-VLA uses our proposed quantization pipeline. Therefore, the performance differences cannot be attributed solely to caching.
To disentangle the effects of caching and quantization, we conducted additional experiments on GR00T N1.7 using LIBERO, comparing different caching strategies under full precision and two W8A8 quantization pipelines (QVLA and Ours). All cached variants use two full action-expert evaluations within the original four-step schedule (Table R2).
Under full precision, QCache-VLA achieves 93.60% average success, outperforming DiCache (92.25%) and EfficientVLA (92.35%), demonstrating its effectiveness independently of quantization. Under our unified W8A8 setting (MAS + MBR), QCache-VLA achieves 93.10%, compared with 93.05% for DiCache and 92.45% for EfficientVLA. Furthermore, keeping the caching strategy fixed, our quantization pipeline outperforms QVLA by 1.65 percentage points with DiCache (93.05% vs. 91.40%) and 0.70 percentage points with EfficientVLA (92.45% vs. 91.75%). These controlled comparisons help distinguish the contributions of caching and quantization while demonstrating near-baseline task performance.
Regarding why QCache-VLA exhibits a larger advantage at two full evaluations than at three or five, we believe this behavior is related to the accumulation of cache approximation errors under increasingly aggressive reuse.
When more full expert evaluations are available, deeper features are refreshed more frequently, limiting the duration over which approximation errors can accumulate. Consequently, different caching strategies may produce relatively similar results.
In contrast, when only two full evaluations are performed, multiple consecutive intermediate steps rely on cached approximations. Directly reusing historical features without adapting them to the current diffusion state may introduce larger deviations in the final action prediction. QCache-VLA mitigates this issue by retaining the current first-layer response and using residual calibration to adjust the cached deep transformation.
This interpretation is consistent with the original Appendix Table 5. On π0.5 under RoboTwin Easy, at three full evaluations, DiCache and QCache-VLA achieve 76.7% and 78.0% average success, respectively. However, at two full evaluations, DiCache drops to 11.6%, while QCache-VLA maintains 78.0%. EfficientVLA also drops to 15.6% under the two-full-evaluation setting.
These observations suggest that calibrated residual reuse becomes particularly important when the number of full evaluations is extremely limited.
Overall, the additional GR00T experiments reduce the confounding effects of different quantization pipelines, while the low-step comparisons provide further evidence that QCache-VLA preserves action-generation quality under aggressive caching.
W3 & Q2: Independent Contribution of the Action-Aware Candidate Selection Objective
A3: We thank the reviewer for this constructive suggestion. We agree that the original Table 3(a) primarily evaluates modality-aligned smoothing and modality-balanced reconstruction as components, but does not directly isolate the contribution of the action-aware candidate selection objective in Eq. (9).
To address this concern, we conducted an additional ablation comparing different smoothing selection objectives while keeping the smoothing candidate set unchanged. Specifically, we compare the proposed action-aware directional loss against conventional local reconstruction objectives based on Block MSE and Block MAE.
We evaluate the final-action reconstruction errors relative to the original full-precision model, together with closed-loop success on LIBERO-Long, as shown in Table R4.
Table R4. Ablation of smoothing candidate selection objectives. Final-action reconstruction errors are measured against the original full-precision model.
| Search Objective | Action MSE ↓ (×10⁻⁶) | Action MAE ↓ (×10⁻³) | LIBERO-Long (%) ↑ |
|---|---|---|---|
| Block MSE | 2.8012 | 1.1937 | 91.8 |
| Block MAE | 3.0522 | 1.2400 | 91.4 |
| Action-aware (Ours) | 2.5581 | 1.1272 | 92.4 |
Compared with Block MSE selection, our action-aware criterion reduces final-action MSE by approximately 8.68% and MAE by 5.57%, while improving LIBERO-Long success from 91.8% to 92.4%.
These results support the motivation behind Eq. (9). Conventional local reconstruction objectives primarily minimize quantization errors at the current module output, without explicitly considering their effects on downstream action predictions.
In contrast, our action-aware criterion uses randomly projected gradients to estimate how local quantization perturbations influence the final velocity prediction. This enables the selection of smoothing parameters that better preserve action-relevant information, even when local reconstruction errors alone do not fully reflect downstream sensitivity.
Importantly, the comparison changes the candidate selection objective rather than the smoothing candidate set, allowing us to more directly evaluate the contribution of the proposed directional loss.
The additional results indicate that action-aware selection provides better final-action numerical fidelity than the tested local reconstruction objectives and achieves higher average LIBERO-Long success under the evaluated setting. We will include this controlled ablation in the revised manuscript to clarify the independent contribution of the action-aware selection objective.
We thank the reviewer for the constructive assessment and thoughtful suggestions. We address each concern below.
W1 & Q1: Contribution of Dynamic Gating and Comparison with Fixed Caching Schedules
A1: We thank the reviewer for this insightful observation. We agree that under the default threshold δ=1.0, the dynamic gate rarely rejects cache reuse at intermediate denoising steps. Consequently, only the first and final steps require full action-expert evaluations, making the computation schedule effectively equivalent to a fixed first-and-last strategy.
However, our method does not simply reuse previously cached features. As described in Eqs. (16)–(17), each intermediate step still computes the current first-layer response and dynamically rescales the cached deep residual using the magnitude ratio of consecutive early residuals. Therefore, the performance under this aggressive two-full-evaluation setting primarily reflects the effectiveness of residual-calibrated cache reuse, rather than dynamic gating alone.
To further clarify the behavior of dynamic gating, we report the average number of full action-expert evaluations under different thresholds for π0.5 and GR00T N1.7.
Table R1. Average number of full action-expert evaluations under different cache thresholds, evaluated on LIBERO.
Since the first and final steps are always fully computed, the average cache rejection rate at intermediate steps can be calculated as
rreject=T−2Nfull−2,
where Nfull denotes the average number of full expert evaluations and T is the total number of denoising steps.
At δ=1.0, the rejection rate is effectively 0% for both models. At$\delta=0.2$, it increases to approximately 37.81% for π0.5 and 97.50% for GR00T N1.7. These results demonstrate that the dynamic gate adjusts the number of full evaluations under more restrictive thresholds, providing a configurable trade-off between computation and task performance. We additionally report success-rate comparisons under different numbers of full evaluations on π0.5 in the RoboTwin simulation environment in Appendix Table 5.
Regarding the suggested fixed first-and-last caching baseline, we additionally evaluate two simple fixed strategies on GR00T N1.7. As shown in Table R2, fixed first-and-last computation achieves an average success rate of 92.70%, while fixed first-and-last caching with direct reuse of the first-step residual αt=1 achieves 92.60%. In comparison, QCache-VLA achieves 93.60% with dynamically calibrated residual reuse.
Table R2. Comparison of caching strategies on GR00T N1.7 LIBERO under full precision and different W8A8 quantization methods. All cached variants use two full action-expert evaluations within the original four-step denoising schedule. Success rates are reported in %.
Compared with direct residual reuse without rescaling, QCache-VLA improves average success by 1.00 percentage point, supporting the benefit of adapting cached residuals to the current denoising state. Therefore, residual calibration enables accurate reuse under aggressive caching, while dynamic gating provides adaptive computation allocation at other thresholds. We will clarify this distinction in the revised manuscript.