English

FOCUS: DLLMs Know How to Tame Their Compute Bound

Machine Learning 2026-02-02 v1 Hardware Architecture Computation and Language

Abstract

Diffusion Large Language Models (DLLMs) offer a compelling alternative to Auto-Regressive models, but their deployment is constrained by high decoding cost. In this work, we identify a key inefficiency in DLLM decoding: while computation is parallelized over token blocks, only a small subset of tokens is decodable at each diffusion step, causing most compute to be wasted on non-decodable tokens. We further observe a strong correlation between attention-derived token importance and token-wise decoding probability. Based on this insight, we propose FOCUS -- an inference system designed for DLLMs. By dynamically focusing computation on decodable tokens and evicting non-decodable ones on-the-fly, FOCUS increases the effective batch size, alleviating compute limitations and enabling scalable throughput. Empirical evaluations demonstrate that FOCUS achieves up to 3.52×\times throughput improvement over the production-grade engine LMDeploy, while preserving or improving generation quality across multiple benchmarks. The FOCUS system is publicly available on GitHub: https://github.com/sands-lab/FOCUS.

Keywords

Cite

@article{arxiv.2601.23278,
  title  = {FOCUS: DLLMs Know How to Tame Their Compute Bound},
  author = {Kaihua Liang and Xin Tan and An Zhong and Hong Xu and Marco Canini},
  journal= {arXiv preprint arXiv:2601.23278},
  year   = {2026}
}

Comments

22 pages, 15 figures

R2 v1 2026-07-01T09:28:14.557Z