Diffusion model

Part of a series on
Machine learning and data mining
Paradigms Supervised learning Unsupervised learning Semi-supervised learning Self-supervised learning Reinforcement learning Meta-learning Online learning Batch learning Curriculum learning Rule-based learning Neuro-symbolic AI Neuromorphic engineering Quantum machine learning
Problems Classification Generative modeling Regression Clustering Dimensionality reduction Density estimation Anomaly detection Data cleaning AutoML Association rules Semantic analysis Structured prediction Feature engineering Feature learning Learning to rank Grammar induction Ontology learning Multimodal learning
Supervised learning (classification • regression) Apprenticeship learning Decision trees Ensembles Bagging Boosting Random forest k-NN Linear regression Naive Bayes Artificial neural networks Logistic regression Perceptron Relevance vector machine (RVM) Support vector machine (SVM)
Clustering BIRCH CURE Hierarchical k-means Fuzzy Expectation–maximization (EM) DBSCAN OPTICS Mean shift
Dimensionality reduction Factor analysis CCA ICA LDA NMF PCA PGD t-SNE SDL
Structured prediction Graphical models Bayes net Conditional random field Hidden Markov
Anomaly detection RANSAC k-NN Local outlier factor Isolation forest
Artificial neural network Autoencoder Deep learning Feedforward neural network Recurrent neural network LSTM GRU ESN reservoir computing Boltzmann machine Restricted GAN Diffusion model SOM Convolutional neural network U-Net LeNet AlexNet DeepDream Neural radiance field Transformer Vision Mamba Spiking neural network Memtransistor Electrochemical RAM (ECRAM)
Reinforcement learning Q-learning SARSA Temporal difference (TD) Multi-agent Self-play
Learning with humans Active learning Crowdsourcing Human-in-the-loop RLHF
Model diagnostics Coefficient of determination Confusion matrix Learning curve ROC curve
Mathematical foundations Kernel machines Bias–variance tradeoff Computational learning theory Empirical risk minimization Occam learning PAC learning Statistical learning VC theory
Journals and conferences ECML PKDD NeurIPS ICML ICLR IJCAI ML JMLR
Related articles Glossary of artificial intelligence List of datasets for machine-learning research List of datasets in computer vision and image processing Outline of machine learning
v t e

In machine learning, diffusion models, also known as diffusion probabilistic models or score-based generative models, are a class of latent variable generative models. A diffusion model consists of three major components: the forward process, the reverse process, and the sampling procedure.^[1] The goal of diffusion models is to learn a diffusion process for a given dataset, such that the process can generate new elements that are distributed similarly as the original dataset. A diffusion model models data as generated by a diffusion process, whereby a new datum performs a random walk with drift through the space of all possible data.^[2] A trained diffusion model can be sampled in many ways, with different efficiency and quality.

There are various equivalent formalisms, including Markov chains, denoising diffusion probabilistic models, noise conditioned score networks, and stochastic differential equations.^[3] They are typically trained using variational inference.^[4] The model responsible for denoising is typically called its "backbone". The backbone may be of any kind, but they are typically U-nets or transformers.

As of 2024^[update], diffusion models are mainly used for computer vision tasks, including image denoising, inpainting, super-resolution, image generation, and video generation. These typically involve training a neural network to sequentially denoise images blurred with Gaussian noise.^[2][5] The model is trained to reverse the process of adding noise to an image. After training to convergence, it can be used for image generation by starting with an image composed of random noise, and applying the network iteratively to denoise the image.

Diffusion-based image generators have seen widespread commercial interest, such as Stable Diffusion and DALL-E. These models typically combine diffusion models with other models, such as text-encoders and cross-attention modules to allow text-conditioned generation.^[6]

Other than computer vision, diffusion models have also found applications in natural language processing^[7] such as text generation^[8][9] and summarization,^[10] sound generation,^[11] and reinforcement learning.^[12][13]

Diffusion models were introduced in 2015 as a method to learn a model that can sample from a highly complex probability distribution. They used techniques from non-equilibrium thermodynamics, especially diffusion.^[14]

Consider, for example, how one might model the distribution of all naturally-occurring photos. Each image is a point in the space of all images, and the distribution of naturally-occurring photos is a "cloud" in space, which, by repeatedly adding noise to the images, diffuses out to the rest of the image space, until the cloud becomes all but indistinguishable from a Gaussian distribution ${\displaystyle N(0,I)}$. A model that can approximately undo the diffusion can then be used to sample from the original distribution. This is studied in "non-equilibrium" thermodynamics, as the starting distribution is not in equilibrium, unlike the final distribution.

The equilibrium distribution is the Gaussian distribution ${\displaystyle N(0,I)}$, with pdf ${\displaystyle \rho (x)\propto e^{-{\frac {1}{2}}\|x\|^{2}}}$. This is just the Maxwell–Boltzmann distribution of particles in a potential well ${\displaystyle V(x)={\frac {1}{2}}\|x\|^{2}}$ at temperature 1. The initial distribution, being very much out of equilibrium, would diffuse towards the equilibrium distribution, making biased random steps that are a sum of pure randomness (like a Brownian walker) and gradient descent down the potential well. The randomness is necessary: if the particles were to undergo only gradient descent, then they will all fall to the origin, collapsing the distribution.

The 2020 paper proposed the Denoising Diffusion Probabilistic Model (DDPM), which improves upon the previous method by variational inference.^[4][15]

To present the model, we need some notation.

