- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
ACID proposes scheduling cache thresholds over the denoising process to accelerate video diffusion models. It uses drift trajectories to identify critical regions offline, then applies conservative thresholds in those regions and more aggressive thresholds elsewhere. The schedule can be added to existing caching methods without retraining. The limited experiments across several methods suggest better quality–latency tradeoffs, but further ablations and analysis to explain the gains are lacking.
Critical strengths
-
Threshold scheduling is a useful and simple design choice. ACID leaves the underlying drift estimator and reuse mechanism intact, making it easy to add to existing methods with little inference overhead.
-
The evaluation covers seven method–model combinations and three different drift signals. Appendix C includes intermediate fixed thresholds, which makes the reported tradeoff gains more convincing than a comparison against only low and high endpoints.
Critical weaknesses
-
The presentation is poor, and the core calibration procedure is difficult to follow. Algorithm 1 defines without a numerical stability rule, while Appendix C omits the transition indices needed to reproduce the schedules. These central details need a much clearer explanation. More importantly, the contribution feels somewhat dated and reads like a small engineering trick. A small change can be valuable with careful analysis; limited novelty alone is not my concern. Here, however, the analysis remains shallow. The drift plots and proxy check in Figures 2–6 do not isolate whether the gains come from the curvature rule, warmup/end protection, or extra tuning, nor sufficiently explain how drift relates to accumulated caching error. Existing analyses of output sensitivity (Haghighi, 2026) and path-dependent caching error (Cui et al., 2026) also deserve discussion. Matched mechanism ablations are needed to explain what threshold scheduling adds within these broader caching frameworks.
-
The evaluation is limited to PSNR, SSIM, and LPIPS against uncached outputs on 33 prompts with a fixed seed. There is no human evaluation or direct assessment of temporal consistency and prompt alignment. The many appendix curves add operating points but do not answer the underlying mechanism question. I would kindly encourage the authors to examine error propagation and when the threshold rule succeeds or fails across samplers, step counts, guidance settings, and motion complexity, beyond changing the model. A deeper analysis and discussion would make this more interesting than stopping at “we changed the threshold and it worked.”
Reference
Haghighi, Yasaman, and Alexandre Alahi. "SenCache: Accelerating Diffusion Model Inference via Sensitivity-Aware Caching." arXiv preprint arXiv:2602.24208 (2026).
Cui, Bowen, et al. "Denoising as Path Planning: Training-Free Acceleration of Diffusion Models with DPCache." arXiv preprint arXiv:2602.22654 (2026).
Questions for authors
- What numerical rule determines stabilization of ? Please provide transition indices, threshold values, search ranges, and calibration cost for every reported configuration.
- At matched compute and tuning cost, what improvement comes from the curvature rule over simple schedules and warmup/end protection? Can per-step reuse errors and their propagation explain the difference?
- How does ACID relate to sensitivity-aware and path-dependent caching approaches, and what distinct insight or benefit does its threshold rule provide?
- With calibration frozen, does the rule transfer across seeds, samplers, step counts, guidance settings, and motion complexity? Can human judgments and video-specific metrics confirm the quality tradeoff?
- Could the readability of algorithm 2 be improved?