Spectraformer: A Unified Random Feature Framework for Transformer
Not on the map. Why?
Abstract (arXiv)
Linearization of attention using various kernel approximation and kernel learning techniques has shown promise. Past methods used a subset of combinations of component functions and weight matrices within the random feature paradigm. We identify the need for a systematic comparison of different combinations of weight matrices and component functions for attention learning in Transformer. Hence, we introduce Spectraformer, a unified framework for approximating and learning the kernel function in the attention mechanism of the Transformer. Our empirical results demonstrate, for the first time, that a random feature-based approach can achieve performance comparable to top-performing sparse and low-rank methods on the challenging Long Range Arena benchmark. Thus, we establish a new state-of-the-art for random feature-based efficient Transformers. The framework also produces many variants that offer different advantages in accuracy, training time, and memory consumption. Our code is available at: https://github.com/cruiseresearchgroup/spectraformer .
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 51 of its 83 references that are in the map. First posted on arXiv 24 May 2024.
Builds on
51 of 83 references.
References · 51
- 2017Attention Is All You Needcited by 59,932
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2020Longformer: The Long-Document Transformercited by 3,362
- 2017Non-local Neural Networkscited by 2,290
- 2020Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecastingcited by 2,141
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Reformer: The Efficient Transformercited by 1,658
- 2020Rethinking Attention with Performerscited by 1,584
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2021Ethical and social risks of harm from Language Modelscited by 957
- 2020Efficient Transformers: A Surveycited by 784
38 more
- 2020Long Range Arena: A Benchmark for Efficient Transformerscited by 696
- 2020A Survey on Visual Transformercited by 653
- 2020Efficient Content-Based Sparse Attention with Routing Transformerscited by 469
- 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 468
- 2021A Survey of Transformerscited by 399
- 2019Transformer Dissection: A Unified Understanding of Transformer's Attention via the Lens of Kernelcited by 211
- 2013Gaussian Process Kernels for Pattern Discovery and Extrapolationcited by 131
- 2018ListOps: A Diagnostic Dataset for Latent Tree Learningcited by 128
- 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 107
- 2019Attention in Natural Language Processingcited by 100
- 2018Learning long-range spatial dependencies with horizontal gated-recurrent unitscited by 98
- 2019Star-Transformercited by 94
- 2016Orthogonal Random Featurescited by 89
- 2021Skyformer: Remodel Self-Attention with Gaussian Kernel and Nystr"om Methodcited by 61
- 2019Lightweight and Efficient End-to-End Speech Recognition Using Low-Rank Transformercited by 47
- 2017The Unreasonable Effectiveness of Structured Random Orthogonal Embeddingscited by 43
- 2014Quasi-Monte Carlo Feature Maps for Shift-Invariant Kernelscited by 41
- 2024AUFormer: Vision Transformers are Parameter-Efficient Facial Action Unit Detectorscited by 29
- 2019Disentangling neural mechanisms for perceptual groupingcited by 28
- 2018Quadrature-based features for kernel approximationcited by 25
- 2021Hybrid Random Featurescited by 25
- 2017Gaussian Quadrature for Kernel Featurescited by 21
- 2022Chefs' Random Tables: Non-Trigonometric Random Featurescited by 20
- 2018Learning Compressed Transforms with Low Displacement Rankcited by 19
- 2023Rethinking Vision Transformer and Masked Autoencoder in Multimodal Face Anti-Spoofingcited by 19
- 2014A la Carte - Learning Fast Kernelscited by 18
- 2021On Learning the Transformer Kernelcited by 14
- 2020Implicit Kernel Attentioncited by 13
- 2015Bayesian Nonparametric Kernel-Learningcited by 10
- 2023Simplex Random Featurescited by 9
- 2013A Divide-and-Conquer Solver for Kernel Support Vector Machinescited by 8
- 2016Recycling Randomness with Structure for Sublinear time Kernel Expansionscited by 8
- 2022Random Fourier Features for Asymmetric Kernelscited by 7
- 2022Random Gegenbauer Features for Scalable Kernel Methodscited by 6
- 2017Not-So-Random Featurescited by 5
- 2020Subgroup-based Rank-1 Lattice Quasi-Monte Carlocited by 3
- 2021A Temporal Kernel Approach for Deep Learning with Continuous-time Informationcited by 3
- 2015Compact Nonlinear Maps and Circulant Extensionscited by 2
50 most cited of 51 All 51 (JSON)
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025SchoenbAt: Rethinking Attention with Polynomial basiscited by 1
- 2025Alternatives To Next Token Prediction In Text Generation -- A Surveycited by 1
- 2026Manifold Random Featurescited by 1
- 2026Manifold Random Features3 Feb 2026
- 2025Alternatives To Next Token Prediction In Text Generation -- A Survey29 Sep 2025
- 2025SchoenbAt: Rethinking Attention with Polynomial basis18 May 2025