FASA: Frequency-aware Sparse Attention
On the map: Efficient LLM inference and serving → KV cache optimization
Abstract (arXiv)
The deployment of Large Language Models (LLMs) faces a critical bottleneck when handling lengthy inputs: the prohibitive memory footprint of the Key Value (KV) cache. To address this bottleneck, the token pruning paradigm leverages attention sparsity to selectively retain a small, critical subset of tokens. However, existing approaches fall short, with static methods risking irreversible information loss and dynamic strategies employing heuristics that insufficiently capture the query-dependent nature of token importance. We propose FASA, a novel framework that achieves query-aware token eviction by dynamically predicting token importance. FASA stems from a novel insight into RoPE: the discovery of functional sparsity at the frequency-chunk (FC) level. Our key finding is that a small, identifiable subset of "dominant" FCs consistently exhibits high contextual agreement with the full attention head. This provides a robust and computationally free proxy for identifying salient tokens. Building on this insight, FASA first identifies a critical set of tokens using dominant FCs, and then performs focused attention computation solely on this pruned subset. Across a spectrum of long-context tasks, from sequence modeling to complex CoT reasoning, FASA consistently outperforms all token-eviction baselines and achieves near-oracle accuracy, demonstrating remarkable robustness even under constraint budgets. Notably, on LongBench-V1, FASA reaches nearly 100% of full-KV performance when only keeping 256 tokens, and achieves 2.56× speedup using just 18.9% of the cache on AIME24.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Placed in KV cache optimization, one of 12 directions in Efficient LLM inference and serving. Builds on 55 of its 62 references that are in the map. First posted on arXiv 3 Feb 2026.
Builds on
55 of 62 references.
Closest ancestors · 17
Same direction, newest first
- 2025RocketKV: Accelerating Long-Context LLM Inference via Two-Stage KV Cache Compression19 Feb
- 2024A Survey on Large Language Model Acceleration based on KV Cache Management27 Dec
- 2024ClusterKV: Manipulating LLM KV Cache in Semantic Space for Recallable Compression4 Dec
- 2024ShadowKV: KV Cache in Shadows for High-Throughput Long-Context LLM Inference28 Oct
- 2024LoRC: Low-Rank Compression for LLMs KV Cache with a Progressive Compression Strategy4 Oct
- 2024Eigen Attention: Attention in Low-Rank Space for KV Cache Compression10 Aug
- 2024Palu: Compressing KV-Cache with Low-Rank Projection30 Jul
- 2024Model Tells You Where to Merge: Adaptive KV Cache Merging for LLMs on Long-Context Tasks11 Jul
- 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inference16 Jun
- 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funneling4 Jun
- 2024MiniCache: KV Cache Compression in Depth Dimension for Large Language Models23 May
- 2024SnapKV: LLM Knows What You are Looking for Before Generation22 Apr
5 more
- 2024Get More with LESS: Synthesizing Recurrence with KV Cache Compression for Efficient LLM Inference14 Feb
- 2023SparQ Attention: Bandwidth-Efficient LLM Inference8 Dec
- 2023Model Tells You What to Discard: Adaptive KV Cache Compression for LLMs3 Oct
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models24 Jun
- 2023Scissorhands: Exploiting the Persistence of Importance Hypothesis for LLM KV Cache Compression at Test Time26 May
Other references · 38
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Measuring Mathematical Problem Solving With the MATH Datasetcited by 5,203
- 2024Qwen2.5 Technical Reportcited by 4,713
- 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
- 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
- 2023Qwen Technical Reportcited by 3,273
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
- 2023LongBench: A Bilingual, Multitask Benchmark for Long Context Understandingcited by 1,378
- 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
26 more
- 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
- 2019Compressive Transformers for Long-Range Sequence Modellingcited by 699
- 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
- 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
- 2024Massive Activations in Large Language Modelscited by 277
- 2020Evaluating Factuality in Generation with Dependency-level Entailmentcited by 122
- 2024RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrievalcited by 114
- 2024Round and Round We Go! What makes Rotary Positional Encodings useful?cited by 111
- 2023From CLIP to DINO: Visual Encoders Shout in Multi-modal Large Language Modelscited by 96
- 2023Attention Sorting Combats Recency Bias In Long Context Language Modelscited by 89
- 2024Loki: Low-rank Keys for Efficient Sparse Attentioncited by 87
- 2025SWE-Exp: Experience-Driven Software Issue Resolutioncited by 64
- 2025VideoRoPE: What Makes for Good Video Rotary Position Embedding?cited by 63
- 2024Squeezed Attention: Accelerating Long Context Length LLM Inferencecited by 56
- 2024SepLLM: Accelerate Large Language Models by Compressing One Segment into One Separatorcited by 41
- 2026SWE-Pruner: Self-Adaptive Context Pruning for Coding Agentscited by 40
- 2025LongCodeZip: Compress Long Context for Code Language Modelscited by 38
- 2025AttentionRAG: Attention-Guided Context Pruning in Retrieval-Augmented Generationcited by 19
- 2025HS-STaR: Hierarchical Sampling for Self-Taught Reasoners via Difficulty Estimation and Budget Reallocationcited by 18
- 2026Harder Is Better: Boosting Mathematical Reasoning via Difficulty-Aware GRPO and Multi-Aspect Question Reformulationcited by 18
- 2025AdaCuRL: Adaptive Curriculum Reinforcement Learning with Invalid Sample Mitigation and Historical Revisitingcited by 17
- 2024Unveiling Factual Recall Behaviors of Large Language Models through Knowledge Neuronscited by 15
- 2024PrefixKV: Adaptive Prefix KV Cache is What Vision Instruction-Following Models Need for Efficient Generationcited by 13
- 2025Attention as a Compass: Efficient Exploration for Process-Supervised RL in Reasoning Modelscited by 13
- 2025Position Bias Mitigates Position Bias:Mitigate Position Bias Through Inter-Position Knowledge Distillationcited by 8
- 2025Uncertainty Unveiled: Can Exposure to More In-context Examples Mitigate Uncertainty for Large Language Models?cited by 5
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026DreamX-World 1.0: A General-Purpose Interactive World Modelcited by 33
- 2026Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Stepscited by 3
- 2026Text Template Tokens Are Implicit Semantic Registers in Diffusion Transformerscited by 1
- 2026CompKV: Compensation-Aware KV Selection for Long-Context LLM Inferencecited by 1
- 2026SCOPE: Subspace Clustering with Online Per-Head Top-K Estimation for Sparse Video Attentioncited by 0
- 2026HHR: Hierarchical Hash Retrieval for Efficient LLM Generationcited by 0
- 2026HHR: Hierarchical Hash Retrieval for Efficient LLM Generation1 Oct 2026
- 2026CompKV: Compensation-Aware KV Selection for Long-Context LLM Inference22 Sep 2026
- 2026SCOPE: Subspace Clustering with Online Per-Head Top-K Estimation for Sparse Video Attention13 Aug 2026
- 2026Text Template Tokens Are Implicit Semantic Registers in Diffusion Transformers21 Jul 2026
- 2026DreamX-World 1.0: A General-Purpose Interactive World Model15 Jun 2026
- 2026Full Attention Strikes Back: Transferring Full Attention into Sparse within Hundred Training Steps16 May 2026
Similar, not cited
Close in wording, no citation either way
- 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attention
- 2025Every Token Counts: Generalizing 16M Ultra-Long Context in Large Language Models
- 2026STS: Efficient Sparse Attention with Speculative Token Sparsity
- 2025Progressive Sparse Attention: Algorithm and System Co-design for Efficient Attention in LLM Serving
- 2024TokenSelect: Efficient Long-Context Inference and Length Extrapolation for LLMs via Dynamic Token-Level KV Cache Selection
- 2025Training-free Context-adaptive Attention for Efficient Long Context Modeling
- 2026CLAA: Cross-Layer Attention Aggregation for Accelerating LLM Prefill
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matters