- Rating
- 3(+1)
- Confidence
- 1
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes MAX-CACHE, a framework for accelerating cross-chunk inference in few-step autoregressive video diffusion models. Its main idea is to motion-align intermediate activations cached from the previous video chunk and then select between two mutually exclusive reuse paths using a safety gate. When the gate passes, MAX-CACHE reuses the aligned and residual-corrected output at DiT block 28 and skips the preceding 29 blocks. When the gate rejects whole-prefix reuse, the model executes the prefix and uses an input-side mismatch score to select high-risk tokens for recomputation, while the remaining tokens reuse warped cached outputs. The pretrained generator remains frozen, and only a lightweight residual corrector with approximately 295K parameters is trained. On single-view nuScenes using Wan2.1-T2V-1.3B and one NVIDIA H20 GPU, the method improves end-to-end throughput from 3.90 to 5.48 FPS for 21-frame generation, corresponding to a 1.41× speedup. For 211-frame generation, throughput improves from 4.27 to 5.57 FPS, corresponding to a 1.30× speedup. The reported VBench, FID, and FVD results remain close to those of the Causal Forcing++ baseline. The paper also provides a diagnostic showing that a direct transfer of X-CACHE is ineffective, activation-level analyses of motion alignment and correction, token-routing diagnostics, runtime decomposition, and several component and parameter ablations.
Critical strengths
The paper addresses an important and practically relevant problem. Driving world models require continuous, low-latency generation over long horizons. Cross-chunk computation remains expensive even after the number of denoising steps has been reduced. Exploiting redundancy between adjacent chunks is therefore a meaningful direction.
The method directly addresses spatial misalignment in cached activations. Instead of reusing activations at unchanged token positions, MAX-CACHE estimates per-view translations using phase correlation and warps the cached features accordingly. The X-CACHE compatibility diagnostic provides useful motivation for performing explicit alignment before assessing reuse reliability.
The two-level reuse design is coherent and reasonably complete. Whole-prefix reuse provides larger computational savings when the safety conditions are satisfied. When the gate rejects this path, mismatch-guided selective recomputation still exploits locally reliable cached features. Maintaining dense K/V history and performing clean recaching reduce the risk of recursively contaminating the persistent causal state.
Critical weaknesses
The experimental scope is limited. The main results cover only single-view nuScenes, one 1.3B backbone, one output resolution, and one NVIDIA H20 GPU. It is therefore unclear how well the method generalizes to other backbones, datasets, multi-view generation settings, GPU architectures, or closed-loop simulation.
The post-training cost is not included in the overall efficiency analysis. Although optimizing the corrector takes only about 8.7 minutes, exporting the teacher pairs takes approximately 10.4 hours, for a total calibration cost of about 10.6 GPU-hours. The paper does not report the break-even point at which inference-time savings compensate for this calibration cost. This is particularly relevant because a new backbone, hidden dimension, view layout, or reuse point requires a new teacher-pair export and calibration.
The statistical reliability of the quality results is insufficiently characterized. The 21-frame evaluation uses 150 samples, but the paper does not report results across multiple random seeds, confidence intervals, or paired variability. Because the differences in VBench, FID, and FVD between MAX-CACHE and Causal Forcing++ are relatively small, point estimates alone may not be sufficient to support the strong claim that quality is preserved. The number of samples used for the 211-frame quantitative evaluation should also be stated more clearly.
Questions for authors
-
Generalization: How well does MAX-CACHE generalize to other datasets, backbones, multi-view settings, and GPU architectures?
-
Baseline Fairness: Since some baselines are partially reimplemented or adapted, how do the authors ensure that the comparisons are fair?
-
Practical Efficiency: How is selective token recomputation implemented to achieve actual computational savings? Could the authors also report its memory overhead and calibration break-even point?
Thank you for the detailed response and the additional experiments.
Points 1 and 2 address my questions. The re-run FlowCache-CD baseline is also a much fairer comparison than the original one.
The six-view evaluation is the most useful addition for me, since the paper is motivated by multi-view driving simulation. One thing is still missing: you report the dense Core FPS (3.10) but not the dense FID/FVD under the same six-view setting, so I can't tell how much quality is lost relative to 13.37/200.96. Please add the dense baseline quality to that table.
I also found the Light Forcing combination convincing. Getting an extra speedup (11.04 -> 12.73) with similar FID/FVD suggests the method is complementary to attention-side acceleration.
I will keep my score of acceptance.