arXiv:2605. 17232v5 Announce Type: replace Abstract: Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology.
arXiv:2605. 17232v2 Announce Type: replace Abstract: Discrete diffusion has become a leading framework for generative modeling in various applications including language, vision, and biology.
arXiv:2602. 15008v2 Announce Type: replace Abstract: Diffusion models over discrete spaces have recently shown striking empirical success, yet their theoretical foundations remain incomplete.
arXiv:2605. 00161v2 Announce Type: replace Abstract: Diffusion language models (DLMs) are an attractive alternative to autoregressive models because they promise sublinear-time, parallel generation, yet practical gains remain elusive as high-quality samples still demand hundreds of refinement steps.
The article "Foundations of Diffusion Models in General State Spaces: A Self-Contained Introduction" presents a unified primer on diffusion models that applies to both continuous Euclidean data and discrete categorical structures. It develops discrete-time forward noising via Markov kernels and learned reverse dynamics, and connects these to continuous-time limits such as stochastic differential equations in ρ^d and continuous-time Markov chains on finite alphabets, deriving the corresponding Fokker–Planck and master equations. The work also shows how different forward corruption choices—Gaussian processes for continuous spaces and structured categorical transition kernels for discrete spaces—affect reverse dynamics and the evidence lower bound used in training, offering a layered exposition for newcomers, practitioners, and experts alike.
The paper compares the parallelism capabilities of three diffusion large language model paradigms—masked, uniform, and Gaussian diffusion. It proves that uniform and Gaussian diffusion can sample with a number of forward passes scaling with the dual total correlation of the distribution, potentially much less than the context length, whereas masked diffusion may require more passes. The study establishes a provable separation in parallelism, showing that masked diffusion’s critical windows are asymptotically narrower than those of the other two approaches.
arXiv:2606. 16610v1 Announce Type: cross Abstract: Diffusion Flow Matching (DFM) has recently emerged as a versatile framework for generative modeling, yet its theoretical convergence properties remain only partially understood.
arXiv:2607. 14522v1 Announce Type: new Abstract: We formulate reinforcement learning (RL) in continuous time with discrete state spaces and possibly arbitrary action spaces via a stochastic control approach, where the state dynamics are modeled as a controlled continuous-time Markov chain (CTMC).
arXiv:2607. 00773v1 Announce Type: new Abstract: Discrete diffusion models are widely used for learning and generating discrete distributions.
arXiv:2603. 00045v3 Announce Type: replace-cross Abstract: Diffusion language models theoretically allow for efficient parallel generation but are practically hindered by the ``factorization barrier'': the assumption that simultaneously predicted tokens are independent.
arXiv:2602. 19066v2 Announce Type: replace-cross Abstract: Diffusion Language Models (DLMs) have recently achieved strong results in text generation.
arXiv:2509.26364v3 Announce Type: replace Abstract: The Schr\"odinger bridge problem is concerned with finding a stochastic dynamical system bridging two marginal distributions that minimises a certa...
arXiv:2606. 19894v1 Announce Type: new Abstract: The remarkable success of score-based diffusion models has spurred significant efforts to establish their theoretical foundations.