LatentIndex: Cross-Layer Sharing with Layer-Specific Selection for Sparse Attention
Not on the map. Why?
Abstract (arXiv)
Sparse attention reduces core-attention computation, but its indexers still incur repeated selection work and per-layer key-cache storage. Reusing selected indices across layers reduces this overhead but constrains multiple layers to the same token set. We introduce LatentIndex, which extends the latent-sharing principle of Multi-head Latent Attention across indexer layers. Each layer group constructs a shared latent cache from its first layer's hidden states, while layer-specific scoring enables independent token selection. Absorbing key decoders into queries enables direct scoring of the shared cache without reconstructing historical per-layer keys. We develop training-free calibration and investigate a training-aware instantiation of this principle. To balance quality and computation, a hierarchical selection (HS) variant lets followers independently refine a shared candidate set proposed by the anchor. With four-layer sharing, LatentIndex reduces logical indexer-cache storage by 61.1% on DeepSeek-V3.2. Across DeepSeek-V3.2 and GLM-5, training-free LatentIndex improves head-wise attention-mass recall over IndexCache by up to 3.28 percentage points while maintaining RULER and LongBench performance close to native DSA. HS further achieves 2.30-2.72 times decode indexer speedups over DSA across 8K-128K contexts, retaining most of LatentIndex's recall. LatentIndex offers a new perspective on cross-layer indexing: sharing continuous representations rather than discrete selections enables efficient reuse while preserving layer-specific token selection.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 29 references that are in the map. First posted on arXiv 3 Oct 2026.
Builds on
24 of 29 references.
References · 24
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2023SWE-bench: Can Language Models Resolve Real-World GitHub Issues?cited by 3,373
- 2021WebGPT: Browser-assisted question-answering with human feedbackcited by 1,745
- 2020Reformer: The Efficient Transformercited by 1,668
- 2019Generating Long Sequences with Sparse Transformerscited by 1,546
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,417
- 2024RULER: What's the Real Context Size of Your Long-Context Language Models?cited by 1,346
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,135
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
- 2025MoBA: Mixture of Block Attention for Long-Context LLMscited by 198
- 2024You Only Cache Once: Decoder-Decoder Architectures for Language Modelscited by 144
- 2024Reducing Transformer Key-Value Cache Size with Cross-Layer Attentioncited by 131
12 more
- 2024Loki: Low-rank Keys for Efficient Sparse Attentioncited by 89
- 2026DeepSeek-V4.1-Flash: Pushing the Limits of KV Cache Compressioncited by 76
- 2026MiniMax Sparse Attentioncited by 44
- 2024KVSharer: Efficient Inference via Layer-Wise Dissimilar KV Cache Sharingcited by 41
- 2026On the Design of Qwen3.8-Next Architecture: Evaluation, Efficiency, and Training Stabilitycited by 35
- 2026IndexCache: Accelerating Sparse Attention via Cross-Layer Index Reusecited by 31
- 2024MLKV: Multi-Layer Key-Value Heads for Memory Efficient Transformer Decodingcited by 21
- 2026HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attentioncited by 12
- 2025CommonKV: Compressing KV Cache with Cross-layer Parameter Sharingcited by 9
- 2026MISA: Mixture of Indexer Sparse Attention for Long-Context LLM Inferencecited by 7
- 2026SparDA: Sparse Decoupled Attention for Efficient Long-Context LLM Inferencecited by 5
- 2026PIVOT: Efficient Query-Group Indexing for Token-Level Sparse Attentioncited by 3
Built on by
Not cited yet.