Scale-wise Distillation of Diffusion Models
Nikita Starodubcev, Denis Kuznedelev, Artem Babenko, Dmitry Baranchuk
TL;DR
SwD introduces a scale-wise diffusion distillation framework that progressively upscales latent resolutions during sampling, enabling next-scale predictions within a single model and reducing compute. The method combines a scale-time scheduling scheme with distribution-matching objectives, notably the novel Patch Distribution Matching (PDM), and integrates with DMD2 using LoRA-equipped teacher and fake models plus a GAN discriminator. Empirically, SwD achieves speedups close to two full-resolution steps while maintaining or exceeding baseline image fidelity on text-to-image diffusion models, with strong quantitative metrics and favorable human judgments. The work demonstrates that operating at lower resolutions at high noise levels is viable and beneficial, and it offers a practical path toward scalable, high-quality diffusion-based generation. The proposed framework is compatible with existing distillation techniques and opens avenues for adaptive scaling and potential video extension.
Abstract
We present SwD, a scale-wise distillation framework for diffusion models (DMs), which effectively employs next-scale prediction ideas for diffusion-based few-step generators. In more detail, SwD is inspired by the recent insights relating diffusion processes to the implicit spectral autoregression. We suppose that DMs can initiate generation at lower data resolutions and gradually upscale the samples at each denoising step without loss in performance while significantly reducing computational costs. SwD naturally integrates this idea into existing diffusion distillation methods based on distribution matching. Also, we enrich the family of distribution matching approaches by introducing a novel patch loss enforcing finer-grained similarity to the target distribution. When applied to state-of-the-art text-to-image diffusion models, SwD approaches the inference times of two full resolution steps and significantly outperforms the counterparts under the same computation budget, as evidenced by automated metrics and human preference studies.
