- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes PropCache, a step-caching scheduler for visual diffusion models. The key insight is that the final influence of a local caching error should take the amplification effects of the subsequent denoising steps into account. PropCache then measures the separated propagation gain for each timestep (per NFE scheduler setting), and use a dynamic programming algorithm to calculated a calibrated caching configuration, which aims in minimizing the final accumulated error under a fixed NFE. The paper demonstrates competitive fidelity-computation trade-offs across many image and video generation models.
Critical strengths
1. Clear presentation and a well-motivated problem formulation
- The paper is clearly stated. The idea of measuring error propagation rate and then use it to search for a better step-caching scheduler is natural and easy to follow.
2. Accounting for error propagation is a valuable idea
- Instead of inspecting on only local properties (e.g. adjacent frame differences / similarity), the method modeling the generation progress in a whole. trajectorial view. Which is more direct to the central point of preserving generation fidelity.
3. The offline, fixed-budget implementation is practically appealing.
- The method only requires a pre-calibration measure for the propagation gain and a optimal programming for the time scheduler. Which introduce almost no extra computation cost in the following inference stage. Which is practically useful for large-scale deployment acceleration.
Critical weaknesses
1. The main advantage of PropCache is calibration-time efficiency
- It seems that the propagation gain is close to a curve that decreases broadly over the time. Which results in a strategy that allocates more computation early and makes more cache later. Table 4 is particularly relevant: the searched exponential and power-law alternatives achieve lower mean LPIPS than the measured curve. This suggests that the main contribution may be obtaining useful temporal weights at low calibration cost, instead of an efficient-and-effective solution.
2. The high calibration cost of parametric baselines may depend on the search implementation
- The calibration-efficiency comparison in Table 4 is made between directly measured propagation profiles and parameterized profiles selected through extensive LPIPS-based searching. It could be more convincing with a baseline that first fit an parameterized profile directly with the same measured propagation probes, and then compile these schedules using the DP algorithm. Such a comparison can help demonstrate the gain of the measured one against the parameterized one.
3. Connection to continuous timestep scheduling and missing baselines
- The PropCache directly caches the velocity output of the flow matching model (instead of any intermediate states inside the network), which makes the method more like a grid-aligned timestep schedule. In fact, given a fitted A(t) and d(a,t), we can directly calculate a continuous timestep schedule under certain extended PropCache cost function. A comparison between PropCache and some few-step timestep scheduling methods (e.g., GITS [1], which also minimizes a truncation error of a series of trajectory intervals, and AYS [2] & OYS [3], which directly optimize a continuous timestep schedule) on performance and budgets can better disclose this.
[1] Chen et al., On the Trajectory Regularity of ODE-based Diffusion Sampling, ICML 2024.
[2] Sabour et al., Align Your Steps: Optimizing Sampling Schedules in Diffusion Models, ICML 2024.
[3] Zhange et al., Optimize Your Sampling: Tuned Diffusion Sampling with Bayesian Optimization, arxiv 2026.
Questions for authors
I'm still confused since though PropCache is formulated as a step-caching method, its main algorithmic contribution lies in selecting the denoising steps at which model evaluations are performed, rather than introducing a new caching operator. Which is more similar to a timestep scheduling method. I think this connection should be discussed more explicitly.
Thank you for suggesting a direct fit to the measured probes. We ran this control and clarify the Table 4 cost comparison and the connection to timestep scheduling below.
1. Quality and calibration cost in Table 4
The searched exponential and power-law curves have lower mean LPIPS at k14/k18; EXP improves over measured by 9.0%/9.4%. The incremental EXP/measured generation-count ratios, 8.31x/3.80x, apply to that LPIPS slope search. Fitting directly to the probes shares the propagation measurements used by measured interpolation.
PropCache's contribution is the propagation-aware reuse price and segment objective. Endpoint gain weights the local reuse defect and sampler step size, so defects with different downstream effects receive different prices. Segment aggregation and exact-budget minimax DP then determine refresh locations. Table 4's A=1 ablation supports propagation weighting within the tested pooled protocol.
2. Direct fitting from the same measured probes
We fitted log(gain)=b0+b1*step by ordinary least squares (OLS), then compiled schedules with the same DP. OLS determines the EXP slope from probes; calibration LPIPS selects the pricing resolution and exponent. In the FLUX pooled control, both families share defects, pricing resolution, solver, exponent grid, and selection rule; each family selects its own exponent.
For 16 historical FLUX test prompts and two seeds, define Delta = LPIPS(EXP) - LPIPS(measured); negative values favor EXP:
The primary comparison, weighted equally across four budgets, favors EXP: -0.002225, 95% CI [-0.004161, -0.000295]. Bootstrap resampling keeps both seeds and all budgets together within each prompt. Measured has lower mean LPIPS at k12/k18; k18's marginal CI is [+0.000217, +0.002523]. In a separate control that selects pricing resolution and p on calibration data within each family, measured achieves 3.52% lower LPIPS at k18; k14/k22 select identical masks.
Video-model outcomes also vary:
The preferred gain representation varies by model and budget within the same propagation-pricing framework. Both representations share probe acquisition; candidate generation and selection incur separate costs. We will distinguish OLS fitting from the original slope search in the revision.
3. Connection to timestep scheduling
For FLUX with Euler updates and a held final velocity, each reuse interval satisfies x(b)=x(a)+(σ(b)−σ(a))v(a) in real arithmetic. The computed steps therefore form a grid-aligned coarse Euler schedule. The propagation price supplies an anchor-dependent cost for selecting those steps. GITS also optimizes interval-based trajectory costs, while AYS/OYS optimize sampling grids. We will make these connections explicit in the revision.
The audited Wan runtime reuses block-stack residuals added to the current input, allowing the final velocity to vary at cached steps. Its operator and feasible schedules differ from pure final-velocity holding.
We also tested a shared-schedule variant of OSS (Optimal Stepsize for Diffusion Sampling), selected using only 12 calibration prompt-seed pairs and evaluated on 176 pairs at matched NFE. OSS-minus-PC LPIPS is +0.000654 [-0.000187, +0.001524] at k14 and -0.001717 [-0.002873, -0.000730] at k18. OSS has lower LPIPS at k18; its ImageReward intervals include zero at both budgets. Direct comparisons with GITS/AYS/OYS remain pending.
Complete calibration timing and the extended continuous-cost control remain follow-up items. We will upload the updated code and experiment records and provide an anonymous access link.