arXiv Machine Learning August 28, 2026 By Kaihua Liang, An Zhong, Xin Tan, Zafar Ayyub Qazi, Hong Xu, Jian Weng, Marco Canini

Affix Cache for Diffusion Large Language Models

Read the original on arXiv Machine Learning →

The paper introduces ACache, an affix-oriented cache reuse mechanism for Diffusion Large Language Models (DLLMs). ACache identifies a small set of critical affix tokens, called Anchor Tokens, and selectively recomputes their key-value states while reusing the rest of the affix cache. Experiments on Fast-dLLM and Nano-vLLM show that recomputing about 20% of affix tokens restores accuracy and can reduce recompute latency by up to 55.7% while improving throughput by up to 1.68×.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv AI

Jun 9

Enabling KV Caching of Shared Prefix for Diffusion Language Models

arXiv:2606. 07571v1 Announce Type: cross Abstract: Key-value (KV) caching for shared prefixes is essential for high-throughput large language model (LLM) serving, but it faces critical challenges in emerging diffusion language models (DLMs).

By Younghun Go, Jaehoon Han, Changyong Shin, Chuk Yoo, Gyeongsik Yang

llms diffusion efficiency

arXiv AI

Jun 3

dLLM-Cache: Accelerating Diffusion Large Language Models with Adaptive Caching

arXiv:2506. 06295v2 Announce Type: replace-cross Abstract: Autoregressive Models (ARMs) have long dominated the landscape of Large Language Models.

By Zhiyuan Liu, Yicun Yang, Yaojie Zhang, Junjie Chen, Chang Zou, Qingyuan Wei, Shaobo Wang, Yichen Zhu, Linfeng Zhang

llms diffusion efficiency

arXiv AI

Jul 23

HijackKV: New Threat in Position-Independent KV Cache Reuse

arXiv:2607. 19957v1 Announce Type: cross Abstract: Key-Value (KV) cache reduces inference latency in large language models (LLMs).

By Yichi Zhang, Zhiqi Wang, Huan Zhang, Yuchen Yang

llms efficiency

arXiv AI

1d ago

CoTA++: Understanding the Repeat Curse in dMLLMs from an Information Flow Perspective

arXiv:2610.23290v1 Announce Type: new Abstract: Diffusion-based multimodal large language models (dMLLMs) decode by iterative denoising with bidirectional attention, which precludes the standard auto...

By Qiyan Zhao, Xiaofeng Zhang, Xu-Yao Zhang, Shijie Han, Zhepeng Li, Shunzhi Zhu, Da-Han Wang

llms diffusion multimodal benchmarks

arXiv Machine Learning

Sep 16

Window-Diffusion: Accelerating Diffusion Language Model Inference with Windowed Token Pruning and Caching

The paper introduces Window-Diffusion, a method that accelerates diffusion language model inference by pruning and caching tokens within a sliding window. It categorizes undecoded tokens into active, buffer, and far-field groups, computing only the first two while discarding the rest. Experiments on LLaDA and Dream demonstrate up to 99× speedup with minimal loss in generation quality.

By Fengrui Zuo, Zhiwei Ke, Yiming Liu, Wenqi Lou, Chao Wang, Xuehai Zhou

llms diffusion efficiency

arXiv AI

Jul 17

Polestar: Drift-Aware Cache Calibration and Token Commitment for Efficient Inference of Diffusion LLMs

arXiv:2607. 14107v1 Announce Type: cross Abstract: The inference efficiency of diffusion large language models (dLLMs) is constrained by two challenges: bidirectional attention precludes efficient KV-cache reuse, while increasing decoding parallelism with static confidence thresholds can compromise generation quality.

By Mingyu Lee, Akshat Ramachandran, Souvik Kundu, Tushar Krishna

llms diffusion efficiency benchmarks

One email a morning, machine-written

Related stories

Enabling KV Caching of Shared Prefix for Diffusion Language Models

dLLM-Cache: Accelerating Diffusion Large Language Models with Adaptive Caching

HijackKV: New Threat in Position-Independent KV Cache Reuse

CoTA++: Understanding the Repeat Curse in dMLLMs from an Information Flow Perspective

Window-Diffusion: Accelerating Diffusion Language Model Inference with Windowed Token Pruning and Caching

Polestar: Drift-Aware Cache Calibration and Token Commitment for Efficient Inference of Diffusion LLMs