ExplorerData ScienceMachine Learning
Research PaperResearchia:202608.25004

Provably adaptive sampling with uniform and remasking discrete diffusion models

Daniil Dmitriev

Abstract

Discrete diffusion models offer a promising alternative to autoregressive generation by enabling parallel updates, but their sampling efficiency can depend strongly on the choice of the forward process and the sampler. For the uniform forward process, existing lower bounds for the standard $τ$-leaping sampler scale linearly with the ambient dimension $d$, raising the question of whether this dependence is intrinsic to the forward process. We answer this question in the negative. We consider a fi...

Submitted: August 25, 2026Subjects: Machine Learning; Data Science

Description / Details

Discrete diffusion models offer a promising alternative to autoregressive generation by enabling parallel updates, but their sampling efficiency can depend strongly on the choice of the forward process and the sampler. For the uniform forward process, existing lower bounds for the standard ττ-leaping sampler scale linearly with the ambient dimension dd, raising the question of whether this dependence is intrinsic to the forward process. We answer this question in the negative. We consider a first-order sampler based on the leave-one-out denoiser for uniform and remasking processes whose coordinate updates can be performed in parallel. In both cases, the sampler can correct denoising mistakes during the sampling process, which becomes necessary when many coordinates are updated together. Our main result establishes an adaptive sampling guarantee: up to logarithmic factors, N=O(DTC(X0)/ε)N = O(\mathrm{DTC}(X_0) / \varepsilon) discretization steps suffice to achieve sampling error O(εscore+ε)O(\varepsilon_{\mathrm{score}}+\varepsilon), where εscore\varepsilon_{\mathrm{score}} is the error in score estimation. Thus, the sampling complexity is governed by the intrinsic dependence structure of the target distribution, as measured by its dual total correlation DTC(X0)\mathrm{DTC}(X_0), rather than directly by the ambient dimension dd. Our analysis proceeds through a Bayes-optimal auxiliary sampler that separates discretization error from score-estimation error. We also derive an exact information-theoretic representation of the discretization error in terms of the mutual information between different coordinates of the forward process at different times. This representation applies to general forward processes and, in the uniform and remasking cases, can be controlled by DTC(X0)\mathrm{DTC}(X_0). Numerical experiments on structured synthetic distributions illustrate the predicted dimension-adaptive behavior.


Source: arXiv:2608.23554v1 - http://arxiv.org/abs/2608.23554v1 PDF: https://arxiv.org/pdf/2608.23554v1 Original Link: http://arxiv.org/abs/2608.23554v1

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!

Access Paper
View Source PDF
Submission Info
Date:
Aug 25, 2026
Topic:
Data Science
Area:
Machine Learning
Comments:
0
Bookmark
Provably adaptive sampling with uniform and remasking discrete diffusion models | Researchia