• ${\displaystyle \beta _{1},...,\beta _{T}\in (0,1)}$ are fixed constants.
• ${\displaystyle \alpha _{t}:=1-\beta _{t}}$
• ${\displaystyle {\bar {\alpha }}_{t}:=\alpha _{1}\cdots \alpha _{t}}$
• ${\displaystyle \sigma _{t}:={\sqrt {1-{\bar {\alpha }}_{t}}}}$
• ${\displaystyle {\tilde {\sigma }}_{t}:={\frac {\sigma _{t-1}}{\sigma _{t}}}{\sqrt {\beta _{t}}}}$
• ${\displaystyle {\tilde {\mu }}_{t}(x_{t},x_{0}):={\frac {{\sqrt {\alpha _{t}}}(1-{\bar {\alpha }}_{t-1})x_{t}+{\sqrt {{\bar {\alpha }}_{t-1}}}(1-\alpha _{t})x_{0}}{\sigma _{t}^{2}}}}$
• ${\displaystyle N(\mu ,\Sigma )}$ is the normal distribution with mean ${\displaystyle \mu }$ and variance ${\displaystyle \Sigma }$, and ${\displaystyle N(x|\mu ,\Sigma )}$ is the probability density at ${\displaystyle x}$.
• A vertical bar denotes conditioning.

A forward diffusion process starts at some starting point ${\displaystyle x_{0}\sim q}$, where ${\displaystyle q}$ is the probability distribution to be learned, then repeatedly adds noise to it by$${\displaystyle x_{t}={\sqrt {1-\beta _{t}}}x_{t-1}+{\sqrt {\beta _{t}}}z_{t}}$$where ${\displaystyle z_{1},...,z_{T}}$ are IID samples from ${\displaystyle N(0,I)}$. This is designed so that for any starting distribution of ${\displaystyle x_{0}}$, we have ${\displaystyle \lim _{t}x_{t}|x_{0}}$ converging to ${\displaystyle N(0,I)}$.

The entire diffusion process then satisfies$${\displaystyle q(x_{0:T})=q(x_{0})q(x_{1}|x_{0})\cdots q(x_{T}|x_{T-1})=q(x_{0})N(x_{1}|{\sqrt {\alpha _{1}}}x_{0},\beta _{1}I)\cdots N(x_{T}|{\sqrt {\alpha _{T}}}x_{T-1},\beta _{T}I)}$$or$${\displaystyle \ln q(x_{0:T})=\ln q(x_{0})-\sum _{t=1}^{T}{\frac {1}{2\beta _{t}}}\|x_{t}-{\sqrt {1-\beta _{t}}}x_{t-1}\|^{2}+C}$$where ${\displaystyle C}$ is a normalization constant and often omitted. In particular, we note that ${\displaystyle x_{1:T}|x_{0}}$ is a gaussian process, which affords us considerable freedom in reparameterization. For example, by standard manipulation with gaussian process, $${\displaystyle x_{t}|x_{0}\sim N\left({\sqrt {{\bar {\alpha }}_{t}}}x_{0},\sigma _{t}^{2}I\right)}$$$${\displaystyle x_{t-1}|x_{t},x_{0}\sim N({\tilde {\mu }}_{t}(x_{t},x_{0}),{\tilde {\sigma }}_{t}^{2}I)}$$In particular, notice that for large ${\displaystyle t}$, the variable ${\displaystyle x_{t}|x_{0}\sim N\left({\sqrt {{\bar {\alpha }}_{t}}}x_{0},\sigma _{t}^{2}I\right)}$ converges to ${\displaystyle N(0,I)}$. That is, after a long enough diffusion process, we end up with some ${\displaystyle x_{T}}$ that is very close to ${\displaystyle N(0,I)}$, with all traces of the original ${\displaystyle x_{0}\sim q}$ gone.

For example, since$${\displaystyle x_{t}|x_{0}\sim N\left({\sqrt {{\bar {\alpha }}_{t}}}x_{0},\sigma _{t}^{2}I\right)}$$we can sample ${\displaystyle x_{t}|x_{0}}$ directly "in one step", instead of going through all the intermediate steps ${\displaystyle x_{1},x_{2},...,x_{t-1}}$.

The key idea of DDPM is to use a neural network parametrized by ${\displaystyle \theta }$. The network takes in two arguments ${\displaystyle x_{t},t}$, and outputs a vector ${\displaystyle \mu _{\theta }(x_{t},t)}$ and a matrix ${\displaystyle \Sigma _{\theta }(x_{t},t)}$, such that each step in the forward diffusion process can be approximately undone by ${\displaystyle x_{t-1}\sim N(\mu _{\theta }(x_{t},t),\Sigma _{\theta }(x_{t},t))}$. This then gives us a backward diffusion process ${\displaystyle p_{\theta }}$ defined by$${\displaystyle p_{\theta }(x_{T})=N(x_{T}|0,I)}$$$${\displaystyle p_{\theta }(x_{t-1}|x_{t})=N(x_{t-1}|\mu _{\theta }(x_{t},t),\Sigma _{\theta }(x_{t},t))}$$The goal now is to learn the parameters such that ${\displaystyle p_{\theta }(x_{0})}$ is as close to ${\displaystyle q(x_{0})}$ as possible. To do that, we use maximum likelihood estimation with variational inference.

The ELBO inequality states that ${\displaystyle \ln p_{\theta }(x_{0})\geq E_{x_{1:T}\sim q(\cdot |x_{0})}[\ln p_{\theta }(x_{0:T})-\ln q(x_{1:T}|x_{0})]}$, and taking one more expectation, we get$${\displaystyle E_{x_{0}\sim q}[\ln p_{\theta }(x_{0})]\geq E_{x_{0:T}\sim q}[\ln p_{\theta }(x_{0:T})-\ln q(x_{1:T}|x_{0})]}$$We see that maximizing the quantity on the right would give us a lower bound on the likelihood of observed data. This allows us to perform variational inference.

