Mean-Field Parallel Decoding for Discrete Diffusion Language Models
For practitioners using discrete diffusion models, this method improves generation speed without sacrificing quality, though it is an incremental improvement over existing decoding techniques.
They introduced a training-free decoding framework for discrete diffusion language models that coordinates parallel token updates using pairwise interactions, achieving consistent improvements in quality-latency trade-off on reasoning and code-generation benchmarks.
Discrete diffusion language models enable parallel token generation, offering a pathway to low-latency decoding. However, selecting tokens independently by marginal confidence limits effective parallelism: tokens that appear reliable in isolation can form incompatible configurations when several positions are updated at once. We introduce a training-free decoding framework that coordinates these parallel updates. At each forward pass, the method assigns a commit score to each masked position and refines these scores using pairwise interactions derived from the model's predictive distributions. A variational relaxation yields a simple fixed-point update that suppresses conflicting simultaneous commitments within a single forward pass. This mechanism allows the decoder to commit more tokens in parallel while maintaining competitive generation quality. The method is lightweight, requires no auxiliary model or retraining, and drops into existing diffusion decoding pipelines without modification. Experiments on reasoning and code-generation benchmarks show consistent improvements in the quality-latency trade-off.