mlsanityData to 14 Oct 2026

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

arXiv 2606.06467 ↗First posted 4 Jun 2026cs.CL cs.AI cs.LGcited by 2

On the map: Efficient LLM inference and serving → KV cache optimization

Abstract (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.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 32 of its 37 references that are in the map. First posted on arXiv 4 Jun 2026.

Builds on

32 of 37 references.

Closest ancestors · 5

Same direction, newest first

  1. 2026HySparse: A Hybrid Sparse Attention Architecture with Oracle Token Selection and KV Cache Sharing3 Feb
  2. 2025Rectified Sparse Attention4 Jun
  3. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference16 Jun
  4. 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attention21 May
  5. 2023Efficient Memory Management for Large Language Model Serving with PagedAttention12 Sep

Other references · 27

  1. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  2. 2025Qwen3 Technical Reportcited by 8,820
  3. 2021Evaluating Large Language Models Trained on Codecited by 8,320
  4. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  5. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  6. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,718
  7. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,703
  8. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  9. 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
  10. 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
  11. 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
  12. 2025DeepSeek-V3.2: Pushing the Frontier of Open Large Language Modelscited by 815
15 more
  1. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 613
  2. 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 532
  3. 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 407
  4. 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 401
  5. 2025Kimi Linear: An Expressive, Efficient Attention Architecturecited by 196
  6. 2025MiniMax-01: Scaling Foundation Models with Lightning Attentioncited by 166
  7. 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
  8. 2024SeerAttention: Learning Intrinsic Sparse Attention in Your LLMscited by 124
  9. 2025Rope to Nope and Back Again: A New Hybrid Attention Strategycited by 47
  10. 2026IndexCache: Accelerating Sparse Attention via Cross-Layer Index Reusecited by 31
  11. 2025SeerAttention-R: Sparse Attention Adaptation for Long Reasoningcited by 30
  12. 2024TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attentioncited by 29
  13. 2025Decoder-Hybrid-Decoder Architecture for Efficient Reasoning with Long Generationcited by 11
  14. 2025Kascade: A Practical Sparse Attention Method for Long-Context LLM Inferencecited by 10
  15. 2025DELTA: Dynamic Layer-Aware Token Attention for Efficient Long-Context Reasoningcited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache
  2. 2026SparDA: Sparse Decoupled Attention for Efficient Long-Context LLM Inference
  3. 2025Tactic: Adaptive Sparse Attention with Clustering and Distribution Fitting for Long-Context LLMs
  4. 2026CLAA: Cross-Layer Attention Aggregation for Accelerating LLM Prefill
  5. 2025Long-Context Modeling with Dynamic Hierarchical Sparse Attention for Memory-Constrained LLM Inference
  6. 2026Self-Indexing Attention for Compression-Compatible Sparse Long-Context LLM Inference
  7. 2025LServe: Efficient Long-sequence LLM Serving with Unified Sparse Attention
  8. 2025Progressive Sparse Attention: Algorithm and System Co-design for Efficient Attention in LLM Serving