Retrofitting Linear Attention into Diffusion Language Models
Jinha Kim, Younghun Roh, Jaeyeon Kim
cs.LG
Submitted: 2026-08-06
Updated: 2026-08-10
Code: https://github.com/Diuven/LLaDA-Hybrid
License: http://creativecommons.org/licenses/by/4.0/
The gist: Diffusion language models (dLLMs) offer a promising alternative to autoregressive models by accelerating inference through parallel decoding.
Terminology
Abstract
Diffusion language models (dLLMs) offer a promising alternative to autoregressive models by accelerating inference through parallel decoding. Recent dLLMs commonly use blockwise semi-autoregressive decoding, generating blocks autoregressively while denoising tokens within each active block in parallel. However, despite KV caching, each denoising step still attends to all previous blocks, repeatedly incurring prefix-attention cost. Motivated by this bottleneck, we ask whether dLLM inference can be further accelerated by linearizing attention over previous blocks. We introduce block-hybrid attention, which retains exact softmax attention within the active denoising block while applying linear attention over previous blocks. We show that this hybrid attention can be retrofitted into a pretrained dLLM with minimal post-training: LLaDA-Hybrid replaces 6 of the 20 attention layers in LLaDA 2.1, a 16B open-source dLLM, largely following LoLCAT (Zhang et al, 2024). The conversion takes only approximately 60 hours while preserving benchmark performance: 72.0% vs. 75.6% on HumanEval, 63.0% vs. 57.7% on MBPP+, and 86.7% vs. 88.3% on CMATH. With a Triton implementation, LLaDA-Hybrid achieves up to 1.7 times higher decoding throughput and supports more concurrent requests before exhausting memory, showing that pretrained dLLMs can be efficiently linearized for faster inference. Our code is available at: https://github.com/Diuven/LLaDA-Hybrid.
Sources
- LLaDA2.0: Scaling Up Diffusion Language Models to 100B
- LLaDA2.1: Speeding Up Text Diffusion via Token Editing
- Mercury: Ultra-Fast Language Models Based on Diffusion
- Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusions
- Tulu 3: Pushing Frontiers in Open Language Model Post-Training
- LAWCAT: Efficient Distillation from Quadratic to Linear Attention with Convolution across Tokens for Long Context Modeling
- The Diffusion Duality
- Seed Diffusion: A Large-Scale Diffusion Language Model with High-Speed Inference
- Discrete Diffusion Models Exploit Asymmetry to Solve Lookahead Planning Tasks
- Scaling Behavior of Discrete Diffusion Language Models
- Beyond Autoregression: Discrete Diffusion for Complex Reasoning and Planning
- Dream 7B: Diffusion Large Language Models
- LLaDA-MoE: A Sparse MoE Diffusion Language Model
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks