Absorb and Converge: Provable Convergence Guarantee for Absorbing Discrete Diffusion Models

TL;DR

This paper provides the first theoretical convergence guarantees and error bounds for discrete diffusion models with absorbing rate matrices, demonstrating improved rates over uniform matrices and addressing unique technical challenges.

Contribution

It introduces the first finite-time error bounds and convergence analysis for absorbing diffusion models, along with new technical tools for handling their unique properties.

Findings

Established convergence guarantees for absorbing rate matrices.

Derived upper bounds on KL divergence for the forward process.

Demonstrated improved convergence rates over uniform rate matrices.

Abstract

Discrete state space diffusion models have shown significant advantages in applications involving discrete data, such as text and image generation. It has also been observed that their performance is highly sensitive to the choice of rate matrices, particularly between uniform and absorbing rate matrices. While empirical results suggest that absorbing rate matrices often yield better generation quality compared to uniform rate matrices, existing theoretical works have largely focused on the uniform rate matrices case. Notably, convergence guarantees and error analyses for absorbing diffusion models are still missing. In this work, we provide the first finite-time error bounds and convergence rate analysis for discrete diffusion models using absorbing rate matrices. We begin by deriving an upper bound on the KL divergence of the forward process, introducing a surrogate initialization distribution to address the challenge posed by the absorbing stationary distribution, which is a singleton and causes the KL divergence to be ill-defined. We then establish the first convergence guarantees for both the $\tau$-leaping and uniformization samplers under absorbing rate matrices, demonstrating improved rates over their counterparts using uniform rate matrices. Furthermore, under suitable assumptions, we provide convergence guarantees without early stopping. Our analysis introduces several new technical tools to address challenges unique to absorbing rate matrices. These include a Jensen-type argument for bounding forward process convergence, novel techniques for bounding absorbing score functions, and a non-divergent upper bound on the score near initialization that removes the need of early-stopping.