SLAY: Geometry-Aware Spherical Linearized Attention with Yat-Kernel
Not on the map. Why?
Abstract (arXiv)
We propose a new class of linear-time attention mechanisms based on a relaxed and computationally efficient formulation of the recently introduced E-Product, often referred to as the Yat-kernel (Bouhsine, 2025). The resulting interactions are geometry-aware and inspired by inverse-square interactions in physics. Our method, Spherical Linearized Attention with Yat Kernels (SLAY), constrains queries and keys to the unit sphere so that attention depends only on angular alignment. Using Bernstein's theorem, we express the spherical Yat-kernel as a nonnegative mixture of polynomial-exponential product kernels and derive a strictly positive random-feature approximation enabling linear-time O(L) attention. We establish positive definiteness and boundedness on the sphere and show that the estimator yields well-defined, nonnegative attention scores. Empirically, SLAY achieves performance that is nearly indistinguishable from standard softmax attention while retaining linear time and memory scaling, and consistently outperforms prior linear-time attention mechanisms such as Performers and Cosformers. To the best of our knowledge, SLAY represents the closest linear-time approximation to softmax attention reported to date, enabling scalable Transformers without the typical performance trade-offs of attention linearization.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 15 of its 36 references that are in the map. First posted on arXiv 4 Feb 2026.
Builds on
15 of 36 references.
References · 15
- 2017Attention Is All You Needcited by 60,361
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
- 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 471
- 2021LongT5: Efficient Text-To-Text Transformer for Long Sequencescited by 232
- 2022cosFormer: Rethinking Softmax in Attentioncited by 213
- 2024Simple linear attention language models balance the recall-throughput tradeoffcited by 208
- 2024The Hedgehog & the Porcupine: Expressive Linear Attentions with Softmax Mimicrycited by 120
- 2023HyperAttention: Long-context Attention in Near-Linear Timecited by 85
- 2024Challenges in Deploying Long-Context Transformers: A Theoretical Peak Performance Analysiscited by 44
- 2022Chefs' Random Tables: Non-Trigonometric Random Featurescited by 21
Built on by
Citing papers per year: 2026: 1.
1 paper.