Predicting Attention Sparsity in Transformers
Not on the map. Why?
Abstract (arXiv)
Transformers' quadratic complexity with respect to the input sequence length has motivated a body of work on efficient sparse approximations to softmax. An alternative path, used by entmax transformers, consists of having built-in exact sparse attention; however this approach still requires quadratic computation. In this paper, we propose Sparsefinder, a simple model trained to identify the sparsity pattern of entmax attention before computing it. We experiment with three variants of our method, based on distances, quantization, and clustering, on two tasks: machine translation (attention in the decoder) and masked language modeling (encoder-only). Our work provides a new angle to study model efficiency by doing extensive analysis of the tradeoff between the sparsity and recall of the predicted attention graph. This allows for detailed comparison between different models along their Pareto curves, important to guide future benchmarks for sparse attention models.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 24 Sep 2021.
Builds on
29 of 42 references.
References · 29
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,898
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2018A Call for Clarity in Reporting BLEU Scorescited by 1,790
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Reformer: The Efficient Transformercited by 1,658
- 2020Rethinking Attention with Performerscited by 1,584
17 more
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2019Analyzing Multi-Head Self-Attention: Specialized Heads Do the Heavy Lifting, the Rest Can Be Prunedcited by 844
- 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 469
- 2016From Softmax to Sparsemax: A Sparse Model of Attention and Multi-Label Classificationcited by 337
- 2020Sparse Sinkhorn Attentioncited by 250
- 2019Sparse Sequence-to-Sequence Modelscited by 167
- 2019Adaptively Sparse Transformerscited by 154
- 2020Fast Transformers with Clustered Attentioncited by 123
- 2018Multilingual Constituency Parsing with Self-Attention and Pre-Trainingcited by 117
- 2021Do Long-Range Language Models Actually Use Long-Range Context?cited by 92
- 2019Explicit Sparse Transformer: Concentrated Attention Through Explicit Selectioncited by 61
- 2021Measuring and Increasing Context Usage in Context-Aware Machine Translationcited by 48
- 2020SMYRF: Efficient Attention using Asymmetric Clusteringcited by 43
- 2020Fixed Encoder Self-Attention Patterns in Transformer-Based Machine Translationcited by 42
- 2021Sparse Attention with Linear Unitscited by 41
- 2020Cluster-Former: Clustering-based Sparse Transformer for Long-Range Dependency Encodingcited by 19
Built on by
Citing papers per year: 2022: 2; 2023: 2; 2024: 3; 2025: 4; 2026: 2.
13 papers.
Sort:
By area:
- 2024Real-Time Video Generation with Pyramid Attention Broadcastcited by 140
- 2022Efficient Methods for Natural Language Processing: A Surveycited by 78
- 2025Training-free and Adaptive Sparse Attention for Efficient Long Video Generationcited by 65
- 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Designcited by 41
- 2023The Efficiency Spectrum of Large Language Models: An Algorithmic Surveycited by 25
- 2025Long-Context Generalization with Sparse Attentioncited by 18
- 2025AdaSplash: Adaptive Sparse Flash Attentioncited by 12
- 2023Distill or Annotate? Cost-Efficient Fine-Tuning of Compact Modelscited by 11
- 2024Conditional computation in neural networks: principles and research trendscited by 10
- 2024Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanismcited by 4
- 2026Improving Sparse Autoencoder with Dynamic Attentioncited by 2
- 2026Perspectives on Tsallis Statistics for Artificial Intelligencecited by 1
- 2026Perspectives on Tsallis Statistics for Artificial Intelligence2 Aug 2026
- 2026Improving Sparse Autoencoder with Dynamic Attention16 Apr 2026
- 2025BiSparse-AAS: Bilinear Sparse Attention and Adaptive Spans Framework for Scalable and Efficient Text Summarization31 Oct 2025
- 2025Long-Context Generalization with Sparse Attention19 Jun 2025
- 2025Training-free and Adaptive Sparse Attention for Efficient Long Video Generation28 Feb 2025
- 2025AdaSplash: Adaptive Sparse Flash Attention17 Feb 2025
- 2024Reducing Reasoning Costs: The Path of Optimization for Chain of Thought via Sparse Attention Mechanism14 Nov 2024
- 2024Real-Time Video Generation with Pyramid Attention Broadcast22 Aug 2024
- 2024Conditional computation in neural networks: principles and research trends12 Mar 2024
- 2023The Efficiency Spectrum of Large Language Models: An Algorithmic Survey1 Dec 2023
- 2023Distill or Annotate? Cost-Efficient Fine-Tuning of Compact Models2 May 2023
- 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Design18 Oct 2022
1 more
- 2022Efficient Methods for Natural Language Processing: A Survey31 Aug 2022
- 2024Real-Time Video Generation with Pyramid Attention Broadcastcited by 140
- 2022Efficient Methods for Natural Language Processing: A Surveycited by 78
- 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Designcited by 41
- 2023The Efficiency Spectrum of Large Language Models: An Algorithmic Surveycited by 25
- 2025Long-Context Generalization with Sparse Attentioncited by 18
- 2025AdaSplash: Adaptive Sparse Flash Attentioncited by 12
- 2023Distill or Annotate? Cost-Efficient Fine-Tuning of Compact Modelscited by 11
- 2026Improving Sparse Autoencoder with Dynamic Attentioncited by 2
- 2026Perspectives on Tsallis Statistics for Artificial Intelligencecited by 1
- 2025BiSparse-AAS: Bilinear Sparse Attention and Adaptive Spans Framework for Scalable and Efficient Text Summarizationcited by 0
- 2026Perspectives on Tsallis Statistics for Artificial Intelligence2 Aug 2026
- 2026Improving Sparse Autoencoder with Dynamic Attention16 Apr 2026
- 2025BiSparse-AAS: Bilinear Sparse Attention and Adaptive Spans Framework for Scalable and Efficient Text Summarization31 Oct 2025
- 2025Long-Context Generalization with Sparse Attention19 Jun 2025
- 2025AdaSplash: Adaptive Sparse Flash Attention17 Feb 2025
- 2024Real-Time Video Generation with Pyramid Attention Broadcast22 Aug 2024
- 2023The Efficiency Spectrum of Large Language Models: An Algorithmic Survey1 Dec 2023
- 2023Distill or Annotate? Cost-Efficient Fine-Tuning of Compact Models2 May 2023
- 2022ViTCoD: Vision Transformer Acceleration via Dedicated Algorithm and Accelerator Co-Design18 Oct 2022
- 2022Efficient Methods for Natural Language Processing: A Survey31 Aug 2022