Diffusion Models
Denoising Diffusion Probabilistic Models (DDPM)
Jonathan Ho, Ajay Jain, Pieter Abbeel
7
Concepts
Paper Overview
Denoising Diffusion Probabilistic Models (DDPMs) are generative models that learn to produce images by reversing a gradual noising process. The core idea: define a forward process that progressively destroys data by adding Gaussian noise over steps until the image becomes pure noise, then train a neural network to learn the reverse process — denoising one step at a time, gradually transforming noise back into coherent images.
Why diffusion models won: Unlike GANs (adversarial training → mode collapse, training instability) and VAEs (evidence lower bound → blurry outputs), DDPMs optimize a simple mean squared error loss between predicted and actual noise: . This loss is stable, well-behaved, and doesn't require adversarial dynamics or carefully balanced architectures.
Key results from the DDPM paper (Ho et al., 2020):
- FID 3.17 on CIFAR-10 (256×256), surpassing all GANs at the time
- Inception Score 9.46 on CIFAR-10
- Log-likelihood competitive with autoregressive models
DDPMs form the foundation of virtually all modern image generation systems: Stable Diffusion (Latent Diffusion + CLIP conditioning), DALL-E 2 (CLIP + diffusion prior + decoder), Midjourney, Imagen (T5 text encoder + cascaded diffusion), and Sora (video diffusion). The architecture has extended to audio (AudioLDM), 3D (DreamFusion), video (Stable Video Diffusion), and molecular design (DiffDock).
Chapter Roadmap
Click any topic to jump in
Forward Diffusion Process
Gaussian noise schedule that lets you jump to any timestep in closed form — $x_t = \sqrt{\bar\alpha_t} x_0 + \sqrt{1-\bar\alpha_t} \epsilon$.
Reverse Denoising Process
Train a noise predictor with MSE; sample by iteratively subtracting predicted noise from $x_T$ to $x_0$.
Noise Schedule
Linear vs cosine $\beta_t$ — the ramp shape controls where training signal is spent, and cosine wins on FID.
U-Net Architecture for Denoising
U-Net with time-conditioned FiLM layers and self-attention at low resolutions — the workhorse of modern diffusion.
DDIM: Faster Deterministic Sampling
Non-Markovian deterministic sampler — 20× fewer steps and invertible latent interpolation.
Classifier-Free Guidance (CFG)
Extrapolate in the direction that conditioning changes the prediction — no extra classifier needed, just one net.
Latent Diffusion: Efficient High-Resolution
Run diffusion in a VAE latent space ($64\times$ smaller) — 48× less compute, same perceptual quality.
Concept by concept
7 sections, in reading order.
Unlock the full breakdown
All 7 concepts — figures, key points, formulas and interactive demos — are part of PixelBank Premium.
- 01Forward Diffusion Process
- 02Reverse Denoising Process
- 03Noise Schedule
- 04U-Net Architecture for Denoising
- 05DDIM: Faster Deterministic Sampling
- 06Classifier-Free Guidance (CFG)
- 07Latent Diffusion: Efficient High-Resolution
Keep reading
Related Papers
Go deeper