arXiv:2608.23167cs.CL2026-08

通过分区域建模优化扩散语言模型的生成速度。

Accelerating Diffusion Language Models via Structured Suffix Modeling

论文配图:Accelerating Diffusion Language Models via Structured Suffix Modeling
图 1 · 摘自论文原文
  • 将后缀分为局部、中间、尾部三区,按角色保留不同数量的词元。
  • 引入前步解码结果更新词元表示,实现信息跨步传递。
  • 无需训练且兼容现有加速技术,长序列下最高提速72.81倍。

扩散语言模型(DLM)通过单步去噪多个词元展现出强大的并行生成能力,但每步需与全部后缀词元交互,带来显著计算开销。现有方法通常仅保留局部后缀窗口作为替代,忽略了后缀区域间的结构异质性,并在每步重新初始化词元表示。为此,本文提出一种结构化后缀建模方法以提升DLM推理效率。具体地,将后缀划分为局部、中间和尾部三个区域,根据其结构作用分别保留不同数量的词元;同时,将前一步的解码结果融入当前步的词元表示,使其携带随生成过程演化的去噪信息。该方法无需训练且与多种加速技术(如并行解码策略、键值缓存)正交。在三个DLM模型上的多基准测试结果表明,该方法可进一步加速推理,并在多数情况下提升性能。尤其在长序列生成中,结合其他加速技术后,最高实现72.81倍的提速。代码已开源:https://github.com/zifengcheng/SSM。

原文摘要 · Abstract (English)

Diffusion Language Models (DLMs) exhibit strong parallel decoding capabilities by denoising multiple tokens in a single generation step. However, this parallelism comes with substantial computational overhead, as each step requires interactions with all suffix tokens. Existing methods typically reduce this cost by retaining only a local suffix window as a substitute for the full suffix. Despite their effectiveness, these methods overlook the structural heterogeneity across suffix regions and re-initialize suffix tokens with identical representations at each timestep. To this end, we propose a structured suffix modeling method for efficient DLM inference. Specifically, we divide the suffix into three regions, i.e., the local, middle, and tail regions, and retain different numbers of suffix tokens in each region according to their structural roles. Moreover, we incorporate the decoding results from the previous step into the suffix token representations at the current step, allowing them to carry evolving denoising information across generation steps. Notably, our method is training-free and orthogonal to several existing acceleration techniques, such as parallel decoding strategies and KV cache. Empirical results across multiple benchmarks on three DLMs demonstrate that our method can further accelerate DLM inference and improve performance in most cases. In particular, in long-sequence inference, our method achieves up to a \(72.81\times\) speedup when combined with other acceleration techniques. Our code is available at https://github.com/zifengcheng/SSM.

扩散模型语言生成加速推理结构建模

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。