Skip to content
Conference Open access

RoBSA: RoPE-based Blockwise Sparse Multi-head Latent Attention

2026 · Annual Meeting of the Association for Computational Linguistics · pp. 1028-1044 · 0 citations · 34 references
Computer Science

TL;DR

This paper introduces RoPE-based Block-wise Sparse Attention (RoBSA), a method designed specifically for MLA during the decoding stage of model inference that significantly reduces end-to-end inference latency in the decoding stage by up to 2 .

Abstract

Large Language Models (LLMs) have rapidly advanced in recent years, scaling up in both parameter count and context length. However, as context windows extend from thousands to hundreds of thousands of tokens, attention computation becomes the dominant source of memory usage and runtime in decoding stages, severely limiting the efficiency and scalability of long-context LLMs. Sparse attention has emerged as a promising solution, reducing complexity by computing attention over only a subset of context tokens. However, the sparse attention for Multi-head Latent Attention (MLA) which is a variant of standard MHA is rarely studied. In this paper, we introduce RoPE-based Block-wise Sparse Attention (RoBSA), a method designed specifically for MLA during the decoding stage of model inference. RoBSA leverages the decoupled nature of RoPE within MLA to implement token selection in a blockwise manner. RoBSA is a lightweight, training-free, and layer-aware algorithm that can be integrated in a plug-and-play fashion. Our method significantly reduces end-to-end inference latency in the decoding stage by up to 2 . 55 × with minimal accuracy loss compared to full attention in long-context scenarios for very large models.

Read PDF

Similar papers

Preprint Jul 2026

Hierarchical Sparse Attention Done Right: Toward Infinite Context Modeling

Hierarchical Landmark Sparse Attention is proposed, a chunk-wise sparse attention mechanism that learns chunk selection end-to-end under the language-modeling (LM) loss, enabling long-context LLMs that are both more efficient and more effective on general long-context tasks than their full-attention counterparts.

Xiang Hu, Xinyu Wei, Hao Gu et al. · 3 citations
Preprint Jul 2026

Uncertainty-gated selection for block-sparse attention

A value-of-information router that measures, for each query, how decisively the top-k cut was made, and doubles the kept set for the queries where that gap is smallest is proposed; the rule is backbone-agnostic and stacks with existing block-scoring methods such as Quest.

T. Rossi · 0 citations
Conference Open access 2026

LaCo: Layer-wise Compensation for Pruned Large Language Models

Pruning is essential for the efficient deployment of Large Language Models (LLMs); however, it causes severe performance degradation due to the structural distortion induced by sparsity. Existing recovery strategies, such as LoRA, predominantly employ global fine-tuning, often overlooking the mechanistic root of this d...

Yingen Liu, Fan Wu, Xuyan Pan et al. · 0 citations
Jul 2026

Through the Bottleneck: How Multi-head Latent Attention Separates Content from Position in Language Models

This work presents the first comprehensive mechanistic interpretability study of MLA, training a 114M-parameter transformer and analyzing its representations through SVD, attention head taxonomy, linear probing, and a disruption-attribution analysis.

S. Dhruvil, Fenil Sojitra, R. Chauhan · 0 citations
Jul 2026

CoSA: Accelerating Long-Context Inference via Proxy-Kernel Co-Designed Sparse Attention

CoSA is proposed, a two-stage training-free Sparse Attention under proxy-kernel CO-design, which couples a Kernel-Aware Proxy (KAP) with an Ordered-Skipping Kernel (OSK) and achieves a 4.93% attention speedup and reduces end-to-end Time-to-First-Token by 2.53% with negligible performance degradation.

Yufei Xue, Lin Niu, Hong Liu et al. · 0 citations
Preprint Jul 2026

Data-Efficient Adaptation of LLMs via Attention Head Reweighting

Experiments on diverse open-source text classification datasets show that AHR can outperform standard baselines like LoRA when learning from limited samples, despite having 200-1000x fewer trainable parameters, as the authors' AHR only modifies ~0.0001% of the model's parameters.

Tuomas P. Oikarinen, Zixiao Chen, Charlotte Siska et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.