paper-with-me

홈 › Papers

You Only Index Once: Cross-Layer Sparse Attention with Shared Routing

2026-06-04 · Yutao Sun, Yanqi Zhang, Li Dong, Jianyong Wang, Furu Wei arxiv

Long-context inference in modern LLMs is increasingly constrained by decoding efficiency, especially in reasoning-heavy settings where models generate long intermediate chains of thought. Existing sparse attention methods often face a practical efficiency-quality trade-off. Structured block sparse methods typically provide stronger acceleration but incur noticeable quality loss, while token sparse methods are usually more accurate yet deliver limited end-to-end speedup because top-k routing over the full cache remains expensive. In this work, we propose cross-layer sparse attention (CLSA), which is built on top of KV-sharing architectures such as YOCO. The core idea is to share not only the KV cache across cross-decoder layers, but also the routing index. A single indexer computes token-level top-k selection once and reuses the resulting index across layers, thereby preserving the fine-grained selectivity of token sparse attention while amortizing the routing overhead. The resulting architecture improves all major inference bottlenecks jointly, including pre-filling, KV-cache storage, and long-context decoding. Experiments across short-context and long-context benchmarks show that CLSA is both accurate and efficient, achieving up to 7.6x decoding speedup and 17.1x overall throughput improvement at 128K context. These results suggest a more complete architectural solution for long-context LLMs that jointly advances model quality and inference efficiency.

📄 PDF Abstract BibTeX arXiv:2606.06467

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

IndexCache: Accelerating Sparse Attention via Cross-Layer Index Reuse

2026-03-12 · Yushi Bai, Qian Dong, Ting Jiang, Xin Lv 외 arxiv

Long-context agentic workflows have emerged as a defining use case for large language models, making attention efficiency critical for both inference speed and serving cost. Sparse attention addresses this challenge effe…

LongCat Sparse Attention: Taming the Lightning via Streaming-aware Hierarchical Cross-Layer Indexing

2026-08-03 · Wen Zan, Jiaqi Zhang, Jianchao Tan, Hong Liu 외 arxiv

DeepSeek Sparse Attention (DSA) enables efficient long-context modeling through its Lightning Indexer. However, practical deployment remains constrained by the indexer's expensive $O(L^2)$ scoring overhead and the hardwa…

MISA: Mixture of Indexer Sparse Attention for Long-Context LLM Inference

2026-05-08 · Ruijie Zhou, Fanxu Meng, Yufei Xu, Tongxuan Liu 외 arxiv

DeepSeek Sparse Attention (DSA) sets the state of the art for fine-grained inference-time sparse attention by introducing a learned token-wise indexer that scores every prefix token and selects the most relevant ones for…

HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attention

2026-03-30 · Yufei Xu, Fanxu Meng, Fan Jiang, Yuxuan Wang 외 arxiv

Token-level sparse attention mechanisms, exemplified by DeepSeek Sparse Attention (DSA), achieve fine-grained key selection by scoring every historical key for each query through a lightweight indexer, then computing att…

Network Pruning for Low-Rank Binary Index

2019-09-25 · Dongsoo Lee, Se Jung Kwon, Byeongwook Kim, Parichay Kapoor 외

Pruning is an efficient model compression technique to remove redundancy in the connectivity of deep neural networks (DNNs). A critical problem to represent sparse matrices after pruning is that if fewer bits are used …

Model CompressionNetwork PruningQuantization