Define the loss function$${\displaystyle L(\theta ):=-E_{x_{0:T}\sim q}[\ln p_{\theta }(x_{0:T})-\ln q(x_{1:T}|x_{0})]}$$and now the goal is to minimize the loss by stochastic gradient descent. The expression may be simplified to^[16]$${\displaystyle L(\theta )=\sum _{t=1}^{T}E_{x_{t-1},x_{t}\sim q}[-\ln p_{\theta }(x_{t-1}|x_{t})]+E_{x_{0}\sim q}[D_{KL}(q(x_{T}|x_{0})\|p_{\theta }(x_{T}))]+C}$$where ${\displaystyle C}$ does not depend on the parameter, and thus can be ignored. Since ${\displaystyle p_{\theta }(x_{T})=N(x_{T}|0,I)}$ also does not depend on the parameter, the term ${\displaystyle E_{x_{0}\sim q}[D_{KL}(q(x_{T}|x_{0})\|p_{\theta }(x_{T}))]}$ can also be ignored. This leaves just ${\displaystyle L(\theta )=\sum _{t=1}^{T}L_{t}}$ with ${\displaystyle L_{t}=E_{x_{t-1},x_{t}\sim q}[-\ln p_{\theta }(x_{t-1}|x_{t})]}$ to be minimized.

Since ${\displaystyle x_{t-1}|x_{t},x_{0}\sim N({\tilde {\mu }}_{t}(x_{t},x_{0}),{\tilde {\sigma }}_{t}^{2}I)}$, this suggests that we should use ${\displaystyle \mu _{\theta }(x_{t},t)={\tilde {\mu }}_{t}(x_{t},x_{0})}$; however, the network does not have access to ${\displaystyle x_{0}}$, and so it has to estimate it instead. Now, since ${\displaystyle x_{t}|x_{0}\sim N\left({\sqrt {{\bar {\alpha }}_{t}}}x_{0},\sigma _{t}^{2}I\right)}$, we may write ${\displaystyle x_{t}={\sqrt {{\bar {\alpha }}_{t}}}x_{0}+\sigma _{t}z}$, where ${\displaystyle z}$ is some unknown gaussian noise. Now we see that estimating ${\displaystyle x_{0}}$ is equivalent to estimating ${\displaystyle z}$.

Therefore, let the network output a noise vector ${\displaystyle \epsilon _{\theta }(x_{t},t)}$, and let it predict$${\displaystyle \mu _{\theta }(x_{t},t)={\tilde {\mu }}_{t}\left(x_{t},{\frac {x_{t}-\sigma _{t}\epsilon _{\theta }(x_{t},t)}{\sqrt {{\bar {\alpha }}_{t}}}}\right)={\frac {x_{t}-\epsilon _{\theta }(x_{t},t)\beta _{t}/\sigma _{t}}{\sqrt {\alpha _{t}}}}}$$It remains to design ${\displaystyle \Sigma _{\theta }(x_{t},t)}$. The DDPM paper suggested not learning it (since it resulted in "unstable training and poorer sample quality"), but fixing it at some value ${\displaystyle \Sigma _{\theta }(x_{t},t)=\zeta _{t}^{2}I}$, where either ${\displaystyle \zeta _{t}^{2}=\beta _{t}{\text{ or }}{\tilde {\sigma }}_{t}^{2}}$ yielded similar performance.

With this, the loss simplifies to $${\displaystyle L_{t}={\frac {\beta _{t}^{2}}{2\alpha _{t}\sigma _{t}^{2}\zeta _{t}^{2}}}E_{x_{0}\sim q;z\sim N(0,I)}\left[\left\|\epsilon _{\theta }(x_{t},t)-z\right\|^{2}\right]+C}$$which may be minimized by stochastic gradient descent. The paper noted empirically that an even simpler loss function$${\displaystyle L_{simple,t}=E_{x_{0}\sim q;z\sim N(0,I)}\left[\left\|\epsilon _{\theta }(x_{t},t)-z\right\|^{2}\right]}$$resulted in better models.

After a noise prediction network is trained, it can be used for generating data points in the original distribution in a loop as follows:

1. Compute the noise estimate ${\displaystyle \epsilon \leftarrow \epsilon _{\theta }(x_{t},t)}$
2. Compute the original data estimate ${\displaystyle {\tilde {x}}_{0}\leftarrow (x_{t}-\sigma _{t}\epsilon )/{\sqrt {{\bar {\alpha }}_{t}}}}$
3. Sample the previous data ${\displaystyle x_{t-1}\sim N({\tilde {\mu }}_{t}(x_{t},{\tilde {x}}_{0}),{\tilde {\sigma }}_{t}^{2}I)}$
4. Change time ${\displaystyle t\leftarrow t-1}$

Score-based generative model is another formulation of diffusion modelling. They are also called noise conditional score network (NCSN) or score-matching with Langevin dynamics (SMLD).^{[17][18][19][20]}

Consider the problem of image generation. Let ${\displaystyle x}$ represent an image, and let ${\displaystyle q(x)}$ be the probability distribution over all possible images. If we have ${\displaystyle q(x)}$ itself, then we can say for certain how likely a certain image is. However, this is intractable in general.

Most often, we are uninterested in knowing the absolute probability of a certain image. Instead, we are usually only interested in knowing how likely a certain image is compared to its immediate neighbors — e.g. how much more likely is an image of cat compared to some small variants of it? Is it more likely if the image contains two whiskers, or three, or with some Gaussian noise added?

Consequently, we are actually quite uninterested in ${\displaystyle q(x)}$ itself, but rather, ${\displaystyle \nabla _{x}\ln q(x)}$. This has two major effects:

• One, we no longer need to normalize ${\displaystyle q(x)}$, but can use any ${\displaystyle {\tilde {q}}(x)=Cq(x)}$, where ${\displaystyle C=\int {\tilde {q}}(x)dx>0}$ is any unknown constant that is of no concern to us.
• Two, we are comparing ${\displaystyle q(x)}$ neighbors ${\displaystyle q(x+dx)}$, by ${\displaystyle {\frac {q(x)}{q(x+dx)}}=e^{-\langle \nabla _{x}\ln q,dx\rangle }}$

Let the score function be ${\displaystyle s(x):=\nabla _{x}\ln q(x)}$; then consider what we can do with ${\displaystyle s(x)}$.

