English

Fast Sampling via Discrete Non-Markov Diffusion Models with Predetermined Transition Time

Machine Learning 2024-12-09 v3 Artificial Intelligence Machine Learning

Abstract

Discrete diffusion models have emerged as powerful tools for high-quality data generation. Despite their success in discrete spaces, such as text generation tasks, the acceleration of discrete diffusion models remains under-explored. In this paper, we propose discrete non-Markov diffusion models (DNDM), which naturally induce the predetermined transition time set. This enables a training-free sampling algorithm that significantly reduces the number of function evaluations (i.e., calls to the neural network), making the sampling process much faster. Furthermore, we study the transition from finite to infinite step sampling, offering new insights into bridging the gap between discrete and continuous-time processes for discrete diffusion models. Extensive experiments on natural language generation and machine translation tasks demonstrate the superior performance of our method in terms of both generation speed and sample quality compared to existing methods for discrete diffusion models.

Keywords

Cite

@article{arxiv.2312.09193,
  title  = {Fast Sampling via Discrete Non-Markov Diffusion Models with Predetermined Transition Time},
  author = {Zixiang Chen and Huizhuo Yuan and Yongqian Li and Yiwen Kou and Junkai Zhang and Quanquan Gu},
  journal= {arXiv preprint arXiv:2312.09193},
  year   = {2024}
}

Comments

36 pages, 5 figures, 13 tables. In NeurIPS 2024

R2 v1 2026-06-28T13:51:24.064Z