Abstract:Discrete diffusion language models improve generation efficiency through parallel token prediction, but standard $X_0$ prediction methods introduce factorization errors by approximating the clean token posterior with independent token-wise distributions. This paper proposes Factorization-Error-Free Discrete Diffusion Language Modeling (FeF-DLLM), which replaces independent clean-token prediction with an exact prefix-conditioned factorization of the clean posterior to better preserve token dependencies. To reduce the sequential cost introduced by prefix conditioning, FeF-DLLM further incorporates speculative decoding within diffusion denoising, accelerating inference while maintaining the parallel prediction and re-masking properties of DLLMs. Theoretically, we prove that FeF-DLLM generates from the true joint distribution and derive its expected acceleration ratio. Experiments on GSM8K, MATH, HumanEval, and MBPP demonstrate that our method improves accuracy by an average of 5.04 percentage points while achieving an average inference speedup of $3.86\times$.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2605.14305 [cs.CL] |
| (or arXiv:2605.14305v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2605.14305 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Yunchen Li [view email]
[v1]
Thu, 14 May 2026 03:15:25 UTC (154 KB)