As it turns out, ${\displaystyle s(x)}$ allows us to sample from ${\displaystyle q(x)}$ using thermodynamics. Specifically, if we have a potential energy function ${\displaystyle U(x)=-\ln q(x)}$, and a lot of particles in the potential well, then the distribution at thermodynamic equilibrium is the Boltzmann distribution ${\displaystyle q_{U}(x)\propto e^{-U(x)/k_{B}T}=q(x)^{1/k_{B}T}}$. At temperature ${\displaystyle k_{B}T=1}$, the Boltzmann distribution is exactly ${\displaystyle q(x)}$.

Therefore, to model ${\displaystyle q(x)}$, we may start with a particle sampled at any convenient distribution (such as the standard gaussian distribution), then simulate the motion of the particle forwards according to the Langevin equation $${\displaystyle dx_{t}=-\nabla _{x_{t}}U(x_{t})dt+dW_{t}}$$ and the Boltzmann distribution is, by Fokker-Planck equation, the unique thermodynamic equilibrium. So no matter what distribution ${\displaystyle x_{0}}$ has, the distribution of ${\displaystyle x_{t}}$ converges in distribution to ${\displaystyle q}$ as ${\displaystyle t\to \infty }$.

Given a density ${\displaystyle q}$, we wish to learn a score function approximation ${\displaystyle f_{\theta }\approx \nabla \ln q}$. This is score matching.^[21] Typically, score matching is formalized as minimizing Fisher divergence function ${\displaystyle E_{q}[\|f_{\theta }(x)-\nabla \ln q(x)\|^{2}]}$. By expanding the integral, and performing an integration by parts, $${\displaystyle E_{q}[\|f_{\theta }(x)-\nabla \ln q(x)\|^{2}]=E_{q}[\|f_{\theta }\|^{2}+2\nabla ^{2}\cdot f_{\theta }]+C}$$giving us a loss function, also known as the Hyvärinen scoring rule, that can be minimized by stochastic gradient descent.

Suppose we need to model the distribution of images, and we want ${\displaystyle x_{0}\sim N(0,I)}$, a white-noise image. Now, most white-noise images do not look like real images, so ${\displaystyle q(x_{0})\approx 0}$ for large swaths of ${\displaystyle x_{0}\sim N(0,I)}$. This presents a problem for learning the score function, because if there are no samples around a certain point, then we can't learn the score function at that point. If we do not know the score function ${\displaystyle \nabla _{x_{t}}\ln q(x_{t})}$ at that point, then we cannot impose the time-evolution equation on a particle:$${\displaystyle dx_{t}=\nabla _{x_{t}}\ln q(x_{t})dt+dW_{t}}$$To deal with this problem, we perform annealing. If ${\displaystyle q}$ is too different from a white-noise distribution, then progressively add noise until it is indistinguishable from one. That is, we perform a forward diffusion, then learn the score function, then use the score function to perform a backward diffusion.

Consider again the forward diffusion process, but this time in continuous time:$${\displaystyle x_{t}={\sqrt {1-\beta _{t}}}x_{t-1}+{\sqrt {\beta _{t}}}z_{t}}$$By taking the ${\displaystyle \beta _{t}\to \beta (t)dt,{\sqrt {dt}}z_{t}\to dW_{t}}$ limit, we obtain a continuous diffusion process, in the form of a stochastic differential equation:$${\displaystyle dx_{t}=-{\frac {1}{2}}\beta (t)x_{t}dt+{\sqrt {\beta (t)}}dW_{t}}$$where ${\displaystyle W_{t}}$ is a Wiener process (multidimensional Brownian motion).

Now, the equation is exactly a special case of the overdamped Langevin equation$${\displaystyle dx_{t}=-{\frac {D}{k_{B}T}}(\nabla _{x}U)dt+{\sqrt {2D}}dW_{t}}$$where ${\displaystyle D}$ is diffusion tensor, ${\displaystyle T}$ is temperature, and ${\displaystyle U}$ is potential energy field. If we substitute in ${\displaystyle D={\frac {1}{2}}\beta (t)I,k_{B}T=1,U={\frac {1}{2}}\|x\|^{2}}$, we recover the above equation. This explains why the phrase "Langevin dynamics" is sometimes used in diffusion models.

Now the above equation is for the stochastic motion of a single particle. Suppose we have a cloud of particles distributed according to ${\displaystyle q}$ at time ${\displaystyle t=0}$, then after a long time, the cloud of particles would settle into the stable distribution of ${\displaystyle N(0,I)}$. Let ${\displaystyle \rho _{t}}$ be the density of the cloud of particles at time ${\displaystyle t}$, then we have$${\displaystyle \rho _{0}=q;\quad \rho _{T}\approx N(0,I)}$$and the goal is to somehow reverse the process, so that we can start at the end and diffuse back to the beginning.

By Fokker-Planck equation, the density of the cloud evolves according to$${\displaystyle \partial _{t}\ln \rho _{t}={\frac {1}{2}}\beta (t)\left(n+(x+\nabla \ln \rho _{t})\cdot \nabla \ln \rho _{t}+\Delta \ln \rho _{t}\right)}$$where ${\displaystyle n}$ is the dimension of space, and ${\displaystyle \Delta }$ is the Laplace operator.

If we have solved ${\displaystyle \rho _{t}}$ for time ${\displaystyle t\in [0,T]}$, then we can exactly reverse the evolution of the cloud. Suppose we start with another cloud of particles with density ${\displaystyle \nu _{0}=\rho _{T}}$, and let the particles in the cloud evolve according to$${\displaystyle dy_{t}={\frac {1}{2}}\beta (T-t)y_{t}dt+\beta (T-t)\underbrace {\nabla _{y_{t}}\ln \rho _{T-t}\left(y_{t}\right)} _{\text{score function }}dt+{\sqrt {\beta (T-t)}}dW_{t}}$$then by plugging into the Fokker-Planck equation, we find that ${\displaystyle \partial _{t}\rho _{T-t}=\partial _{t}\nu _{t}}$. Thus this cloud of points is the original cloud, evolving backwards.^[22]

