SchoenbAt: Rethinking Attention with Polynomial basis
Not on the map. Why?
Abstract (arXiv)
Kernelized attention extends the attention mechanism by modeling sequence correlations through kernel functions, making significant progresses in optimizing attention. Under the guarantee of harmonic analysis theory, kernel functions can be expanded with basis functions, inspiring random feature-based approaches to enhance the efficiency of kernelized attention while maintaining predictive performance. However, current random feature-based works are limited to the Fourier basis expansions under Bochner's theorem. We propose Schoenberg's theorem-based attention (SchoenbAt), which approximates dot-product kernelized attention with the polynomial basis under Schoenberg's theorem via random Maclaurin features and applies a two-stage regularization to constrain the input space and restore the output scale, acting as a drop-in replacement of dot-product kernelized attention. Our theoretical proof of the unbiasedness and concentration error bound of SchoenbAt supports its efficiency and accuracy as a kernelized attention approximation, which is also empirically validated under various random feature dimensions. Evaluations on real-world datasets demonstrate that SchoenbAt significantly enhances computational speed while preserving competitive performance in terms of precision, outperforming several efficient attention methods.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 32 of its 55 references that are in the map. First posted on arXiv 18 May 2025.
Builds on
32 of 55 references.
References · 32
- 2017Attention Is All You Needcited by 60,361
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 7,005
- 2024Qwen2.5 Technical Reportcited by 4,942
- 2014Neural Machine Translation by Jointly Learning to Align and Translatecited by 4,548
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,073
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,169
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 2,022
- 2020Big Bird: Transformers for Longer Sequencescited by 1,684
- 2020Reformer: The Efficient Transformercited by 1,668
- 2020Rethinking Attention with Performerscited by 1,601
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,474
20 more
- 2019Cross-lingual Language Model Pretrainingcited by 1,090
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 700
- 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 471
- 2021Random Feature Attentioncited by 354
- 2016Multi30K: Multilingual English-German Image Descriptionscited by 250
- 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 213
- 2022cosFormer: Rethinking Softmax in Attentioncited by 213
- 2023GSVA: Generalized Segmentation via Multimodal Large Language Modelscited by 154
- 2018ListOps: A Diagnostic Dataset for Latent Tree Learningcited by 129
- 2021Skyformer: Remodel Self-Attention with Gaussian Kernel and Nystr"om Methodcited by 63
- 2022Learning to Weight Samples for Dynamic Early-exiting Networkscited by 44
- 2022Contrastive Language-Image Pre-Training with Knowledge Graphscited by 34
- 2018Learning with SGD and Random Featurescited by 33
- 2023Dynamic Perceiver for Efficient Visual Recognitioncited by 33
- 2023Primal-Attention: Self-attention through Asymmetric Kernel SVD in Primal Representationcited by 29
- 2022Softmax-free Linear Transformerscited by 9
- 2022Large-Kernel Attention for 3D Medical Image Segmentationcited by 7
- 2022Local Random Feature Approximations of the Gaussian Kernelcited by 6
- 2024Spectraformer: A Unified Random Feature Framework for Transformercited by 5
- 2024Learning Expressive Random Feature Models via Parametrized Activationscited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.