- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes EDCache, a two-stage whole-step output reuse method for accelerating diffusion transformers. Motivated by the observation that importance-based token selection does not consistently outperform random selection at matched compute, the paper shifts from token-level to timestep-level caching and uses controlled single-position interventions to show that endpoint damage varies sharply with the cache-injection position and depends on the model–sampler configuration. Stage 1 corrects cache-induced trajectory drift by extrapolating from the two most recent full-compute anchors without offline calibration, and Stage 2 constructs interval costs from a measured single-position endpoint-damage profile and selects full-computation timesteps by dynamic programming under a fixed budget.
Critical strengths
-
The controlled single-position interventions show that endpoint damage depends on the cache-injection position and the model–sampler configuration, providing direct guidance for timestep-level caching.
-
Stage 2 achieves lower paired LPIPS than all evaluated caching baselines on FLUX.1-dev and Wan2.1 across all four budgets, with the measured profile reused across budgets.
Critical weaknesses
-
The Stage 2 formulation, which selects full-computation timesteps by dynamic programming over calibrated costs, follows the same line as DPCache, and the position-dependent endpoint damage was already reported by OmniCache [1], which is not cited. The benefit of the endpoint-damage-based cost should be demonstrated through a controlled comparison with DPCache.
-
The DiT-XL/2 experiments omit the most direct timestep-level methods (DPCache, MagCache, TeaCache), and the Wan2.1 experiments do not include a comparison with DPCache, so the advantage of Stage 2 over the strongest timestep-level baselines remains unverified.
Questions for authors
Q1. How were the exponents (1.5, 1.8) and the temporal tilt (−0.1) in Eq. 6, the coefficient λ, and the cached-span limit h (2–11 across models and budgets) chosen, and how sensitive are the results to these values? Since the Stage 2 schedules for FLUX.1-dev and Wan2.1 compute most early steps in full (Table 5), how does Stage 2 compare with a simple schedule following the same pattern?
Q2. The profile is measured without Stage 1 repair, whereas repair is applied during final inference. Is this mismatch the reason why Stage 2 yields worse FID and sFID than Stage 1 on DiT-XL/2 at every budget?
Q3. Appendix D.2 states that measuring the profile requires 6,000 probes for DiT-XL/2 and 640 probes each for FLUX.1-dev and Wan2.1, with a substantial one-time generation cost, but the actual GPU time is not reported. What is the GPU time of this profile measurement, and how is this cost justified relative to DPCache, which uses only a small calibration set?
Dear Authors,
Thank you for the detailed response and the additional experiments. The comparisons that hold the predictor, compute budget, and scheduling constraints fixed address my main concern. They show that the endpoint-based cost improves fidelity over the tested alternatives. The schedule-ranking analysis also helps explain how well the proxy works across models.
I appreciate the calibration cost and latency breakdown. Please retain the distinction in the revised paper: calibration can pay for itself through inference savings relative to full computation, while its benefit over Stage 1 is improved fidelity at the same inference latency.
I am raising my rating from 2 to 3 (Weak acceptance). My confidence remains 3.