At the continuous limit, $${\displaystyle {\bar {\alpha }}_{t}=(1-\beta _{1})\cdots (1-\beta _{t})=e^{\sum _{i}\ln(1-\beta _{i})}\to e^{-\int _{0}^{t}\beta (t)dt}}$$ and so $${\displaystyle x_{t}|x_{0}\sim N\left(e^{-{\frac {1}{2}}\int _{0}^{t}\beta (t)dt}x_{0},\left(1-e^{-\int _{0}^{t}\beta (t)dt}\right)I\right)}$$ In particular, we see that we can directly sample from any point in the continuous diffusion process without going through the intermediate steps, by first sampling ${\displaystyle x_{0}\sim q,z\sim N(0,I)}$, then get ${\displaystyle x_{t}=e^{-{\frac {1}{2}}\int _{0}^{t}\beta (t)dt}x_{0}+\left(1-e^{-\int _{0}^{t}\beta (t)dt}\right)z}$. That is, we can quickly sample ${\displaystyle x_{t}\sim \rho _{t}}$ for any ${\displaystyle t\geq 0}$.

Now, define a certain probability distribution ${\displaystyle \gamma }$ over ${\displaystyle [0,\infty )}$, then the score-matching loss function is defined as the expected Fisher divergence: $${\displaystyle L(\theta )=E_{t\sim \gamma ,x_{t}\sim \rho _{t}}[\|f_{\theta }(x_{t},t)\|^{2}+2\nabla \cdot f_{\theta }(x_{t},t)]}$$ After training, ${\displaystyle f_{\theta }(x_{t},t)\approx \nabla \ln \rho _{t}}$, so we can perform the backwards diffusion process by first sampling ${\displaystyle x_{T}\sim N(0,I)}$, then integrating the SDE from ${\displaystyle t=T}$ to ${\displaystyle t=0}$: $${\displaystyle x_{t-dt}=x_{t}+{\frac {1}{2}}\beta (t)x_{t}dt+\beta (t)f_{\theta }(x_{t},t)dt+{\sqrt {\beta (t)}}dW_{t}}$$ This may be done by any SDE integration method, such as Euler–Maruyama method.

The name "noise conditional score network" is explained thus:

• "network", because ${\displaystyle f_{\theta }}$ is implemented as a neural network.
• "score", because the output of the network is interpreted as approximating the score function ${\displaystyle \nabla \ln \rho _{t}}$.
• "noise conditional", because ${\displaystyle \rho _{t}}$ is equal to ${\displaystyle \rho _{0}}$ blurred by an added gaussian noise that increases with time, and so the score function depends on the amount of noise added.

DDPM and score-based generative models are equivalent.^[18][2][23] This means that a network trained using DDPM can be used as a NCSN, and vice versa.

We know that ${\displaystyle x_{t}|x_{0}\sim N\left({\sqrt {{\bar {\alpha }}_{t}}}x_{0},\sigma _{t}^{2}I\right)}$, so by Tweedie's formula, we have $${\displaystyle \nabla _{x_{t}}\ln q(x_{t})={\frac {1}{\sigma _{t}^{2}}}(-x_{t}+{\sqrt {{\bar {\alpha }}_{t}}}E_{q}[x_{0}|x_{t}])}$$ As described previously, the DDPM loss function is ${\displaystyle \sum _{t}L_{simple,t}}$ with $${\displaystyle L_{simple,t}=E_{x_{0}\sim q;z\sim N(0,I)}\left[\left\|\epsilon _{\theta }(x_{t},t)-z\right\|^{2}\right]}$$ where ${\displaystyle x_{t}={\sqrt {{\bar {\alpha }}_{t}}}x_{0}+\sigma _{t}z}$. By a change of variables, $${\displaystyle L_{simple,t}=E_{x_{0},x_{t}\sim q}\left[\left\|\epsilon _{\theta }(x_{t},t)-{\frac {x_{t}-{\sqrt {{\bar {\alpha }}_{t}}}x_{0}}{\sigma _{t}}}\right\|^{2}\right]=E_{x_{t}\sim q,x_{0}\sim q(\cdot |x_{t})}\left[\left\|\epsilon _{\theta }(x_{t},t)-{\frac {x_{t}-{\sqrt {{\bar {\alpha }}_{t}}}x_{0}}{\sigma _{t}}}\right\|^{2}\right]}$$ and the term inside becomes a least squares regression, so if the network actually reaches the global minimum of loss, then we have ${\displaystyle \epsilon _{\theta }(x_{t},t)={\frac {x_{t}-{\sqrt {{\bar {\alpha }}_{t}}}E_{q}[x_{0}|x_{t}]}{\sigma _{t}}}=-\sigma _{t}\nabla _{x_{t}}\ln q(x_{t})}$

Thus, a score-based network can be used for denoising diffusion.

Conversely, the continuous limit ${\displaystyle x_{t-1}=x_{t-dt},\beta _{t}=\beta (t)dt,z_{t}{\sqrt {dt}}=dW_{t}}$ of the backward equation $${\displaystyle x_{t-1}={\frac {x_{t}}{\sqrt {\alpha _{t}}}}-{\frac {\beta _{t}}{\sigma _{t}{\sqrt {\alpha _{t}}}}}\epsilon _{\theta }(x_{t},t)+{\sqrt {\beta _{t}}}z_{t};\quad z_{t}\sim N(0,I)}$$ gives us precisely the same equation as score-based diffusion: $${\displaystyle x_{t-dt}=x_{t}(1+\beta (t)dt/2)+\beta (t)\nabla _{x_{t}}\ln q(x_{t})dt+{\sqrt {\beta (t)}}dW_{t}}$$Thus, a denoising network can be used as for score-based diffusion.

