Score-Based Generative Modeling with Critically-Damped Langevin Diffusion

By Tim Dockhorn, Arash Vahdat, Karsten Kreis. 2021

286 citations recorded by the source corpus.

Score-based generative models (SGMs) have demonstrated remarkable synthesis quality. SGMs rely on a diffusion process that gradually perturbs the data towards a tractable distribution, while the generative model learns to denoise. The complexity of this denoising task is, apart from the data distribution itself, uniquely determined by the diffusion process. We argue that current SGMs employ overly simplistic diffusions, leading to unnecessarily complex denoising processes, which limit generative modeling performance. Based on connections to statistical mechanics, we propose a novel critically-damped Langevin diffusion (CLD) and show that CLD-based SGMs achieve superior performance. CLD can be interpreted as running a joint diffusion in an extended space, where the auxiliary variables can be considered “velocities” that are coupled to the data variables as in Hamiltonian dynamics. We derive a novel score matching objective for CLD and show that the model only needs to learn the score function of the conditional distribution of the velocity given data, an easier task than learning scores of the data directly. We also derive a new sampling scheme for efficient synthesis from CLD-based diffusion models. We find that CLD outperforms previous SGMs in synthesis quality for similar network architectures and sampling compute budgets. We show that our novel sampler for CLD significantly outperforms solvers such as Euler–Maruyama. Our framework provides new insights into score-based denoising diffusion models and can be readily used for high-resolution image synthesis. VPSDE. We leave the study of CLD with maximum likelihood training for high-dimensional (image) datasets to future work.

Subfields: Computational Theory and Mathematics, Computer Vision and Pattern Recognition, Statistical and Nonlinear Physics, Generative Models, Probabilistic & Bayesian Methods

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Qinsheng Zhang
  2. Nicholas Matthew Boffi
  3. Eric Vanden-Eijnden
  4. Yongxin Chen
  5. Michael S. Albergo
  6. Sung Ju Hwang
  7. Arash Vahdat
  8. Jaehyeong Jo

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Ming-Hsuan Yang
  3. Dacheng Tao
  4. Chen Change Loy
  5. Xiaogang Wang
  6. Trevor Darrell
  7. Jitendra Malik
  8. Andrea Vedaldi

In Statistical and Nonlinear Physics

  1. Arash Vahdat
  2. Karsten Kreis
  3. Nicholas Matthew Boffi
  4. Jan Kautz
  5. Qinsheng Zhang
  6. Yongxin Chen
  7. Michael S. Albergo
  8. Eric Vanden-Eijnden

In Generative Models

  1. Arash Vahdat
  2. Karsten Kreis
  3. Robin Rombach
  4. Jan Kautz
  5. Andreas Blattmann
  6. Jiaming Song
  7. Tero Karras
  8. Ming-Hsuan Yang

In Probabilistic & Bayesian Methods

  1. Michael S. Albergo
  2. Nicholas Matthew Boffi
  3. Arash Vahdat
  4. Tom Rainforth
  5. Qinsheng Zhang
  6. Yongxin Chen
  7. Eric Vanden-Eijnden
  8. Jan Kautz

Citations in the corpus