Skip to content
DraconiticResearch
Search Sources API
203,203 studies31 sourcesUpdated 38 min ago
PreprintCC BY 4.0arXiv

What Does a Discrete Diffusion Model Learn? One Reverse Process in Three Coordinates

Abstract

What does a discrete diffusion model actually learn? The literature trains denoisers, bridge plug-ins, and concrete scores, each deriving its own ELBO objective under different conventions. This fragmentation makes the object being learned unclear and ELBO values difficult to interpret and compare. All three methods learn the same object in different coordinates: the exact time-reversal of the noising process. We first prove the Oracle Distance identity: for any noising process, the negative ELBO is not just a bound on the likelihood; it equals the data entropy plus the path KL divergence from the reversed noising process to the learned one. Next, for token-factorizing noise, we show that denoiser, bridge plug-in, and concrete score are three coordinates of this reverse process, derive exact conversions between them, and identify the probability distribution learned by each. In particular, contrary to its standard interpretation, the bridge plug-in learns not a denoiser but the cavity distribution: the clean token given the noisy sequence excluding its own position. We confirm the theory by training all three coordinates with masked, uniform, and GIDD kernels on OpenWebText under a shared recipe, and by training uniform-diffusion solvers on four logic tasks. The learned coordinates agree after conversion, while confusing the cavity with the denoiser can severely degrade sampling quality. Together with exact boundary-term formulas, closed-form NELBO calibrations at initialization, and a clock interpretation of time schedules, these results provide a conceptual framework and a mechanical recipe for deriving, implementing, and comparing discrete diffusion processes.

Related

  1. Transformer-Based Masked Diffusion Models Provably Learn Distributions with Latent Structure
    Jingda Wu, Changxiao Cai
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Learn Feasibility Once, Optimize All Objectives: Derivative-Free Diffusion Models for Chance-Constrained Programming
    Ziwen Liu, Yan Liu, Congying Han +3
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. Hammock coordinates for silting subcategories of derived-discrete algebras
    Shantanu Sardar
    arXivPreprintarXiv licenceFull textAlgebra & number theoryarXiv
  4. Annealed Lévy Diffusion via Gaussian Surrogate Reverse Dynamics
    Yuling Jiao, Lican Kang, Jerry Zhijian Yang +2
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  5. A priori regularity of the reverse heat flow and dimension-dependent complexity of higher-order diffusion samplers
    Xixian Wang, Zhongjian Wang
    arXivPreprintCC BY-NC-SA 4.0Full textAnalysis & PDEsNumerical analysis & scientific computingarXiv
BibTeX
@misc{noguerales2026what,
  title = {{What Does a Discrete Diffusion Model Learn? One Reverse Process in Three Coordinates}},
  author = {Rodrigo Casado Noguerales and Bernhard Schölkopf and Thomas Hofmann and Aran Raoufi},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2607.05381},
  eprint = {2607.05381},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2607.05381},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - What Does a Discrete Diffusion Model Learn? One Reverse Process in Three Coordinates
AU  - Rodrigo Casado Noguerales
AU  - Bernhard Schölkopf
AU  - Thomas Hofmann
AU  - Aran Raoufi
PY  - 2026
DA  - 2026/10/14
PB  - arXiv
DO  - 10.48550/arxiv.2607.05381
UR  - https://arxiv.org/abs/2607.05381
AB  - What does a discrete diffusion model actually learn? The literature trains denoisers, bridge plug-ins, and concrete scores, each deriving its own ELBO objective under different conventions. This fragmentation makes the object being learned unclear and ELBO values difficult to interpret and compare. All three methods learn the same object in different coordinates: the exact time-reversal of the noising process. We first prove the Oracle Distance identity: for any noising process, the negative ELBO is not just a bound on the likelihood; it equals the data entropy plus the path KL divergence from the reversed noising process to the learned one. Next, for token-factorizing noise, we show that denoiser, bridge plug-in, and concrete score are three coordinates of this reverse process, derive exact conversions between them, and identify the probability distribution learned by each. In particular, contrary to its standard interpretation, the bridge plug-in learns not a denoiser but the cavity distribution: the clean token given the noisy sequence excluding its own position. We confirm the theory by training all three coordinates with masked, uniform, and GIDD kernels on OpenWebText under a shared recipe, and by training uniform-diffusion solvers on four logic tasks. The learned coordinates agree after conversion, while confusing the cavity with the denoiser can severely degrade sampling quality. Together with exact boundary-term formulas, closed-form NELBO calibrations at initialization, and a clock interpretation of time schedules, these results provide a conceptual framework and a mechanical recipe for deriving, implementing, and comparing discrete diffusion processes.
ER  -