SpecKCast: Spectral Kalman Forecasting for Diffusion Acceleration
Organizations: University of Toronto · Vector Institute · AI Center–Toronto, Samsung Electronics
Abstract
Diffusion Transformers (DiTs) achieve high-fidelity image and video generation, but they suffer from substantial inference costs due to repeated transformer evaluations across many denoising steps. Feature caching reduces this cost by reusing features across denoising steps. Recent forecasting methods extend this idea by extrapolating features to skipped steps instead of reusing them. However, existing forecasting methods extrapolate the features they predict uniformly, even though the spatial-frequency components of these features change most at different stages of denoising. They also overlook that denoising progresses nonuniformly, so equal step intervals can correspond to very different amounts of change. These mismatches amplify forecast errors as more steps are skipped, limiting the achievable acceleration. We propose SpecKCast, a training-free method that forecasts the model output in the frequency domain. SpecKCast applies a 2D discrete cosine transform (DCT) to the output and tracks each coefficient with a lightweight Kalman filter along a band-specific time coordinate derived from the noise schedule. The filter tracks each coefficient's value and rate of change, and the transformer is evaluated only when the filter's forecast uncertainty exceeds a threshold. Experiments on FLUX.1-dev, Qwen-Image, Wan2.1-14B, and HunyuanVideo show that SpecKCast achieves a better trade-off between acceleration and fidelity than existing caching and forecasting methods, reaching up to 6x speedup with less than 0.05 GiB of additional memory.
Figures & tables
| FLUX.1-dev (1024 1024) | Qwen-Image (1328 1328) | ||||||||||||||||
| Acceleration | Mem. (GiB) | Quality | Image Reward | CLIP | Acceleration | Mem. (GiB) | Quality | Image Reward | CLIP | ||||||||
| NFE | Method | Latency(s) | Speedup | PSNR | SSIM | LPIPS | Latency(s) | Speedup | PSNR | SSIM | LPIPS | ||||||
| Reference | 11.68 | 1.00 | – | – | – | – | 0.98 | 27.20 | 52.22 | 1.00 | – | – | – | – | 1.24 | 29.14 | |
| Base | 3.35 | 3.48 | 0.00 | 15.30 | 0.633 | 0.423 | 0.98 | 27.51 | 14.83 | 3.52 | 0.00 | 15.18 | 0.640 | 0.393 | 1.08 | 29.19 | |
| FORA | 3.98 | 2.93 | 2.01 | 15.03 | 0.628 | 0.433 | 0.96 | 27.48 | 16.11 | 3.24 | 9.46 | 14.03 | 0.571 | 0.456 | 1.02 | 28.97 | |
| TeaCache | 3.55 | 3.29 | 0.07 | 16.86 | 0.684 | 0.355 | 1.01 | 27.57 | 15.68 | 3.33 | 0.20 | 19.42 | 0.781 | 0.229 | 1.19 | 29.36 | |
| Wan2.1-14B | HunyuanVideo | ||||||||||||||
| Acceleration | Mem. (GiB) | Quality | VBench Quality | Acceleration | Mem. (GiB) | Quality | VBench Quality | ||||||||
| NFE | Method | Latency(s) | Speedup | PSNR | SSIM | LPIPS | Latency(s) | Speedup | PSNR | SSIM | LPIPS | ||||
| 50 | Reference | 370 | 1.00 | – | – | – | – | 81.11 | 183 | 1.00 | – | – | – | – | 80.26 |
| Base | 116 | 3.20 | 0.00 | 13.95 | 0.471 | 0.518 | 79.81 | 58.3 | 3.14 | 0.00 | 17.33 | 0.641 | 0.417 | 78.38 | |
| FORA | 108.3 | 3.42 | 0.62 | 21.62 | 0.753 | 0.192 | 80.63 | 56.8 | 3.22 | 0.19 | 23.46 | 0.775 | 0.216 | 78.90 | |
| TeaCache | 105.2 | 3.52 | 0.94 | 22.13 | 0.772 | 0.191 | 80.24 | 61.2 | 2.99 | 0.37 | 20.56 | 0.709 | 0.279 | 79.35 | |
| Forecaster | Scheduler | Time variable | Frequency decomposition | Latency(s) | PSNR | SSIM | LPIPS | Image Reward | CLIP |
| Taylor | fixed | warped-logSNR | 3.46 | 21.90 | 0.811 | 0.171 | 0.978 | 27.24 | |
| Chebyshev | fixed | warped-logSNR | 3.97 | 21.10 | 0.761 | 0.252 | 0.975 | 27.66 | |
| Kalman | fixed | warped-logSNR | 3.43 | 22.09 | 0.810 | 0.178 | 0.973 | 27.27 | |
| Kalman | adaptive | raw-logSNR | 3.52 | 21.03 | 0.775 | 0.210 | 0.977 | 27.24 | |
| Kalman | adaptive | uniform step index | 3.51 | 19.54 | 0.740 | 0.256 | 0.969 | 27.28 | |
| Kalman | adaptive | warped-logSNR | 3.48 | 21.19 | 0.785 | 0.201 | 0.966 | 27.13 |
Appendix figures & tables12 assets
Supplementary material from the paper’s appendix.
Appendix
Diffusion Model Inference Acceleration
Diffusion model inference acceleration reduces the time and compute needed to generate or reconstruct outputs while preserving quality.
See all 506 papers