Pith. sign in

REVIEW

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

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

arxiv 2312.09193 v3 pith:GRASWBDX submitted 2023-12-14 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords discretediffusionmodelsgenerationsamplingtransitionnon-markovpredetermined
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools