Diffusion large language models (dLLMs) are emerging as a promising alternative to autoregressive models (ARMs) due to their ability to capture bidirectional context and the potential for parallel generation. Despite the advantages, dLLM inference remains computationally expensive as the full input context is processed at every iteration. In this work, we analyze the generation dynamics of dLLMs and find that intermediate representations, including key, value, and hidden states, change only subtly across successive iterations. Leveraging this insight, we propose ES-dLLM, a training-free inference acceleration framework for dLLM that reduces computation by skipping tokens in early layers based on the estimated importance. Token importance is computed with intermediate tensor variation and confidence scores of previous iterations. Experiments on LLaDA-8B and Dream-7B demonstrate that ES-dLLM achieves throughput of up to 226.57 and 308.51 tokens per second (TPS), respectively, on an NVIDIA H200 GPU, delivering 5.6× to 16.8× speedup over the vanilla implementation and up to 1.85× over the state-of-the-art caching method, while preserving generation quality.
Figures & tables
Figure 1: Confidence variation statistics using LLaDA-8B-Instruct. (a) uses a sample from the BBH dataset, while (b) and (c) present results using 100 samples from multiple datasets.
Figure 2: Hidden state variation in layer 10 using LLaDA-8B-Instruct. (a) uses a single sample from the BBH dataset, while (b) presents results using 100 samples from multiple datasets. The red vertical line in (a) separates prompt and output tokens, and the distribution in (b) includes only output tokens.
Figure 3: Illustration of ES-dLLM compared with the vanilla implementation and DualCache, assuming block-1 is under processing. The figure presents only 4 tokens per block, while the actual block length can be much larger (e.g., 32 or 64).
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
LLaDA
8.56
1.0 ×
76.72
DualCache
112.15
13.1 ×
76.35
ES-dLLM
143.93
16.8 ×
76.95
MATH(4)
LLaDA
14.04
1.0 ×
28.14
DualCache
56.02
4.0 ×
26.94
ES-dLLM
103.63
7.4 ×
27.24
Table 1: Performance comparison using LLaDA-8B-Instruct on five benchmark datasets. TPS (tokens per second) measures throughput, calculated as the generated token count divided by total time. Speedup reports relative throughput improvement in terms of TPS compared to the vanilla implementation (i.e., LLaDA). Performance score in percentage indicates the accuracy or pass rate. The number in parentheses of each benchmark indicates the number of shots for evaluation. Bold numbers highlight the best performance on each benchmark.
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
Dream
19.80
1.0 ×
79.00
DualCache
209.88
10.6 ×
77.94
ES-dLLM
267.13
13.5 ×
77.94
MATH(4)
Dream
26.38
1.0 ×
33.94
DualCache
86.38
3.3 ×
33.60
ES-dLLM
147.44
5.6 ×
33.44
Table 2: Performance comparison using Dream-7B-Instruct on five benchmark datasets. Metrics and notations are the same as in Table 1 .
Figure 4: Ablation studies on importance estimation configurations using LLaDA-8B-Instruct.
Appendix figures & tables17 assets
Supplementary material from the paper’s appendix.
Appendix
Figure 5: Variation statistics of key, value, and query tensors in layer 10 using LLaDA-8B-Instruct. Left: single-sample heatmap from BBH; red line separates prompt and output tokens. Right: log-scale distribution for output tokens using 100 samples from multiple datasets.
Figure 6: Log-scale distributions of hidden state variation in layers 10, 20, and 30 using LLaDA-8B-Instruct.
Figure 7: Confidence variation statistics using Dream-7B-Instruct. (a) uses a sample from the BBH dataset, while (b) and (c) present results using 100 samples from multiple datasets.
Figure 8: Variation statistics of hidden states and key, query, and value tensors in layer 10 using Dream-7B-Instruct. Left: single-sample heatmap from BBH; red line separates prompt and output tokens. Right: log-scale distribution for output tokens using 100 samples from multiple datasets.
Layer
0
4
8
16
24
31
Hidden
0.15
0.22
0.27
0.38
0.48
0.51
Query
N/A
0.18
0.24
0.39
0.45
0.66
Key
N/A
0.18
0.24
0.38
0.42
0.66
Value
N/A
0.16
0.25
0.43
0.45
0.65
Appendix
Table 3: Pearson correlation between intermediate tensor variation and probability change (confidence is the maximum probability) for all mask tokens in selected layers using LLaDA-8B-Instruct.
Benchmark
Generation Length
Block Length
GSM8K
256
64
MATH
256
256
BBH
256
64
HumanEval
512
64
MBPP
512
64
Appendix
Table 4: Generation length and block length for each benchmark.
Table 5: Cache refresh periods in ES-dLLM for each benchmark and model.
Model
Benchmark
Prompt
Block
LLaDA
BBH
32
4
Dream
BBH
16
4
MBPP
8
2
Appendix
Table 6: Cache refresh periods in ES-dLLM* for each benchmark and model.
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
LLaDA
9.20
1.0 ×
71.11
DualCache
116.46
12.7 ×
66.19
ES-dLLM
140.45
15.3 ×
67.63
MATH(4)
LLaDA
15.12
1.0 ×
32.38
DualCache
57.89
3.8 ×
30.48
ES-dLLM
94.46
6.2 ×
30.60
Appendix
Table 7: Performance comparison using LLaDA-8B-Base on five benchmark datasets. Metrics and notations follow Table 1 .
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
Dream
21.12
1.0 ×
74.15
DualCache
211.67
10.2 ×
73.16
ES-dLLM
282.67
13.4 ×
73.92
MATH(4)
Dream
27.98
1.0 ×
40.90
DualCache
86.58
3.1 ×
40.10
ES-dLLM
167.03
6.0 ×
39.60
Appendix
Table 8: Performance comparison of Dream-7B-Base on five benchmark datasets.
Skip Ratio & Position
FLOPs Prop.
TPS
Speedup
Performance Score
No skipping
100%
56.02
1.0 ×
26.94
r4=r8=0.5
40%
103.63
1.85 ×
27.24
r8=0.75
46%
95.26
1.70 ×
27.26
r8=0.5
64%
77.66
1.39 ×
27.36
r8=0.25
82%
63.49
1.13 ×
27.58
r0=0.5
52%
89.40
1.60 ×
26.76
Appendix
Table 9: Ablation study of skip ratio and position configurations on MATH using LLaDA-8B-Instruct. No skipping represents the DualCache baseline. Speedup is calculated against the TPS of DualCache, and the FLOPs proportion is normalized to the no-skipping baseline.
Skip Ratio& Position
FLOPs Prop.
GSM8K
MATH
BBH
HumanEval
MBPP
r4=0.7
40%
76.27
27.44
53.95
35.98
39.4
r4=r8=0.5
40%
76.95
27.24
54.51
37.8
39.4
r4=r8=r12=0.405
40%
76.35
27.48
53.86
36.59
39.8
Appendix
Table 10: Ablation study on skipping times across five datasets using LLaDA-8B-Instruct.
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
DualCache+PD
172.02
1.53 ×
76.57
ES-dLLM +PD
201.60
1.80 ×
75.74
MATH(4)
DualCache+PD
85.05
1.52 ×
26.94
ES-dLLM +PD
152.19
2.72 ×
27.48
BBH(3)
DualCache+PD
269.48
2.07 ×
52.31
ES-dLLM +PD
302.95
2.33 ×
53.26
Appendix
Table 11: Performance comparison for parallel decoding using LLaDA-8B-Instruct. Speedup is compared with the DualCache baseline without parallel decoding.
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
DualCache+PD
364.48
1.74 ×
77.94
ES-dLLM +PD
425.27
2.03 ×
78.01
MATH(4)
DualCache+PD
128.02
1.48 ×
33.58
ES-dLLM +PD
215.61
2.50 ×
33.48
BBH(3)
DualCache+PD
546.51
2.41 ×
57.18
ES-dLLM +PD
615.51
2.71 ×
57.07
Appendix
Table 12: Performance comparison for parallel decoding using Dream-7B-Instruct.
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
Sparse-dLLM
140.26
1.25 ×
76.80
ES-dLLM +Sparse
172.55
1.54 ×
75.97
MATH(4)
Sparse-dLLM
66.80
1.19 ×
28.10
ES-dLLM +Sparse
121.91
2.18 ×
28.06
BBH(3)
Sparse-dLLM
160.35
1.23 ×
49.13
ES-dLLM +Sparse
191.56
1.47 ×
51.13
Appendix
Table 13: Performance comparison for sparse attention using LLaDA-8B-Instruct. Speedup is compared to DualCache without sparse attention technique.
Benchmark
Method
TPS
Speedup
Performance Score
GSM8K(5)
Sparse-dLLM
227.68
1.08 ×
77.94
ES-dLLM +Sparse
287.68
1.37 ×
77.94
MATH(4)
Sparse-dLLM
89.56
1.04 ×
35.60
ES-dLLM +Sparse
157.19
1.82 ×
36.10
BBH(3)
Sparse-dLLM
243.35
1.07 ×
57.52
ES-dLLM +Sparse
305.35
1.35 ×
57.09
Appendix
Table 14: Performance comparison for sparse attention using Dream-7B-Instruct.
Benchmark
GSM8K
MATH
BBH
HumanEval
MBPP
LLaDA-8B-Instruct
TPS
241.03
175.53
331.30
407.86
483.35
(vs. DualCache)
2.15 ×
3.13 ×
2.55 ×
2.31 ×
4.10 ×
Performance
74.30
28.46
52.17
34.76
38.6
(vs. DualCache)
-2.05
+1.52
-1.12
-0.61
+0.2
Dream-7B-Instruct
Appendix
Table 15: Performance of ES-dLLM when combined with both parallel decoding and sparse attention.
Diffusion Large Language Models (dLLMs) offer a promising alternative to autoregressive models, excelling in text generation tasks due to their bidirectional attention mechanisms. However, their computational complexity scales on the order of L cubed with the sequence length L. This poses significant challenges for long-sequence and real-time applications, primarily due to the lack of compatibility with key-value caching and the non-autoregressive nature of denoising steps. Existing acceleration methods rely on static caching or parallel decoding strategies, which fail to account for the dynamic behavior of token properties across layers and decoding steps. We propose Dynamic-dLLM, a training-free framework that enhances dLLM inference efficiency through two components: Dynamic Cache Updating (DCU), which adaptively allocates cache-update budgets based on layer-wise token dynamics, and Adaptive Parallel Decoding (APD), which dynamically calibrates decoding thresholds to balance generation quality and efficiency. Extensive experiments on models like LLaDA-8B-Instruct, LLaDA-1.5, and Dream-v0-7B-Instruct across benchmarks such as MMLU, GSM8K, and HumanEval demonstrate that Dynamic-dLLM significantly improves inference speed. It attains an average speedup exceeding 3 times while maintaining performance. Dynamic-dLLM outperforms state-of-the-art acceleration methods and provides a plug-and-play solution for efficient dLLM deployment without compromising performance. The code is available at https://github.com/TianyiWu233/DYNAMIC-DLLM.
Tianyi Wu, Xiaoxi Sun, Yanhua Jiao +5
*Equal contribution. The work is done during Tianyi’s internship at CBG Celia DeviceAI Team, Huawei. · 1Harbin Institute of Technology, Shenzhen · 2Huawei +1
Diffusion Large Language Models (dLLMs) offer a compelling paradigm for natural language generation, leveraging parallel decoding and bidirectional attention to achieve superior global coherence compared to autoregressive models. While recent works have accelerated inference via KV cache reuse or heuristic decoding, they overlook the intrinsic inefficiencies within the block-wise diffusion process. Specifically, they suffer from spatial redundancy by modeling informative-sparse suffix regions uniformly and temporal inefficiency by applying fixed denoising schedules across all the decoding process. To address this, we propose Streaming-dLLM, a training-free framework that streamlines inference across both spatial and temporal dimensions. Spatially, we introduce attenuation guided suffix modeling to approximate the full context by pruning redundant mask tokens. Temporally, we employ a dynamic confidence aware strategy with an early exit mechanism, allowing the model to skip unnecessary iterations for converged tokens. Extensive experiments show that Streaming-dLLM achieves up to 68.2X speedup while maintaining generation quality, highlighting its effectiveness in diffusion decoding. The code is available at https://github.com/xiaoshideta/Streaming-dLLM.
Zhongyu Xiao, Zhiwei Hao, Jianyuan Guo +4
School of information and Electronics, Beijing Institute of Technology, Beijing · Department of Computer Science, City University of Hong Kong, Hong Kong · School of Computer Science, Wuhan University, Wuhan +2
Diffusion language models can generate many tokens in parallel, but they still require repeated denoising steps during inference. This makes generation costly, especially when the model continues to recompute tokens that are already stable. To address these limitations, we propose CAI-DLLM, a training-free inference method that uses first-step confidence to guide denoising and reduce inference time. Specifically, CAI-DLLM commits easy tokens earlier, allocates more denoising steps to harder tokens, and adjusts decoding schedules across output blocks. As it relies only on first-step confidence signals, it does not require retraining, extra predictors, or weight updates. We evaluate CAI-DLLM on LLaDA-8B-Instruct and Dream-7B-Instruct across math, code, reasoning, commonsense, and long-context tasks. CAI-DLLM achieves up to 18.2x wall clock inference speedup on LLaDA GSM8K while improving accuracy from 76.27% to 77.41%, and up to 13.1x speedup on Dream HumanEval while achieving higher pass@1 than no-cache inference, 48.17% compared with 46.95%. On harder reasoning tasks, speedups reach 44.8x, with a largest accuracy drop of 4.4 points, while energy consumption is reduced by up to 95.3%.
Farhana Amin, Sabiha Afroz, Dimitrios S. Nikolopoulos