mlsanityData to 7 Oct 2026

Why Attend to Everything? Focus is the Key

arXiv 2604.03260 ↗First posted 12 Mar 2026cs.CL cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Standard attention scales quadratically with sequence length. Efficient attention methods reduce this O(n^2) cost, but when retrofitted into pretrained models, they often degrade perplexity, downstream accuracy, or both. We introduce Focus, a method that learns which token pairs matter. Focus adds a small set of learnable centroids--as few as 148K parameters per layer--that act as gates: only token pairs belonging to the same centroid group attend to each other over long ranges. Focus is composable: it can be added to any pretrained model by training only the centroids while keeping all original weights frozen. Experiments show that composing Focus onto pretrained models yields zero degradation on downstream benchmarks across model sizes from 124M to 70B parameters and five attention architectures. Surprisingly, sparse Focus attention outperforms full attention at 124M scale (30.3 vs. 31.4 perplexity) and matches full attention when trained from scratch at 7B scale (13.82 vs. 13.89). Focus is also fast: top-k group membership gives a 2x speedup with better quality than the original pretrained model. Using our FlashAttention decomposition, Focus achieves an 8.6x speedup at 1M tokens without custom kernels.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 42 references that are in the map. First posted on arXiv 12 Mar 2026.

Builds on

33 of 42 references.

References · 33

  1. 2017Attention Is All You Needcited by 59,932
  2. 2024The Llama 3 Herd of Modelscited by 14,192
  3. 2024Qwen2.5 Technical Reportcited by 4,713
  4. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,611
  5. 2020Longformer: The Long-Document Transformercited by 3,362
  6. 2023Mistral 7Bcited by 3,065
  7. 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
  8. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  9. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,551
  10. 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
  11. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
  12. 2024Mixtral of Expertscited by 1,785
21 more
  1. 2020Big Bird: Transformers for Longer Sequencescited by 1,673
  2. 2020Rethinking Attention with Performerscited by 1,584
  3. 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
  4. 2024Transformers are SSMs: Generalized Models and Efficient Algorithms Through Structured State Space Dualitycited by 1,283
  5. 2024DeepSeek-V2: A Strong, Economical, and Efficient Mixture-of-Experts Language Modelcited by 1,093
  6. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  7. 2024OLMo: Accelerating the Science of Language Modelscited by 599
  8. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 507
  9. 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 469
  10. 2023Ring Attention with Blockwise Transformers for Near-Infinite Contextcited by 448
  11. 2025Native Sparse Attention: Hardware-Aligned and Natively Trainable Sparse Attentioncited by 391
  12. 2024Jamba: A Hybrid Transformer-Mamba Language Modelcited by 390
  13. 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
  14. 2024LoRA Learns Less and Forgets Lesscited by 313
  15. 2023From Sparse to Soft Mixtures of Expertscited by 245
  16. 2025MoBA: Mixture of Block Attention for Long-Context LLMscited by 188
  17. 2024Scaling Laws for Fine-Grained Mixture of Expertscited by 166
  18. 2023SparQ Attention: Bandwidth-Efficient LLM Inferencecited by 119
  19. 2024The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicrycited by 119
  20. 2024MagicPIG: LSH Sampling for Efficient LLM Generationcited by 112
  21. 2024Loki: Low-rank Keys for Efficient Sparse Attentioncited by 87

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.