mlsanityData to 13 Oct 2026

TidalDecode: Fast and Accurate LLM Decoding with Position Persistent Sparse Attention

arXiv 2410.05076 ↗First posted 7 Oct 2024cs.LG cs.AI cs.CLcited by 28

Not on the map. Why?

Abstract (arXiv)

Large language models (LLMs) have driven significant advancements across diverse NLP tasks, with long-context models gaining prominence for handling extended inputs. However, the expanding key-value (KV) cache size required by Transformer architectures intensifies the memory constraints, particularly during the decoding phase, creating a significant bottleneck. Existing sparse attention mechanisms designed to address this bottleneck have two limitations: (1) they often fail to reliably identify the most relevant tokens for attention, and (2) they overlook the spatial coherence of token selection across consecutive Transformer layers, which can lead to performance degradation and substantial overhead in token selection. This paper introduces TidalDecode, a simple yet effective algorithm and system for fast and accurate LLM decoding through position persistent sparse attention. TidalDecode leverages the spatial coherence of tokens selected by existing sparse attention methods and introduces a few token selection layers that perform full attention to identify the tokens with the highest attention scores, while all other layers perform sparse attention with the pre-selected tokens. This design enables TidalDecode to substantially reduce the overhead of token selection for sparse attention without sacrificing the quality of the generated results. Evaluation on a diverse set of LLMs and tasks shows that TidalDecode closely matches the generative performance of full attention methods while reducing the LLM decoding latency by up to 2.1x.

Key facts. Cited by 28 papers in the map (data through 13 Oct 2026). Builds on 14 of its 21 references that are in the map. First posted on arXiv 7 Oct 2024.

Builds on

14 of 21 references.

References · 14

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,376
  2. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,831
  3. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,637
  4. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,570
  5. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,137
  6. 2020Reformer: The Efficient Transformercited by 1,662
  7. 2020Rethinking Attention with Performerscited by 1,594
  8. 2019Generating Long Sequences with Sparse Transformerscited by 1,538
  9. 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 813
  10. 2019Compressive Transformers for Long-Range Sequence Modellingcited by 707
  11. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 489
  12. 2021Efficient Attentions for Long Document Summarizationcited by 342
2 more
  1. 2024Beyond the Limits: A Survey of Techniques to Extend the Context Length in Large Language Modelscited by 72
  2. 2024Discovering the Gems in Early Layers: Accelerating Long-Context LLMs with 1000x Input Token Reductioncited by 39

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2024: 1; 2025: 9; 2026: 18.

28 papers.

Sort:

By area:

  1. 2025Sparse VideoGen: Accelerating Video Diffusion Transformers with Spatial-Temporal Sparsitycited by 213
  2. 2024Dynamic-LLaVA: Efficient Multimodal Large Language Models via Dynamic Vision-language Context Sparsificationcited by 59
  3. 2025Twilight: Adaptive Attention Sparsity with Hierarchical Top-p Pruningcited by 48
  4. 2026IndexCache: Accelerating Sparse Attention via Cross-Layer Index Reusecited by 28
  5. 2025Empowering GraphRAG with Knowledge Filtering and Integrationcited by 15
  6. 2025SlimInfer: Accelerating Long-Context LLM Inference via Dynamic Token Pruningcited by 13
  7. 2025BLASST: Dynamic BLocked Attention Sparsity via Softmax Thresholdingcited by 13
  8. 2025CommonKV: Compressing KV Cache with Cross-layer Parameter Sharingcited by 9
  9. 2025Kascade: A Practical Sparse Attention Method for Long-Context LLM Inferencecited by 9
  10. 2026HySparse: A Hybrid Sparse Attention Architecture with Oracle Token Selection and KV Cache Sharingcited by 8
  11. 2026Value-Aware Stochastic KV Cache Eviction for Reasoning Modelscited by 8
  12. 2025DELTA: Dynamic Layer-Aware Token Attention for Efficient Long-Context Reasoningcited by 5
16 more
  1. 2026LycheeDecode: Accelerating Long-Context LLM Inference via Hybrid-Head Sparse Decodingcited by 5
  2. 2026QUOKA: Query-Oriented KV Selection For Efficient LLM Prefillcited by 3
  3. 2026Fast Forward: Accelerating LLM Prefill with Predictive FFN Sparsitycited by 1
  4. 2026MAC-Attention: a Match-Amend-Complete Scheme for Fast and Accurate Attention Computationcited by 1
  5. 2026STS: Efficient Sparse Attention with Speculative Token Sparsitycited by 1
  6. 2026Vortex: Efficient and Programmable Sparse Attention Serving for AI Agentscited by 1
  7. 2026You Only Index Once: Cross-Layer Sparse Attention with Shared Routingcited by 1
  8. 2026LiteTopK: Exploiting the Curse of Dimensionality for a Fused Indexer-TopK Kernel in Long-Context Sparse Attentioncited by 1
  9. 2026LOCKS: Page-Local Compact Key Summaries for Efficient Long-Context Decodingcited by 1
  10. 2026LongCat Sparse Attention: Taming the Lightning via Streaming-aware Hierarchical Cross-Layer Indexingcited by 1
  11. 2026Language Models Can Control Their Own Attentioncited by 1
  12. 2026ASPIRE: Asynchronous Batched Self-Speculative Decoding for Long-Context LLM Inferencecited by 1
  13. 2025A Faster Generalized Two-Stage Approximate Top-Kcited by 0
  14. 2026HyLRA: Hybrid Layer Reuse Attention for Efficient Long-Context Inferencecited by 0
  15. 2026Slow-Fast Inference: Training-Free Inference Acceleration via Within-Sentence Support Stabilitycited by 0
  16. 2026Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decodingcited by 0