2026
Subquadratic Algorithms and Hardness for Attention with Any Temperature
ICLR 2026poster
Despite the popularity of the Transformer architecture, the standard algorithm for computing Attention suffers from quadratic time complexity in context length $n$. Alman and Song showed that when the head dimension $d = \Theta(\log n)$, subquadratic Attention is possible if and only if the inputs h…