Skip to content

Discrete Diffusion Models: A Unified Framework from Tokenization to Generation

Jul 2026 · arXiv.org · Vol abs/2607.13431 · 0 citations
Computer Science

TL;DR

This work introduces a unified conceptual framework that views discrete diffusion models through the construction of the underlying discrete state space, and exposes common design trade-offs across training objectives, inference algorithms, scaling behavior, systems optimization, and evaluation protocols.

Abstract

Discrete denoising diffusion models (DDMs) have recently emerged as a compelling alternative to autoregressive (AR) modeling for discrete data, offering parallel generation and iterative global refinement capabilities. Unlike continuous diffusion, where the state space is fixed, DDMs are fundamentally shaped by how the discrete state space is constructed: the tokenization scheme, the vocabulary topology, and domain-specific structural alphabets. This work introduces a unified conceptual framework that views discrete diffusion models through the construction of the underlying discrete state space. Within this framework, existing formulations, including transition-matrix, masking/absorbing-state, and score/ratio-based approaches, emerge as different instantiations of a common design space. The framework further exposes common design trade-offs across training objectives, inference algorithms, scaling behavior, systems optimization, and evaluation protocols, suggesting several promising directions for future research.

View source

Similar papers

#machine learning Preprint Aug 2026

Simulation-free and finite-time diffusion model

A framework for designing the reference process that achieves tractable time-dependent conditional distributions and then construct the reference process realizing them as its marginals is proposed, revealing that score matching is not fundamental to diffusion-model training but instead emerges naturally through revers...

Kentaro Kaba, Masayuki Ohzeki, Yuki Sughiyama · 0 citations
Jul 2026

UNIFUSION: Adapting Autoregressive Language Models into Discrete Diffusion under a Unified Reverse-Rate Objective

This work proposes a simple continual pre-training approach for directly adapting pretrained GPT2 checkpoints to uniform-noise diffusion, and establishes connections among SEDD, MDLM/GIDD, M2S, and Neural CTMC by expressing their conditional losses as a single generalized Kullback--Leibler objective over model reverse...

Xiaoyi Jiang, Jingyuan Li, Yi-Xuan Jiang et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Zarya: A Hybrid Autoregressive--Masked Diffusion Language Model with Flexible Training and Dual-Mode Inference

Zarya is introduced, a family of hybrid language models that jointly optimizes an autoregressive (AR) objective and a masked-diffusion objective within a single architecture, demonstrating performance on standard benchmarks while offering a principled integration of autoregressive and diffusion paradigms.

Leonid S. Sinev, Ilya Koziev, Vladislav Leshchuk · 0 citations
#machine learning Preprint Sep 2026

Unlocking Lossless Speedups in LLMs via Discrete Diffusion

Large Language Models (LLMs) owe much of their success to next-token prediction (NTP), but their autoregressive (AR) structure requires slow, sequential token generation. To overcome this bottleneck, we introduce diffusion-augmented LLMs, a new class of models that defines an AR model distribution while using diffusion...

S. Sahoo, Ling-Jie Chen, Khiem Pham et al. · 1 citation
Conference Open access Sep 2026

DiffVec: Diffusion Model for Trajectory Vector Recovery

The increasing availability of trajectory data is often hampered by sparsity and noise. Existing trajectory recovery methods are further limited by either information loss from coordinate discretization into location IDs, or the inefficiency of conventional diffusion models that require a lengthy denoising process from...

Jia-Qi Duan, Shengwei Tian, Long Yu et al. · 0 citations
Jul 2026

Rethinking the Generation Order of Block Diffusion Language Models

This work proposes Parallel Autoregressive Decoding (PARD), a simple training-free sampling method that preserves left-to-right unmasking structure while allowing parallel token commitment and consistently outperforms existing parallel samplers in generation quality.

Kai-Nuo Hou, James T. Kwok · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.