Duet：面向块扩散语言模型的双稀疏推理框架

View PDF HTML (experimental)

Abstract:Diffusion language models (DLMs) enable parallel token generation through iterative denoising, yet their inference remains costly due to repeated attention over a growing historical prefix and repeated processing of the entire current generation block. Historical attention becomes increasingly expensive as generation progresses, while all current-block positions are propagated through the Transformer at every denoising step even though only a small fraction are typically resolved at that step. In this paper, we introduce Duet, a training-free dual-sparse inference framework that addresses these challenges through prefix Key-Value (KV) sparsity and early query sparsity, respectively. Specifically, Duet exploits the concentration and cross-step stability of historical attention within each generation block to construct a compact historical KV subset that is reused across denoising steps. For query sparsity, Duet predicts update positions from shallow representations and propagates only the corresponding queries through the suffix Transformer layers, avoiding deep computation at positions unlikely to be updated in the current step. Experiments show that Duet maintains competitive accuracy while achieving 1.34$\times$/2.83$\times$ end-to-end/per-step speedups on LLaDA2.1-mini and 2.41$\times$/4.72$\times$ on SDAR-8B-Chat-b32 at a 32K context length.

Subjects:	Computation and Language (cs.CL)
Cite as:	arXiv:2611.09239 [cs.CL]
	(or arXiv:2611.09239v1 [cs.CL] for this version)
	https://doi.org/10.48550/arXiv.2611.09239 arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Siyuan Yan [view email]
[v1] Fri, 6 Nov 2026 09:59:42 UTC (220 KB)