arXiv Computation and Language

DUET: Dual-Sparse Inference for Block Diffusion Language Models

DUET is a training‑free dual‑sparse inference framework for diffusion language models that reduces inference cost by two techniques: prefix Key‑Value sparsity and early query sparsity. It constructs a compact historical KV subset reused across denoising steps, and predicts which positions will be updated to propagate only the necessary queries through the suffix Transformer layers. Experiments demonstrate that DUET keeps accuracy while delivering up to 4.72× speedups on large models with 32K context length.

arXiv Computation and Language
Nov 4

Step-dLLM: Adaptive Step-aware Sparse Attention for Efficient Diffusion LLM Inference

Step-dLLM introduces an adaptive, step-aware sparse attention mechanism for diffusion large language models (dLLMs). It refreshes a block-sparse mask at specific anchor steps along the denoising trajectory and applies a head-adaptive global sparsity budget, allowing efficient reuse of attention patterns within locally consistent intervals. The method, implemented with a fused IO-aware Triton kernel, achieves a 2.78× speedup over dense FlashAttention on LLaDA-1.5 while improving the accuracy‑latency trade‑off compared to prior sparse‑attention approaches.

By Zhichen Zeng, Xichong Zhang, Junpan Wu, Yifei Zuo, Chi-Chih Chang, Jiayi Wang, Maohua Nie, Ji Liu, Ang Li, Banghua Zhu
arXiv Computation and Language
Aug 25

Accelerating Diffusion Language Models via Structured Suffix Modeling

The paper introduces a training‑free structured suffix modeling technique to accelerate Diffusion Language Models (DLMs). It partitions the suffix into local, middle, and tail regions, retaining varying numbers of tokens per region and incorporating previous decoding results into current token representations. Experiments on three DLMs show significant speedups—up to 72.81× in long‑sequence inference—while often improving performance, and the method is compatible with existing acceleration strategies.

By Zifeng Cheng, Keda Li, Zhiwei Jiang, Cong Wang, Fei Shen, Qing Gu
Hugging Face Trending Papers
Oct 13

Prefilling-dLLM v2: Learned Chunk Routing for Long-Context Diffusion Language Models

Prefilling-dLLM v2 is a diffusion language model that learns to route computation using a native mask token, enabling efficient sparse attention across long contexts. By appending a mask at the end of each chunk and using a learned role offset, the model selectively attends to top‑K chunks every fourth layer while maintaining local windows elsewhere. Evaluated on 16K–128K contexts, Prefilling-dLLM v2 outperforms other sparse methods (NSA, DSA, SWA) on RULER tasks and achieves a 172× speedup over full dense attention at 128K tokens.

arXiv Computation and Language
Sep 1

Prefilling-dLLM: Predictive Prefilling for Long-Context Inference in Diffusion Language Models

arXiv:2606.10537v2 Announce Type: replace Abstract: Diffusion large language models (dLLMs) re-encode the entire prefix at every denoising step, causing recomputation that scales quadratically with...

By Jing Xiong, Qi Han, Shansan Gong, Yunta Hsieh, Boyuan Zheng, Chengyue Wu, Chaofan Tao, Chenyang Zhao, Ngai Wong
arXiv Machine Learning
Jun 25

Streaming-dLLM: Accelerating Diffusion LLMs via Suffix Pruning and Dynamic Decoding

arXiv:2601. 17917v3 Announce Type: replace Abstract: 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.

By Zhongyu Xiao, Zhiwei Hao, Jianyuan Guo, Yong Luo, Jia Liu, Jie Xu, Han Hu
arXiv AI
Nov 5

Split-KV: Efficient Context Parallelism for Training Diffusion Drafters

Split-KV introduces a context‑parallelism technique for training diffusion drafters, keeping key/value shards local and limiting per‑layer attention communication to query‑sized tensors. This approach exploits the asymmetry between short draft queries and long contexts, enabling efficient load balancing via a cost‑aware longest‑processing‑time‑first strategy. Experiments show that at a CP size of 64, Split‑KV achieves 85–91 % weak‑scaling efficiency and up to 3.67× speedup over the best baseline, with less than 1 % load imbalance.

By Geng Zhang, Fangzhao Zhang, Cong Xie, Tiantian Fan, Yang You
arXiv AI
Jul 21

Lil: Less is Less When Applying Post-Training Sparse-Attention Algorithms in Long-Decode Stage

arXiv:2601. 03043v4 Announce Type: replace-cross Abstract: Large language models (LLMs) demonstrate strong capabilities across a wide range of complex tasks and are increasingly deployed at scale, placing significant demands on inference efficiency.

By Junhao Hu, Fangze Li, Mingtao Xu, Feifan Meng, Shiju Zhao, Tiancheng Hu, Ting Peng, Anmin Liu, Wenrui Huang, Chenxu Liu, Ziyue Hua, Tao Xie