MISA: Mixture of Indexer Sparse Attention for Long-Context LLM Inference
Not on the map. Why?
Abstract (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 the main attention. To remain expressive, the indexer uses many query heads (for example, 64 on DeepSeek-V3.2) that share the same selected token set; this multi-head design is precisely what makes the indexer the dominant cost on long contexts. We propose MISA (Mixture of Indexer Sparse Attention), a drop-in replacement for the DSA indexer that treats its indexer heads as a pool of mixture-of-experts. A lightweight router uses cheap block-level statistics to pick a query-dependent subset of only a few active heads, and only those heads run the heavy token-level scoring. This preserves the diversity of the original indexer pool while reducing the per-query cost from scoring every prefix token with every head to scoring it with only a handful of routed heads, plus a negligible router term computed on a small set of pooled keys. We further introduce a hierarchical variant of MISA that uses the routed pass to keep an enlarged candidate set and then re-ranks it with the original DSA indexer to recover the final selected tokens almost exactly. With only eight active heads and no additional training, MISA matches the dense DSA indexer on LongBench across DeepSeek-V3.2 and GLM-5 while running with eight and four times fewer indexer heads respectively, and outperforms HISA on average. It also preserves fully green Needle-in-a-Haystack heatmaps up to a 128K-token context and recovers more than 92% of the tokens selected by the DSA indexer per layer. Our TileLang kernel delivers roughly a 3.82 times speedup over DSA's original indexer kernel on a single NVIDIA H200 GPU.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). Builds on 25 of its 29 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
25 of 29 references.
References · 25
- 2025Qwen3 Technical Reportcited by 8,820
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,509
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,186
- 2024Mixtral of Expertscited by 1,823
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,631
- 2019Generating Long Sequences with Sparse Transformerscited by 1,546
- 2026DeepSeek-V4: Towards Highly Efficient Million-Token Context Intelligencecited by 1,040
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 880
- 2024DeepSeekMoE: Towards Ultimate Expert Specialization in Mixture-of-Experts Language Modelscited by 867
13 more
- 2025DeepSeek-V3.2: Pushing the Frontier of Open Large Language Modelscited by 815
- 2026GLM-5: from Vibe Coding to Agentic Engineeringcited by 587
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 501
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 407
- 2025MoBA: Mixture of Block Attention for Long-Context LLMscited by 198
- 2024InfLLM: Training-Free Long-Context Extrapolation for LLMs with an Efficient Context Memorycited by 197
- 2025MiniMax-01: Scaling Foundation Models with Lightning Attentioncited by 166
- 2024SeerAttention: Learning Intrinsic Sparse Attention in Your LLMscited by 124
- 2024MagicPIG: LSH Sampling for Efficient LLM Generationcited by 111
- 2022Mixture of Attention Heads: Selecting Attention Heads Per Tokencited by 60
- 2024MoH: Multi-Head Attention as Mixture-of-Head Attentioncited by 44
- 2026IndexCache: Accelerating Sparse Attention via Cross-Layer Index Reusecited by 31
- 2026HISA: Efficient Hierarchical Indexing for Fine-Grained Sparse Attentioncited by 12
Built on by
Citing papers per year: 2026: 7.
7 papers.
- 2026SpotAttention: Plug-In Block-Sparse Routing for Pretrained Long-Context Transformerscited by 5
- 2026PIVOT: Efficient Query-Group Indexing for Token-Level Sparse Attentioncited by 3
- 2026Think Before You Grid-Search: Floor-First Triage for LLM Servingcited by 0
- 2026Block-Sparse Attention with Semantic-Geometric Decoupled Routingcited by 0
- 2026LatentIndex: Cross-Layer Sharing with Layer-Specific Selection for Sparse Attentioncited by 0
- 2026SPIN: Shadow Predictive Indexer for Sparse Attentioncited by 0
- 2026DoSA: Dots Sparse Attentioncited by 0
- 2026SPIN: Shadow Predictive Indexer for Sparse Attention6 Oct 2026
- 2026LatentIndex: Cross-Layer Sharing with Layer-Specific Selection for Sparse Attention3 Oct 2026
- 2026DoSA: Dots Sparse Attention26 Sep 2026
- 2026Block-Sparse Attention with Semantic-Geometric Decoupled Routing19 Sep 2026
- 2026PIVOT: Efficient Query-Group Indexing for Token-Level Sparse Attention27 Jul 2026
- 2026Think Before You Grid-Search: Floor-First Triage for LLM Serving7 Jul 2026
- 2026SpotAttention: Plug-In Block-Sparse Routing for Pretrained Long-Context Transformers22 Jun 2026
Similar, not cited
Close in wording, no citation either way
- 2026Simplified Sparse Attention via Gist Tokens
- 2026You Only Index Once: Cross-Layer Sparse Attention with Shared Routing
- 2026Self-Indexing Attention for Compression-Compatible Sparse Long-Context LLM Inference
- 2026FlashMemory-DeepSeek-V4: Lightning Index Ultra-Long Context via Lookahead Sparse Attention
- 2026LISA: Linear-Indexed Sparse Attention for Efficient Long-Context Reasoning
- 2026Sparse Attention as a Range Searching Problem: Towards an Inference-Efficient Index for KV Cache
- 2026Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Steps
- 2026CLAA: Cross-Layer Attention Aggregation for Accelerating LLM Prefill