In DDPM, the sequence of numbers ${\displaystyle 0=\sigma _{0}<\sigma _{1}<\cdots <\sigma _{T}<1}$ is called a (discrete time) noise schedule. In general, consider a strictly increasing monotonic function ${\displaystyle \sigma }$ of type ${\displaystyle \mathbb {R} \to (0,1)}$, such as the sigmoid function. In that case, a noise schedule is a sequence of real numbers ${\displaystyle \lambda _{1}<\lambda _{2}<\cdots <\lambda _{T}}$. It then defines a sequence of noises ${\displaystyle \sigma _{t}:=\sigma (\lambda _{t})}$, which then derives the other quantities ${\displaystyle \beta _{t}=1-{\frac {1-\sigma _{t}^{2}}{1-\sigma _{t-1}^{2}}}}$.

In order to use arbitrary noise schedules, instead of training a noise prediction model ${\displaystyle \epsilon _{\theta }(x_{t},t)}$, one trains ${\displaystyle \epsilon _{\theta }(x_{t},\sigma _{t})}$.

Similarly, for the noise conditional score network, instead of training ${\displaystyle f_{\theta }(x_{t},t)}$, one trains ${\displaystyle f_{\theta }(x_{t},\sigma _{t})}$.

The original DDPM method for generating images is slow, since the forward diffusion process usually takes ${\displaystyle T\sim 1000}$ to make the distribution of ${\displaystyle x_{T}}$ to appear close to gaussian. However this means the backward diffusion process also take 1000 steps. Unlike the forward diffusion process, which can skip steps as ${\displaystyle x_{t}|x_{0}}$ is gaussian for all ${\displaystyle t\geq 1}$, the backward diffusion process does not allow skipping steps. For example, to sample ${\displaystyle x_{t-2}|x_{t-1}\sim N(\mu _{\theta }(x_{t-1},t-1),\Sigma _{\theta }(x_{t-1},t-1))}$ requires the model to first sample ${\displaystyle x_{t-1}}$. Attempting to directly sample ${\displaystyle x_{t-2}|x_{t}}$ would require us to marginalize out ${\displaystyle x_{t-1}}$, which is generally intractable.

DDIM^[24] is a method to take any model trained on DDPM loss, and use it to sample with some steps skipped, sacrificing an adjustable amount of quality. If we generate the Markovian chain case in DDPM to non-Markovian case, DDIM corresponds to the case that the reverse process has variance equals to 0. In other words, the reverse process (and also the forward process) is deterministic. When using fewer sampling steps, DDIM outperforms DDPM.

