DUEL: Exact Likelihood for Masked Diffusion via Deterministic Unmasking
Gilad Turok, Chris De Sa, and Volodymyr Kuleshov

TL;DR
This paper introduces DUEL, a framework that enables exact likelihood computation for masked diffusion models, allowing proper evaluation and revealing their true performance potential compared to autoregressive models.
Contribution
DUEL unifies deterministic sampling strategies in masked diffusion models to compute exact likelihoods, enabling proper perplexity measurement and fair comparison with autoregressive models.
Findings
MDMs have a smaller perplexity gap with autoregressive models than previously thought
DUEL allows reliable comparison of different sampling methods across compute budgets
MDMs can outperform autoregressive models in certain tasks, indicating higher potential
Abstract
Masked diffusion models (MDMs) generate text by iteratively selecting positions to unmask and then predicting tokens at those positions. Yet MDMs lack proper likelihood evaluation: the evidence lower bound (ELBO) is not only a loose bound on log-likelihood, but, as we show, is also computed under the training distribution rather than the test-time distribution. We resolve this within our DUEL framework, which unifies leading MDM sampling strategies that employ position selection. We prove that DUEL samplers admit -- giving MDMs likelihood, and hence proper perplexity, for the first time. This proper perplexity is the natural analogue of autoregressive perplexity and lets us revisit key questions about MDMs. :…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Advanced Neuroimaging Techniques and Applications · Topic Modeling
