Improving Diffusion Model Efficiency Through Patching
Troy Luhman, Eric Luhman

TL;DR
This paper introduces a patching transformation for diffusion models that significantly reduces sampling time and memory usage, supported by theoretical analysis and experiments on multiple datasets.
Contribution
The paper proposes a simple patching method to improve diffusion model efficiency, addressing the often overlooked per-iteration computational cost.
Findings
Sampling time reduced significantly
Memory usage decreased notably
Effective across multiple datasets
Abstract
Diffusion models are a powerful class of generative models that iteratively denoise samples to produce data. While many works have focused on the number of iterations in this sampling procedure, few have focused on the cost of each iteration. We find that adding a simple ViT-style patching transformation can considerably reduce a diffusion model's sampling time and memory usage. We justify our approach both through an analysis of the diffusion model objective, and through empirical experiments on LSUN Church, ImageNet 256, and FFHQ 1024. We provide implementations in Tensorflow and Pytorch.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Computational Physics and Python Applications · Computer Graphics and Visualization Techniques
MethodsDiffusion
