mlsanityData to 14 Oct 2026

Towards Interpretable and Efficient Attention: Compressing All by Contracting a Few

arXiv 2509.16875 ↗First posted 21 Sep 2025cs.LG cs.CVcited by 2

Not on the map. Why?

Abstract (arXiv)

Attention mechanisms have achieved significant empirical success in multiple fields, but their underlying optimization objectives remain unclear yet. Moreover, the quadratic complexity of self-attention has become increasingly prohibitive. Although interpretability and efficiency are two mutually reinforcing pursuits, prior work typically investigates them separately. In this paper, we propose a unified optimization objective that derives inherently interpretable and efficient attention mechanisms through algorithm unrolling. Precisely, we construct a gradient step of the proposed objective with a set of forward-pass operations of our Contract-and-Broadcast Self-Attention (CBSA), which compresses input tokens towards low-dimensional structures by contracting a few representatives of them. This novel mechanism can not only scale linearly by fixing the number of representatives, but also covers the instantiations of varied attention mechanisms when using different sets of representatives. We conduct extensive experiments to demonstrate comparable performance and superior advantages over black-box attention mechanisms on visual tasks. Our work sheds light on the integration of interpretability and efficiency, as well as the unified formula of attention mechanisms.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 56 of its 73 references that are in the map. First posted on arXiv 21 Sep 2025.

Builds on

56 of 73 references.

References · 56

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  5. 2020End-to-End Object Detection with Transformerscited by 7,414
  6. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,403
  7. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,968
  8. 2017Squeeze-and-Excitation Networkscited by 4,789
  9. 2020Longformer: The Long-Document Transformercited by 3,413
  10. 2018CBAM: Convolutional Block Attention Modulecited by 2,477
  11. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
  12. 2021Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutionscited by 1,962
38 more
  1. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
  2. 2020Rethinking Attention with Performerscited by 1,601
  3. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  4. 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
  5. 2021Swin Transformer V2: Scaling Up Capacity and Resolutioncited by 1,228
  6. 2016Semantic Understanding of Scenes through the ADE20K Datasetcited by 1,069
  7. 2022Toy Models of Superpositioncited by 971
  8. 2023Vision Transformers Need Registerscited by 871
  9. 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
  10. 2021Segmenter: Transformer for Semantic Segmentationcited by 855
  11. 2018Image Transformercited by 772
  12. 2021MetaFormer Is Actually What You Need for Visioncited by 524
  13. 2020Hopfield Networks is All You Needcited by 475
  14. 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 471
  15. 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 471
  16. 2023Symbolic Discovery of Optimization Algorithmscited by 434
  17. 2019Algorithm Unrolling: Interpretable, Efficient Deep Learning for Signal and Image Processingcited by 421
  18. 2021Attention is Not All You Need: Pure Attention Loses Rank Doubly Exponentially with Depthcited by 419
  19. 2021The Intrinsic Dimension of Images and Its Impact on Learningcited by 315
  20. 2021DeepViT: Towards Deeper Vision Transformercited by 289
  21. 2020Sparse Sinkhorn Attentioncited by 251
  22. 2023Landmark Attention: Random-Access Infinite Context Length for Transformerscited by 213
  23. 2023FLatten Transformer: Vision Transformer using Focused Linear Attentioncited by 171
  24. 2020Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reductioncited by 142
  25. 2019Star-Transformercited by 94
  26. 2023Agent Attention: On the Integration of Softmax and Linear Attentioncited by 90
  27. 2021ReduNet: A White-box Deep Network from the Principle of Maximizing Rate Reductioncited by 84
  28. 2023White-Box Transformers via Sparse Rate Reductioncited by 80
  29. 2021Is Attention Better Than Matrix Decomposition?cited by 77
  30. 2024Active-Dormant Attention Heads: Mechanistically Demystifying Extreme-Token Phenomena in LLMscited by 56
  31. 2025Log-Linear Attentioncited by 40
  32. 2024An Image is Worth More Than 16x16 Patches: Exploring Transformers on Individual Pixelscited by 33
  33. 2025Scaling Laws in Patchification: An Image Is Worth 50,176 Tokens And Morecited by 28
  34. 2023Emergence of Segmentation with Minimalistic White-Box Transformerscited by 24
  35. 2025Efficient Attention Mechanisms for Large Language Models: A Surveycited by 22
  36. 2021Centroid Transformers: Learning to Abstract with Attentioncited by 20
  37. 2024A Global Geometric Analysis of Maximal Coding Rate Reductioncited by 13
  38. 2023Unsupervised Manifold Linearizing and Clusteringcited by 12

50 most cited of 56 All 56 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 2.

2 papers.