- Rating
- 3(+1)
- Confidence
- 3(−1)
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper proposes Spectral Statistical Correction (SSC), a framework for improving few-step sampling from pretrained flow and diffusion models without updating model weights. After each solver step, SSC applies a per-coefficient affine correction in the DCT domain to match teacher statistics, followed by an optional correction of cross-channel statistics in a learned low-dimensional basis. The corrections are estimated sequentially using teacher trajectories. Experiments on FLUX.1 and SD 1.5 demonstrate improvements across several sampling methods, particularly in Teacher FID.
Critical strengths
Simple and practical statistical correction. SSC addresses systematic statistical deviations introduced by few-step sampling through analytically estimated transformations. It requires neither model fine-tuning nor backpropagation through the generative model, making it a potentially useful alternative to more expensive acceleration approaches.
Convincing improvements for standard solvers. The results for Euler, DPM++ (2M), and iPNDM (2M) show substantial improvements in Teacher FID, supported by improvements in ImageReward and HPSv2.1 on FLUX.1. These comparisons provide useful evidence that statistical correction can complement standard numerical solvers.
Critical weaknesses
-
The combinations with BézierFlow and DyWeight contain a confounding change to the sampling procedure. Section 5.1 states that these methods use shifted timesteps for model input, but that the shifts are removed when combining them with SSC because they conflict with the correction. Consequently, the reported comparisons change both the timestep treatment and the presence of SSC. They therefore do not isolate the incremental contribution of SSC. At minimum, the paper should compare each original method with the same method after removing the input-time shift, both without and with SSC. If preserving the original shift while applying SSC is infeasible, the incompatibility should be explained precisely.
-
The offline computational cost is insufficiently characterized and compared with competing methods. SSC avoids backpropagation, but still requires substantial forward computation. For FLUX.1, generating 1,000 teacher trajectories with 35 steps entails approximately 35,000 network evaluations, before accounting for sequential student calibration, PCA, and covariance estimation. The reported inference timing does not establish the total computational advantage of the method. The paper should report calibration wall-clock time, GPU-hours, peak memory, and a breakdown of teacher generation, student calibration, and statistical estimation. These costs should be compared with the training or optimization costs of DyWeight and other learned acceleration methods under comparable hardware and generation settings.
-
Typo: “timetseps” (Algorithm 1)
Questions for authors
See weaknesses above.
2 comments
Response
Thank you for the detailed response and additional experiments. The time-shift ablations clarify SSC’s independent contribution, and the timing measurements address my concern about calibration costs. With these clarifications and additional evaluation, my main concerns are addressed and I will raise my score.
Answer
BézierFlow and DyWeight time shifts evaluation (Weakness 1)
For FLUX with 5 NFE the following tables summarizes the relevant results:
Calibration cost (Weakness 2)
We performed timing experiments for 5 steps generation, using two A100 GPUs. SSC calibration wall clock time was 0.95 hours, with 1.9 GPU hours. Peak memory allocation was 41.7 GiB. Teacher generation took 0.75 wall clock hours, while fitting took 0.19 wall clock hours. SSC computations (PCA, covariance and student correction) took merely tens of seconds. For timing DyWeight training, we run the official training example script with 5 solver steps. The released checkpoint might not fully correspond to these settings, as not enough metadata is saved. Wall clock time was 5.2 hours, with 10.4 GPU hours. Peak memory allocation was 41 GiB.
The official BézierFlow implementation lacks FLUX.1. Fitting BézierFlow on FLUX.1 with the SD 3.5 settings from the paper takes 0.14 wall clock hours, and 0.29 GPU hours. However, under the settings we used for training BézierFlow (bigger train and validation sets, more epochs), fitting took 4.6 wall clock hours, and 9.2 GPU hours, with peak memory allocation of 35.8 GiB. We used these settings as they achieved a substainialy lower validation error than the SD 3.5 settings, thus making the comparison to BézierFlow fairer.