Sign inGet started
Paper · arXiv

Query-Efficient Rejection Sampling for Parallel Masked Diffusion

Masked diffusion models (MDMs) accelerate generation by unmasking multiple tokens in parallel, but sampling these tokens independently ignores their correlations and biases the output. Anari et al. (2026) corrected this bias with rejection sampling, decomposing the log acceptance probability into a sum of token-level terms, but the evaluation requires one score query per unmasked token. We propose the Single-Increment Rejection Sampler (SIRS), which provides an estimate of the log acceptance probability from a single randomly sampled increment at the cost of one query. SIRS then converts a Poisson number of clipped estimates into accept/reject decisions through a Bernoulli factory adapted...

AuthorsShiyuan Zhang, Xuheng Li, Qiwei Di et al.
Primary categorycs.LG
Published15 October 2026
Last updated at source15 October 2026
cs.LGmath.PRstat.ML
Embed this entry
<iframe src="https://silytics.si/embed/item/ee06663e-1860-4d19-af04-3481f5eade39" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 16 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.