From Bits to Rounds: Parallel Decoding with Exploration for Diffusion Language Models
Hengyu Fu, Baihe Huang, Virginia Adams, Charles Wang, Venkat Srinivasan, Jiantao Jiao

TL;DR
This paper analyzes the limitations of standard diffusion language model decoding strategies and introduces Explore-Then-Exploit (ETE), a novel, training-free method that improves decoding efficiency by balancing exploration and exploitation.
Contribution
The paper establishes a theoretical bits-to-rounds principle for diffusion language models and proposes ETE, a new decoding strategy that enhances efficiency without sacrificing quality.
Findings
ETE reduces decoding rounds compared to confidence-only methods
Theoretical bounds on decoding rounds based on information content
Empirical results confirm ETE's effectiveness in practice
Abstract
Diffusion Language Models (DLMs) have recently emerged as a strong alternative to autoregressive language models (LMs). DLMs offer comparable accuracy with faster inference speed via parallel decoding. However, standard DLM decoding strategies relying on high-confidence tokens encounter an inherent information-theoretic bottleneck that restricts decoding progress and ultimately slows generation. We demonstrate both theoretically and empirically that prioritizing high-confidence tokens is inherently inefficient. High-probability tokens carry negligible information and strictly relying on them limits the effective progress made in each decoding round. We prove that the number of decoding rounds must grow linearly with the sample's total information (negative log-likelihood) and inversely with the per-round information budget, establishing a bits-to-rounds principle. We also propose…
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
TopicsTopic Modeling · Natural Language Processing Techniques · Adversarial Robustness in Machine Learning
