Efficient Sparse Attention needs Adaptive Token Release
Not on the map. Why?
Abstract (arXiv)
In recent years, Large Language Models (LLMs) have demonstrated remarkable capabilities across a wide array of text-centric tasks. However, their `large' scale introduces significant computational and storage challenges, particularly in managing the key-value states of the transformer, which limits their wider applicability. Therefore, we propose to adaptively release resources from caches and rebuild the necessary key-value states. Particularly, we accomplish this by a lightweight controller module to approximate an ideal top-K sparse attention. This module retains the tokens with the highest top-K attention weights and simultaneously rebuilds the discarded but necessary tokens, which may become essential for future decoding. Comprehensive experiments in natural language generation and modeling reveal that our method is not only competitive with full attention in terms of performance but also achieves a significant throughput improvement of up to 221.8%. The code for replication is available on the https://github.com/WHUIR/ADORE.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 33 of its 53 references that are in the map. First posted on arXiv 2 Jul 2024.
Builds on
33 of 53 references.
References · 33
- 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,767
- 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,355
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,281
21 more
- 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
- 2022Token Merging: Your ViT But Fastercited by 995
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2023Enhancing Chat Language Models by Scaling High-quality Instructional Conversationscited by 825
- 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 567
- 2019SAMSum Corpus: A Human-annotated Dialogue Dataset for Abstractive Summarizationcited by 530
- 2023Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Timecited by 428
- 2022DeepSpeed Inference: Enabling Efficient Inference of Transformer Models at Unprecedented Scalecited by 403
- 2024LLMLingua-2: Data Distillation for Efficient and Faithful Task-Agnostic Prompt Compressioncited by 343
- 2023Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Timecited by 247
- 2017Gate-Variants of Gated Recurrent Unit (GRU) Neural Networkscited by 239
- 2022Petals: Collaborative Inference and Fine-tuning of Large Modelscited by 84
- 2023Predictive Pipelined Decoding: A Compute-Latency Trade-off for Exact LLM Decodingcited by 40
- 2023PPT: Token Pruning and Pooling for Efficient Vision Transformerscited by 37
- 2022DynaST: Dynamic Sparse Transformer for Exemplar-Guided Image Generationcited by 24
- 2021Early Exiting with Ensemble Internal Classifierscited by 19
- 2023User Retention-oriented Recommendation with Decision Transformercited by 14
- 2023Sparsity-Guided Holistic Explanation for LLMs with Interpretable Inference-Time Interventioncited by 12
- 2023Context Compression for Auto-regressive Transformers with Sentinel Tokenscited by 8
- 2023NarrowBERT: Accelerating Masked Language Model Pretraining and Inferencecited by 3
- 2022Whole Page Unbiased Learning to Rankcited by 2
Built on by
Citing papers per year: 2024: 1; 2025: 3.
4 papers.
- 2025Cognitive Memory in Large Language Modelscited by 28
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Evictioncited by 3
- 2024XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inferencecited by 2
- 2025ReSSFormer: A Recursive Sparse Structured Transformer for Scalable and Long-Context Reasoningcited by 0
- 2025Alleviating Forgetfulness of Linear Attention by Hybrid Sparse Attention and Contextualized Learnable Token Eviction23 Oct 2025
- 2025ReSSFormer: A Recursive Sparse Structured Transformer for Scalable and Long-Context Reasoning2 Oct 2025
- 2025Cognitive Memory in Large Language Models3 Apr 2025
- 2024XKV: Personalized KV Cache Memory Reduction for Long-Context LLM Inference8 Dec 2024