REVIEW 5 cited by
Convergence Analysis of Discrete Diffusion Model: Exact Implementation through Uniformization
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Diffusion models have achieved huge empirical success in data generation tasks. Recently, some efforts have been made to adapt the framework of diffusion models to discrete state space, providing a more natural approach for modeling intrinsically discrete data, such as language and graphs. This is achieved by formulating both the forward noising process and the corresponding reversed process as Continuous Time Markov Chains (CTMCs). In this paper, we investigate the theoretical properties of the discrete diffusion model. Specifically, we introduce an algorithm leveraging the uniformization of continuous Markov chains, implementing transitions on random time points. Under reasonable assumptions on the learning of the discrete score function, we derive Total Variation distance and KL divergence guarantees for sampling from any distribution on a hypercube. Our results align with state-of-the-art achievements for diffusion models in $\mathbb{R}^d$ and further underscore the advantages of discrete diffusion models in comparison to the $\mathbb{R}^d$ setting.
Forward citations
Cited by 5 Pith papers
-
What Exactly Does Guidance Do in Masked Discrete Diffusion Models
With exact scores and no discretization error, CFG in 1D masked discrete diffusion samples exactly the tilted distribution; in 2D it does not, and the TV convergence rate is double-exponential in guidance strength.
-
Almost Linear Convergence under Minimal Score Assumptions: Quantized Transition Diffusion
QTD turns continuous data into binary codes and uses a Hamming-distance Markov chain with truncated uniformization to sample, provably reaching epsilon TV error with O(d ln^2(d/epsilon)) score evaluations.
-
Discrete State Diffusion Models: A Sample Complexity Perspective
Claims the first Õ(ε⁻²) sample-complexity bound for discrete-state diffusion, but the zero-approximation-error, optimization-error, and hardness lemmas carrying the proof are internally broken.
-
Solving Inverse Problems via Diffusion-Based Priors: An Approximation-Free Ensemble Sampling Approach
A weighted-particle sampler evolves the posterior through the diffusion model's reverse dynamics, with theoretical error bounds and improved image reconstructions.
-
Non-asymptotic convergence bound of conditional diffusion models
CARD's generated conditional distribution is shown to converge in Wasserstein distance to the true conditional distribution, with a separate score-estimation error bound controlled by network resolution and distributi...
Discussion (0). Sign in to comment.