mlsanityData to 14 Oct 2026

Exact Causal Attention with 10% Fewer Operations

arXiv 2510.05175 ↗First posted 5 Oct 2025cs.LG cs.DM cs.DScited by 0

Not on the map. Why?

Abstract (arXiv)

We present Exact Causal Attention (ECA), a Strassen-style algorithm that computes exact Causal Attention using 10% fewer operations. ECA improves a special class of matrix multiplications where either one operand or the output matrix is upper- or lower-triangular. This includes all matrix multiplication operations in the forward and backward pass of Causal Attention, such as masked product Mask(QKT). ECA is built upon algebraic identities discovered via machine learning and combinatorial search. We note that ECA cannot accelerate fused kernels such as FlashAttention on GPU. This is because ECA requires materialization of large intermediate expressions in the memory, while FlashAttention does not. However, it provides an alternative approach for compute-bound applications and can potentially be useful in scenarios with FLOPs considerations.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 35 references that are in the map. First posted on arXiv 5 Oct 2025.

Builds on

26 of 35 references.

References · 26

  1. 2017Attention Is All You Needcited by 60,361
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  4. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  5. 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
  6. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  7. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  8. 2020Big Bird: Transformers for Longer Sequencescited by 1,684
  9. 2020Reformer: The Efficient Transformercited by 1,668
  10. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  11. 2020Efficient Transformers: A Surveycited by 790
  12. 2022Efficiently Scaling Transformer Inferencecited by 539
14 more
  1. 2024FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precisioncited by 519
  2. 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 471
  3. 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 471
  4. 2018Generating Wikipedia by Summarizing Long Sequencescited by 335
  5. 2020Query-Key Normalization for Transformerscited by 280
  6. 2024Flex Attention: A Programming Model for Generating Optimized Attention Kernelscited by 185
  7. 2020Data Movement Is All You Need: A Case Study on Optimizing Transformerscited by 108
  8. 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 106
  9. 2015Multi-task Sequence to Sequence Learningcited by 94
  10. 2025Tensor Product Attention Is All You Needcited by 31
  11. 2024Lean Attention: Hardware-Aware Scalable Attention Mechanism for the Decode-Phase of Transformerscited by 16
  12. 2025Hardware-Efficient Attention for Fast Decodingcited by 10
  13. 2024Fast and Practical Strassen's Matrix Multiplication using FPGAscited by 2
  14. 2025Changing Base Without Losing Pace: A GPU-Efficient Alternative to MatMul in DNNscited by 2

Built on by

Not cited yet.