- Rating
- 3
- Confidence
- 4
- Informativeness
- 3
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes PRICE, a training-free dynamic caching policy for diffusion Transformers under a strict per-sample compute budget. Its starting point is a mismatch that is observed but not systematically addressed: the magnitude of a local cache error does not determine the eventual impact of that cache action on the final output. The paper derives a discrete error-propagation bound that decomposes the terminal contribution of a cache error into local perturbation magnitude, solver-step scaling, and downstream propagation. Because the quantities in that bound (the true perturbation E_i and the per-timestep Lipschitz constant Λ_i) are unavailable online, the method builds a causal risk proxy from an offline timestep-dependent sensitivity estimate L_i and the current displacement from the most recent full-computation anchor.
Critical strengths
-
PRICE addresses a real and important mismatch between local cache error and final-output impact.
-
The exact-budget controller is simple, causal, and cleanly constrained.
-
The risk-component ablations are thorough in their combination.
Critical weaknesses
-
The offline risk quantiles are estimated under a uniform caching schedule, whereas the deployment policy changes the distributions of states and anchors. The paper has not validated whether these quantiles remain applicable during adaptive rollouts or how sensitive the final performance is to the risk-bank collection policy.
-
The connection between the theoretical bound and the practical risk estimator is insufficiently established. The theorem uses true local perturbations and fixed-time Lipschitz constants, whereas the deployed estimator uses state distances and adjacent-timestep trajectory secants as proxies. Although the ablations support the score’s practical utility, they do not directly verify whether it accurately estimates local caching errors or correctly ranks the terminal impact of individual caching actions.
-
The reproduced ERTACache results on FLUX.1-dev are markedly inconsistent with the other reported results, and the paper provides no explanation.
-
The authors are encouraged to include a focused analysis of GOC[1] and HiCache[2] in the related work section. Discussing these representative studies would help trace the development of diffusion feature caching and clarify the technical positioning of this submission.
[1]. Qiu, Junxiang, et al. "Accelerating diffusion transformer via gradient-optimized cache." 2025 IEEE/CVF International Conference on Computer Vision (ICCV). IEEE, 2025.
[2]. Feng, Liang, et al. "HiCache: A plug-in scaled-Hermite upgrade for Taylor-style cache-then-forecast diffusion acceleration." International Conference on Learning Representations. Vol. 2026. 2026.
Questions for authors
See the Weaknesses