- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The authors propose RoDCache, a method for accelerating sparse MoE diffusion models through adaptive caching. The method measures changes in expert assignments and routing weights between full computation steps and uses them to predict how long cached results remain valid. It requires no additional training and uses a single threshold to control the level of acceleration. Experiments show improved similarity to outputs obtained without caching while maintaining competitive generation quality and latency.
Critical strengths
Simple and effective design. RoDCache requires no additional training and uses a single tunable threshold to control cache reuse. It consistently improves PSNR, SSIM and LPIPS over evaluated caching baselines across three sparse MoE models while maintaining competitive generation quality and latency.
Critical weaknesses
-
Unclear practical advantage. Better PSNR, SSIM and LPIPS show that generated images and videos are closer to those obtained without caching. These gains do not by themselves demonstrate better generation quality. CLIP/VBench Score and ImageReward remain largely comparable to SeaCache. Although RoDCache achieves lower latency in the reported settings, it is unclear whether this advantage would hold at comparable generation quality under other parameter choices. The evidence for a better tradeoff between generation quality and inference time therefore remains limited.
-
Weak evidence for choosing routing drift. Figure 2 removes shared correct detections and normalizes the remaining counts to 100%. This could make a small difference between two nearly identical indicators look substantial. Without absolute counts, it is unclear how much routing drift actually improves on residual drift. This weakens the evidence behind a central design choice.
Questions for authors
-
Figure 2 reports the relative proportions of prompts uniquely identified by each indicator, but does not provide the underlying counts. Could you report the total numbers of correctly identified prompts, and , including their shared correct detections?
The two indicators could identify almost identical sets of prompts, differing only in a small number of cases. Excluding shared detections and normalizing the remaining counts to sum to 100% could then make a small absolute advantage appear substantial. Reporting the shared and unique detection counts would help establish the magnitude of the improvement.
-
Could you clarify whether the main objective is to reproduce the images and videos generated without caching or to preserve generation quality while accelerating inference? Are the improvements in PSNR, SSIM and LPIPS intended as the main empirical contribution? If so, please explain why closer similarity to outputs obtained without caching is practically important and distinguish these gains from improvements in generation quality in your claims. If the main objective is to preserve generation quality while reducing inference time, could you compare RoDCache with strong baselines such as SeaCache at the same latency using CLIP Score, ImageReward and VBench?
3 comments
W1: Unclear practical advantage. Better PSNR, SSIM and LPIPS show that generated images and videos are closer to those obtained without caching. These gains do not by themselves demonstrate better generation quality. CLIP/VBench Score and ImageReward remain largely comparable to SeaCache. Although RoDCache achieves lower latency in the reported settings, it is unclear whether this advantage would hold at comparable generation quality under other parameter choices. The evidence for a better tradeoff between generation quality and inference time therefore remains limited.
Q2: Could you clarify whether the main objective is to reproduce the images and videos generated without caching or to preserve generation quality while accelerating inference? Are the improvements in PSNR, SSIM and LPIPS intended as the main empirical contribution? If so, please explain why closer similarity to outputs obtained without caching is practically important and distinguish these gains from improvements in generation quality in your claims. If the main objective is to preserve generation quality while reducing inference time, could you compare RoDCache with strong baselines such as SeaCache at the same latency using CLIP Score, ImageReward and VBench?
-
Objective. RoDCache aims to preserve generation quality while accelerating inference and minimizing deviations from full-computation outputs. Improvements in PSNR, SSIM, and LPIPS are a main empirical contribution in terms of fidelity, showing that RoDCache preserves full-computation outputs more faithfully than existing caching methods. We have revised the manuscript to distinguish fidelity from generation quality in our claims (e.g., Line 26 and Lines 101–102) and separately group PSNR, SSIM, and LPIPS under “Fidelity to Vanilla” and CLIP Score, ImageReward, and VBench under “Generation Quality” in the result tables.
-
Practical importance. Caching is typically used as a drop-in acceleration technique and should ideally preserve model behavior under the same prompt, random seed, and sampling configuration. Cache-induced changes in object count, spatial layout, rendered text, subject identity, local details, or video dynamics may break reproducibility and require existing generation and content-review pipelines to be revalidated. Such changes may not be fully captured by CLIP Score, ImageReward, or VBench because perceptually different outputs can receive similar aggregate scores.
-
Consistency with prior work. The empirical advantages of TeaCache [1], DPCache [2], SeaCache [3], and DiCache [4] are also primarily reflected by PSNR, SSIM, and LPIPS, while their CLIP Score, ImageReward, and VBench results generally remain comparable rather than showing consistent improvements.
-
Comparison with SeaCache. Our main table already compares the two methods at their closest latency settings. Across all slow and fast settings, RoDCache achieves lower latency, higher PSNR and SSIM, and lower LPIPS, while maintaining CLIP Score, ImageReward, and VBench comparable to SeaCache.
[1] Timestep Embedding Tells: It's Time to Cache for Video Diffusion Model, Liu et al., CVPR 2025.
[2] Denoising as Path Planning: Training-Free Acceleration of Diffusion Models with DPCache, Cui et al., CVPR 2026.
[3] SeaCache: Spectral-Evolution-Aware Cache for Accelerating Diffusion Models, Chung et al., CVPR 2026.
[4] DiCache: Let Diffusion Model Determine Its Own Cache, Bu et al., ICLR 2026.
Dear Reviewer DyRj,
Thank you again for your valuable feedback and for taking the time to review our work.
We would like to kindly follow up and ask whether our responses have adequately addressed your concerns. If there are any remaining questions or aspects that you would like us to clarify further, we would be more than happy to provide additional explanations.
We would also greatly appreciate any further thoughts you may have regarding our responses.
Thanks,
The Authors
Dear Reviewer DyRj,
Thank you very much for your thorough review and constructive feedback. We greatly appreciate the opportunity to address your concerns and questions.
Following this suggestion, we report the absolute detection counts below. Figure 2 presents the equal-g normalized exclusive shares, whereas the following counts aggregate all eligible settings. We have added these absolute counts and the corresponding analysis to Appendix A of the revised manuscript.
Representative results at different cache-reuse lengths are:
Based on these results:
Therefore, the advantage in Figure 2 is not an artifact of excluding shared detections and renormalizing a small number of remaining cases.