Generation Order and Parallel Decoding in Masked Diffusion Models: An Information-Theoretic Perspective
Abstract
Masked Diffusion Models (MDMs) significantly accelerate inference by trading off sequential determinism. However, the theoretical mechanisms governing generation order and the risks inherent in parallelization remain under-explored. In this work, we provide a unified information-theoretic framework to decouple and analyze two fundamental sources of failure: order sensitivity and parallelization bias. Our analysis yields three key insights: (1) The benefits of Easy-First decoding (prioritizing low-entropy tokens) are magnified as model error increases; (2) factorized parallel decoding introduces intrinsic sampling errors that can lead to arbitrary large Reverse KL divergence, capturing "incoherence" failures that standard Forward KL metrics overlook; and (3) while verification can eliminate sampling error, it incurs an exponential cost governed by the total correlation within a block. Conversely, heuristics like remasking, though computationally efficient, cannot guarantee distributional correctness. Experiments on a controlled Block-HMM and large-scale MDMs (LLaDA) for arithmetic reasoning validate our theoretical framework.
Cite
@article{arxiv.2602.00286,
title = {Generation Order and Parallel Decoding in Masked Diffusion Models: An Information-Theoretic Perspective},
author = {Shaorong Zhang and Longxuan Yu and Rob Brekelmans and Luhan Tang and Salman Asif and Greg Ver Steeg},
journal= {arXiv preprint arXiv:2602.00286},
year = {2026}
}