Table of Contents
Fetching ...

Unified Convergence Analysis for Score-Based Diffusion Models with Deterministic Samplers

Runjia Li, Qiwei Di, Quanquan Gu

TL;DR

This paper introduces a unified convergence analysis framework for deterministic samplers, and provides a detailed analysis of Denoising Diffusion Implicit Models (DDIM)-type samplers, which have been underexplored in previous research, achieving polynomial iteration complexity.

Abstract

Score-based diffusion models have emerged as powerful techniques for generating samples from high-dimensional data distributions. These models involve a two-phase process: first, injecting noise to transform the data distribution into a known prior distribution, and second, sampling to recover the original data distribution from noise. Among the various sampling methods, deterministic samplers stand out for their enhanced efficiency. However, analyzing these deterministic samplers presents unique challenges, as they preclude the use of established techniques such as Girsanov's theorem, which are only applicable to stochastic samplers. Furthermore, existing analysis for deterministic samplers usually focuses on specific examples, lacking a generalized approach for general forward processes and various deterministic samplers. Our paper addresses these limitations by introducing a unified convergence analysis framework. To demonstrate the power of our framework, we analyze the variance-preserving (VP) forward process with the exponential integrator (EI) scheme, achieving iteration complexity of $\tilde O(d^2/ε)$. Additionally, we provide a detailed analysis of Denoising Diffusion Implicit Models (DDIM)-type samplers, which have been underexplored in previous research, achieving polynomial iteration complexity.

Unified Convergence Analysis for Score-Based Diffusion Models with Deterministic Samplers

TL;DR

This paper introduces a unified convergence analysis framework for deterministic samplers, and provides a detailed analysis of Denoising Diffusion Implicit Models (DDIM)-type samplers, which have been underexplored in previous research, achieving polynomial iteration complexity.

Abstract

Score-based diffusion models have emerged as powerful techniques for generating samples from high-dimensional data distributions. These models involve a two-phase process: first, injecting noise to transform the data distribution into a known prior distribution, and second, sampling to recover the original data distribution from noise. Among the various sampling methods, deterministic samplers stand out for their enhanced efficiency. However, analyzing these deterministic samplers presents unique challenges, as they preclude the use of established techniques such as Girsanov's theorem, which are only applicable to stochastic samplers. Furthermore, existing analysis for deterministic samplers usually focuses on specific examples, lacking a generalized approach for general forward processes and various deterministic samplers. Our paper addresses these limitations by introducing a unified convergence analysis framework. To demonstrate the power of our framework, we analyze the variance-preserving (VP) forward process with the exponential integrator (EI) scheme, achieving iteration complexity of . Additionally, we provide a detailed analysis of Denoising Diffusion Implicit Models (DDIM)-type samplers, which have been underexplored in previous research, achieving polynomial iteration complexity.

Paper Structure

This paper contains 34 sections, 28 theorems, 333 equations.

Key Result

Theorem 3.1

Consider the 1-dimensional OU process $(x_t)_{t\in [0,T]}$ which starts at $N(0,1)$. It satisfies the following SDE Let the law of $x_t$ be denoted by $q_t$. Its reverse process $(y_t)_{t\in [0,T]}$ (see eq:deterministic reverse process) can be represented with the following ODE: For arbitrarily small $\epsilon > 0$, there exists $s_{\theta}(t,x)$, which is smooth, and anywhere $\epsilon$-close

Theorems & Definitions (34)

  • Theorem 3.1
  • Remark 3.2
  • Lemma 4.2
  • Theorem 4.4
  • Remark 4.5
  • Definition 5.1
  • Definition 5.2
  • Theorem 5.3
  • Theorem 6.5
  • Lemma 6.6
  • ...and 24 more