mlsanityData to 7 Oct 2026

SAS: Simulated Attention Score

arXiv 2507.07694 ↗First posted 10 Jul 2025cs.CLcited by 3

Not on the map. Why?

Abstract (arXiv)

The attention mechanism is a core component of the Transformer architecture. Various methods have been developed to compute attention scores, including multi-head attention (MHA), multi-query attention, group-query attention and so on. We further analyze the MHA and observe that its performance improves as the number of attention heads increases, provided the hidden size per head remains sufficiently large. Therefore, increasing both the head count and hidden size per head with minimal parameter overhead can lead to significant performance gains at a low cost. Motivated by this insight, we introduce Simulated Attention Score (SAS), which maintains a compact model size while simulating a larger number of attention heads and hidden feature dimension per head. This is achieved by projecting a low-dimensional head representation into a higher-dimensional space, effectively increasing attention capacity without increasing parameter count. Beyond the head representations, we further extend the simulation approach to feature dimension of the key and query embeddings, enhancing expressiveness by mimicking the behavior of a larger model while preserving the original model size. To control the parameter cost, we also propose Parameter-Efficient Attention Aggregation (PEAA). Comprehensive experiments on a variety of datasets and tasks demonstrate the effectiveness of the proposed SAS method, achieving significant improvements over different attention variants.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 81 of its 103 references that are in the map. First posted on arXiv 10 Jul 2025.

Builds on

81 of 103 references.

References · 81

  1. 2017Attention Is All You Needcited by 59,932
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  4. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 13,958
  5. 2020Scaling Laws for Neural Language Modelscited by 6,411
  6. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
  7. 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 4,993
  8. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  9. 2023Mamba: Linear-Time Sequence Modeling with Selective State Spacescited by 4,616
  10. 2021RoFormer: Enhanced Transformer with Rotary Position Embeddingcited by 4,581
  11. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,530
  12. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
38 more
  1. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  2. 2021Efficiently Modeling Long Sequences with Structured State Spacescited by 2,424
  3. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  4. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  5. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  6. 2018CommonsenseQA: A Question Answering Challenge Targeting Commonsense Knowledgecited by 1,793
  7. 2020Rethinking Attention with Performerscited by 1,584
  8. 2019Generating Long Sequences with Sparse Transformerscited by 1,523
  9. 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
  10. 2023GQA: Training Generalized Multi-Query Transformer Models from Multi-Head Checkpointscited by 1,311
  11. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
  12. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  13. 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,100
  14. 2021Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolationcited by 1,085
  15. 2024Gemma: Open Models Based on Gemini Research and Technologycited by 889
  16. 2023RWKV: Reinventing RNNs for the Transformer Eracited by 814
  17. 2022Simplified State Space Layers for Sequence Modelingcited by 776
  18. 2017Crowdsourcing Multiple Choice Science Questionscited by 742
  19. 2019Fast Transformer Decoding: One Write-Head is All You Needcited by 700
  20. 2024KIVI: A Tuning-Free Asymmetric 2bit Quantization for KV Cachecited by 604
  21. 2023Retentive Network: A Successor to Transformer for Large Language Modelscited by 594
  22. 2024KVQuant: Towards 10 Million Context Length LLM Inference with KV Cache Quantizationcited by 571
  23. 2015Empirical Evaluation of Rectified Activations in Convolutional Networkcited by 515
  24. 2024Quest: Query-Aware Sparsity for Efficient Long-Context LLM Inferencecited by 487
  25. 2024Gated Delta Networks: Improving Mamba2 with Delta Rulecited by 483
  26. 2024PyramidKV: Dynamic KV Cache Compression based on Pyramidal Information Funnelingcited by 420
  27. 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
  28. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 337
  29. 2023Trained Transformers Learn Linear Models In-Contextcited by 331
  30. 2024Learning to (Learn at Test Time): RNNs with Expressive Hidden Statescited by 329
  31. 2024LongRoPE: Extending LLM Context Window Beyond 2 Million Tokenscited by 302
  32. 2020Sparse Sinkhorn Attentioncited by 250
  33. 2023LongLoRA: Efficient Fine-tuning of Long-Context Large Language Modelscited by 243
  34. 2021LongT5: Efficient Text-To-Text Transformer for Long Sequencescited by 232
  35. 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 211
  36. 2023ReLoRA: High-Rank Training Through Low-Rank Updatescited by 200
  37. 2024InfLoRA: Interference-Free Low-Rank Adaptation for Continual Learningcited by 189
  38. 2023Progressive-Hint Prompting Improves Reasoning in Large Language Modelscited by 147

50 most cited of 81 All 81 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 2; 2026: 1.

3 papers.