In detail, the DDIM sampling method is as follows. Start with the forward diffusion process ${\displaystyle x_{t}={\sqrt {{\bar {\alpha }}_{t}}}x_{0}+\sigma _{t}\epsilon }$. Then, during the backward denoising process, given ${\displaystyle x_{t},\epsilon _{\theta }(x_{t},t)}$, the original data is estimated as $${\displaystyle x_{0}'={\frac {x_{t}-\sigma _{t}\epsilon _{\theta }(x_{t},t)}{\sqrt {{\bar {\alpha }}_{t}}}}}$$then the backward diffusion process can jump to any step ${\displaystyle 0\leq s<t}$, and the next denoised sample is $${\displaystyle x_{s}={\sqrt {{\bar {\alpha }}_{s}}}x_{0}'+{\sqrt {\sigma _{s}^{2}-(\sigma '_{s})^{2}}}\epsilon _{\theta }(x_{t},t)+\sigma _{s}'\epsilon }$$where ${\displaystyle \sigma _{s}'}$ is an arbitrary real number within the range ${\displaystyle [0,\sigma _{s}]}$, and ${\displaystyle \epsilon \sim N(0,I)}$ is a newly sampled gaussian noise.^[16] If all ${\displaystyle \sigma _{s}'=0}$, then the backward process becomes deterministic, and this special case of DDIM is also called "DDIM". The original paper noted that when the process is deterministic, samples generated with only 20 steps are already very similar to ones generated with 1000 steps on the high-level.

The original paper recommended defining a single "eta value" ${\displaystyle \eta \in [0,1]}$, such that ${\displaystyle \sigma _{s}'=\eta {\tilde {\sigma }}_{s}}$. When ${\displaystyle \eta =1}$, this is the original DDPM. When ${\displaystyle \eta =0}$, this is the fully deterministic DDIM. For intermediate values, the process interpolates between them.

By the equivalence, the DDIM algorithm also applies for score-based diffusion models.

Since the diffusion model is a general method for modelling probability distributions, if one wants to model a distribution over images, one can first encode the images into a lower-dimensional space by an encoder, then use a diffusion model to model the distribution over encoded images. Then to generate an image, one can sample from the diffusion model, then use a decoder to decode it into an image.^[25]

The encoder-decoder pair is most often a variational autoencoder (VAE).

^[26] proposed various architectural improvements. For example, they proposed log-space interpolation during backward sampling. Instead of sampling from ${\displaystyle x_{t-1}\sim N({\tilde {\mu }}_{t}(x_{t},{\tilde {x}}_{0}),{\tilde {\sigma }}_{t}^{2}I)}$, they recommended sampling from ${\displaystyle N({\tilde {\mu }}_{t}(x_{t},{\tilde {x}}_{0}),(\sigma _{t}^{v}{\tilde {\sigma }}_{t}^{1-v})^{2}I)}$ for a learned parameter ${\displaystyle v}$.

In the v-prediction formalism, the noising formula ${\displaystyle x_{t}={\sqrt {{\bar {\alpha }}_{t}}}x_{0}+{\sqrt {1-{\bar {\alpha }}_{t}}}\epsilon _{t}}$ is reparameterised by an angle ${\displaystyle \phi _{t}}$ such that ${\displaystyle \cos \phi _{t}={\sqrt {{\bar {\alpha }}_{t}}}}$ and a "velocity" defined by ${\displaystyle \cos \phi _{t}\epsilon _{t}-\sin \phi _{t}x_{0}}$. The network is trained to predict the velocity ${\displaystyle {\hat {v}}_{\theta }}$, and denoising is by ${\displaystyle x_{\phi _{t}-\delta }=\cos(\delta )\;x_{\phi _{t}}-\sin(\delta ){\hat {v}}_{\theta }\;(x_{\phi _{t}})}$.^[27] This parameterization was found to improve performance, as the model can be trained to reach total noise (i.e. ${\displaystyle \phi _{t}=90^{\circ }}$) and then reverse it, whereas the standard parameterization never reaches total noise since ${\displaystyle {\sqrt {{\bar {\alpha }}_{t}}}>0}$ is always true.^[28]

Classifier guidance was proposed in 2021 to improve class-conditional generation by using a classifier. The original publication used CLIP text encoders to improve text-conditional image generation.^[29]

Suppose we wish to sample not from the entire distribution of images, but conditional on the image description. We don't want to sample a generic image, but an image that fits the description "black cat with red eyes". Generally, we want to sample from the distribution ${\displaystyle p(x|y)}$, where ${\displaystyle x}$ ranges over images, and ${\displaystyle y}$ ranges over classes of images (a description "black cat with red eyes" is just a very detailed class, and a class "cat" is just a very vague description).

Taking the perspective of the noisy channel model, we can understand the process as follows: To generate an image ${\displaystyle x}$ conditional on description ${\displaystyle y}$, we imagine that the requester really had in mind an image ${\displaystyle x}$, but the image is passed through a noisy channel and came out garbled, as ${\displaystyle y}$. Image generation is then nothing but inferring which ${\displaystyle x}$ the requester had in mind.

In other words, conditional image generation is simply "translating from a textual language into a pictorial language". Then, as in noisy-channel model, we use Bayes theorem to get $${\displaystyle p(x|y)\propto p(y|x)p(x)}$$ in other words, if we have a good model of the space of all images, and a good image-to-class translator, we get a class-to-image translator "for free". In the equation for backward diffusion, the score ${\displaystyle \nabla \ln p(x)}$ can be replaced by $${\displaystyle \nabla _{x}\ln p(x|y)=\underbrace {\nabla _{x}\ln p(x)} _{\text{score}}+\underbrace {\nabla _{x}\ln p(y|x)} _{\text{classifier guidance}}}$$ where ${\displaystyle \nabla _{x}\ln p(x)}$ is the score function, trained as previously described, and ${\displaystyle \nabla _{x}\ln p(y|x)}$ is found by using a differentiable image classifier.

During the diffusion process, we need to condition on the time, giving$${\displaystyle \nabla _{x_{t}}\ln p(x_{t}|y,t)=\nabla _{x_{t}}\ln p(y|x_{t},t)+\nabla _{x_{t}}\ln p(x_{t}|t)}$$Although, usually the classifier model does not depend on time, in which case ${\displaystyle p(y|x_{t},t)=p(y|x_{t})}$.

Classifier guidance is defined for the gradient of score function, thus for score-based diffusion network, but as previously noted, score-based diffusion models are equivalent to denoising models by ${\displaystyle \epsilon _{\theta }(x_{t},t)=-\sigma _{t}\nabla _{x_{t}}\ln p(x_{t}|t)}$, and similarly, ${\displaystyle \epsilon _{\theta }(x_{t},y,t)=-\sigma _{t}\nabla _{x_{t}}\ln p(x_{t}|y,t)}$. Therefore, classifier guidance works for denoising diffusion as well, using the modified noise prediction:^[29]$${\displaystyle \epsilon _{\theta }(x_{t},y,t)=\epsilon _{\theta }(x_{t},t)-\underbrace {\sigma _{t}\nabla _{x_{t}}\ln p(y|x_{t},t)} _{\text{classifier guidance}}}$$

The classifier-guided diffusion model samples from ${\displaystyle p(x|y)}$, which is concentrated around the maximum a posteriori estimate ${\displaystyle \arg \max _{x}p(x|y)}$. If we want to force the model to move towards the maximum likelihood estimate ${\displaystyle \arg \max _{x}p(y|x)}$, we can use $${\displaystyle p_{\gamma }(x|y)\propto p(y|x)^{\gamma }p(x)}$$ where ${\displaystyle \gamma >0}$ is interpretable as inverse temperature. In the context of diffusion models, it is usually called the guidance scale. A high ${\displaystyle \gamma }$ would force the model to sample from a distribution concentrated around ${\displaystyle \arg \max _{x}p(y|x)}$. This sometimes improves quality of generated images.^[29]

This gives a modification to the previous equation:$${\displaystyle \nabla _{x}\ln p_{\beta }(x|y)=\nabla _{x}\ln p(x)+\gamma \nabla _{x}\ln p(y|x)}$$For denoising models, it corresponds to^[30]$${\displaystyle \epsilon _{\theta }(x_{t},y,t)=\epsilon _{\theta }(x_{t},t)-\gamma \sigma _{t}\nabla _{x_{t}}\ln p(y|x_{t},t)}$$

If we do not have a classifier ${\displaystyle p(y|x)}$, we could still extract one out of the image model itself:^[30] $${\displaystyle \nabla _{x}\ln p_{\gamma }(x|y)=(1-\gamma )\nabla _{x}\ln p(x)+\gamma \nabla _{x}\ln p(x|y)}$$ Such a model is usually trained by presenting it with both ${\displaystyle (x,y)}$ and ${\displaystyle (x,{\rm {None}})}$, allowing it to model both ${\displaystyle \nabla _{x}\ln p(x|y)}$ and ${\displaystyle \nabla _{x}\ln p(x)}$.

Note that for CFG, the diffusion model cannot be merely a generative model of the entire data distribution ${\displaystyle \nabla _{x}\ln p(x)}$. It must be a conditional generative model ${\displaystyle \nabla _{x}\ln p(x|y)}$. For example, in stable diffusion, the diffusion backbone takes as input both a noisy model ${\displaystyle x_{t}}$, a time ${\displaystyle t}$, and a conditioning vector ${\displaystyle y}$ (such as a vector encoding a text prompt), and produces a noise prediction ${\displaystyle \epsilon _{\theta }(x_{t},y,t)}$.

For denoising models, it corresponds to$${\displaystyle \epsilon _{\theta }(x_{t},y,t,\gamma )=\epsilon _{\theta }(x_{t},t)+\gamma (\epsilon _{\theta }(x_{t},y,t)-\epsilon _{\theta }(x_{t},t))}$$As sampled by DDIM, the algorithm can be written as^[31]$${\displaystyle {\begin{aligned}\epsilon _{\text{uncond}}&\leftarrow \epsilon _{\theta }(x_{t},t)\\\epsilon _{\text{cond}}&\leftarrow \epsilon _{\theta }(x_{t},t,c)\\\epsilon _{\text{CFG}}&\leftarrow \epsilon _{\text{uncond}}+\gamma (\epsilon _{\text{cond}}-\epsilon _{\text{uncond}})\\x_{0}&\leftarrow (x_{t}-\sigma _{t}\epsilon _{\text{CFG}})/{\sqrt {1-\sigma _{t}^{2}}}\\x_{s}&\leftarrow {\sqrt {1-\sigma _{s}^{2}}}x_{0}+{\sqrt {\sigma _{s}^{2}-(\sigma _{s}')^{2}}}\epsilon _{\text{uncond}}+\sigma _{s}'\epsilon \\\end{aligned}}}$$A similar technique applies to language model sampling. Also, if the unconditional generation ${\displaystyle \epsilon _{\text{uncond}}\leftarrow \epsilon _{\theta }(x_{t},t)}$ is replaced by ${\displaystyle \epsilon _{\text{neg cond}}\leftarrow \epsilon _{\theta }(x_{t},t,c')}$, then it results in negative prompting, which pushes the generation away from ${\displaystyle c'}$ condition.^[32][33]

Given a diffusion model, one may regard it either as a continuous process, and sample from it by integrating a SDE, or one can regard it as a discrete process, and sample from it by iterating the discrete steps. The choice of the "noise schedule" ${\displaystyle \beta _{t}}$ can also affect the quality of samples. A noise schedule is a function that sends a natural number to a noise level: $${\displaystyle t\mapsto \beta _{t},\quad t\in \{1,2,\dots \},\beta \in (0,1)}$$A noise schedule is more often specified by a map ${\displaystyle t\mapsto \sigma _{t}}$. The two definitions are equivalent, since ${\displaystyle \beta _{t}=1-{\frac {1-\sigma _{t}^{2}}{1-\sigma _{t-1}^{2}}}}$.

In the DDPM perspective, one can use the DDPM itself (with noise), or DDIM (with adjustable amount of noise). The case where one adds noise is sometimes called ancestral sampling.^[34] One can interpolate between noise and no noise. The amount of noise is denoted ${\displaystyle \eta }$ ("eta value") in the DDIM paper, with ${\displaystyle \eta =0}$ denoting no noise (as in deterministic DDIM), and ${\displaystyle \eta =1}$ denoting full noise (as in DDPM).

In the perspective of SDE, one can use any of the numerical integration methods, such as Euler–Maruyama method, Heun's method, linear multistep methods, etc. Just as in the discrete case, one can add an adjustable amount of noise during the integration.

A survey and comparison of samplers in the context of image generation is in.^[35]

Notable variants include^[36] Poisson flow generative model,^[37] consistency model,^[38] critically-damped Langevin diffusion,^[39] GenPhys,^[40] cold diffusion,^[41] discrete diffusion,^[42][43] etc.

Abstractly speaking, the idea of diffusion model is to take an unknown probability distribution (the distribution of natural-looking images), then progressively convert it to a known probability distribution (standard gaussian distribution), by building an absolutely continuous probability path connecting them. The probability path is in fact defined implicitly by the score function ${\displaystyle \nabla \ln p_{t}}$.

In denoising diffusion models, the forward process adds noise, and the backward process removes noise. Both the forward and backward processes are SDEs, though the forward process is integrable in closed-form, so it can be done at no computational cost. The backward process is not integrable in closed-form, so it must be integrated step-by-step by standard SDE solvers, which can be very expensive. The probability path in diffusions model is defined through an Itô process and one can retrieve the deterministic process by using the Probability ODE flow formulation.^[2]

In flow-based diffusion models, the forward process is a deterministic flow along a time-dependent vector field, and the backward process is also a deterministic flow along the same vector field, but going backwards. Both processes are solutions to ODEs. If the vector field is well-behaved, the ODE will also be well-behaved.

Given two distributions ${\displaystyle \pi _{0}}$ and ${\displaystyle \pi _{1}}$, a flow-based model is a time-dependent velocity field ${\displaystyle v_{t}(x)}$ in ${\displaystyle [0,1]\times \mathbb {R} ^{d}}$, such that if we start by sampling a point ${\displaystyle x\sim \pi _{0}}$, and let it move according to the velocity field: $${\displaystyle {\frac {d}{dt}}\phi _{t}(x)=v_{t}(\phi _{t}(x))\quad t\in [0,1],\quad {\text{starting from }}\phi _{0}(x)=x}$$ we end up with a point ${\displaystyle x_{1}\sim \pi _{1}}$. The solution ${\displaystyle \phi _{t}}$ of the above ODE define a probability path ${\displaystyle p_{t}=[\phi _{t}]_{\#}\pi _{0}}$ by the pushforward measure operator. In particular, ${\displaystyle [\phi _{1}]_{\#}\pi _{0}=\pi _{1}}$.

The probability path and the velocity field also satisfy the continuity equation, in the sense of probability distribution: $${\displaystyle \partial _{t}p_{t}+\nabla \cdot (v_{t}p_{t})=0}$$ To construct a probability path, we start by construct a conditional probability path