- Rating
- 2
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a training-free framework for accelerating image and video diffusion transformers through fixed module-level feature reuse. The method is motivated by Conditional Common-Mode Rejection (CCMR), an empirical observation that adjacent-step differencing reduces condition-dependent variation in module outputs when the initial noise is fixed. Stage I ranks timestep–layer–module locations using ratios of consecutive L1 feature displacements and constructs a provisional Cache Book through family-wise quantile selection. Stage II recomputes these priorities using a reference history influenced by the provisional book, while retaining full-compute trajectories.
Critical strengths
Given the reuse hyperparameters, the method constructs a fine-grained schedule from one or two calibration conditions without gradient-based optimization, combinatorial schedule search, or per-generation profiling. This simplicity could be useful when adapting caching to different model configurations.
The method produces measured latency reductions on both image and video models. The DiT operating point compares favorably with the tested ToCa settings on speed, FID, and paired fidelity, although not uniformly across all metrics.
Critical weaknesses
A small ratio can result from a large denominator and does not imply that reusing an earlier output at the indexed step is safe. The manuscript acknowledges this limitation, but does not directly evaluate whether the score predicts the consequences of individual reuse decisions. Table 3 provides encouraging comparisons with adjacent MSE and cosine distance, but the realized reuse fractions and FLOPs differ.
The main configurations use model- and module-specific quantiles, with separate settings for hybrid caching. Constructing a book after fixing these values is search-free, but choosing them may still require quality evaluation and experimentation. Appendix A reports the number of full-compute trajectories rather than measured calibration costs for the main configurations. Although a calibration time is provided for the eight-step distilled experiment, broader accounting of selection cost, calibration latency, and memory is needed to substantiate the practical advantage.
Questions for authors
How sensitive are the final quality metrics to independently sampled calibration conditions and random seeds? A repeated calibration experiment on one representative image model and one video model, together with broader motion-rich video evaluation, would help assess the reliability of the few-condition claim.
Can you provide quality–latency curves against independently tuned MagCache/SeaCache, together with a controlled comparison against ECAD or SODA on a shared model? In particular, does adding the module Cache Book improve quality at matched latency compared with increasing the baseline’s reuse aggressiveness?
Can you evaluate Stage I versus Stage II on an independent paired set with comparable executed compute? Please also explain the motivation for assigning the look-ahead ratio to step t and for updating the scorer reference after observing step t+1, rather than directly following the inference cache history.