

















Abstract:Diffusion large language models (dLLMs) generate text through iterative denoising. In commonly adopted parallel decoding schemes, each step confirms only high-confidence positions while remasking the others. By analyzing dLLM denoising traces, we uncover a key inefficiency: models often predict the correct target token several steps before its confidence becomes high enough to be decoded. This gap between early prediction and late decoding forces repeated remasking of already-correct tokens, causing redundant iterations and limiting acceleration. To exploit this temporal redundancy, we introduce Trace Credit to quantify a token's decoding potential by accumulating historical evidence. Building on this, we propose CreditDecoding, a training-free parallel decoding method that fuses Trace Credit with current logits to boost the confidence of correct but underconfident tokens, thereby accelerating denoising and improving robustness. On eight benchmarks, CreditDecoding achieves up to 5.48 times speedup with +0.48 accuracy on LLaDA-8B and consistently improves performance across diverse dLLM architectures and parameter scales. It further scales to long contexts and remains orthogonal to mainstream inference optimizations, making it a practical and widely applicable solution.
| Comments: | 19 pages, 13 figures, 9 tables, Accepted to ACL 2026 main conference |
| Subjects: | Computation and Language (cs.CL); Artificial Intelligence (cs.AI) |
| Cite as: | arXiv:2510.06133 [cs.CL] |
| (or arXiv:2510.06133v3 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2510.06133 arXiv-issued DOI via DataCite |
From: Kangyu Wang [view email]
[v1]
Tue, 7 Oct 2025 17:08:33 UTC (12,426 KB)
[v2]
Sun, 19 Apr 2026 15:25:01 UTC (9,255 KB)
[v3]
Tue, 26 May 2026 03:39:22 UTC (9,247 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。