🤖 AI Summary
Existing random feature methods for linearizing Transformer attention lack systematic kernel function design and evaluation. Method: This paper proposes Spectraformer—the first comparable, scalable, unified framework that explicitly models kernel function structure in linearized attention. By jointly designing nonlinear component functions (e.g., ReLU, exp, sin) and structured or random weight matrices, it systematically uncovers the complementarity and task dependency of different kernels for long-range text modeling. Contribution/Results: Evaluated on all three text-based Long-Range Arena (LRA) benchmarks, Spectraformer demonstrates that kernel selection critically impacts accuracy—achieving significant improvements while preserving linear time and space complexity. The framework is fully open-sourced.
📝 Abstract
Linearization of attention using various kernel approximation and kernel learning techniques has shown promise. Past methods use a subset of combinations of component functions and weight matrices within the random features paradigm. We identify the need for a systematic comparison of different combinations of weight matrices and component functions for attention learning in Transformer. In this work, we introduce Spectraformer, a unified framework for approximating and learning the kernel function in linearized attention of the Transformer. We experiment with broad classes of component functions and weight matrices for three textual tasks in the LRA benchmark. Our empirical findings indicate that different kernels are good at different tasks and that kernel choice is fundamental to performant models. Our code is available at: https://github.com/dukenguyenxyz/spectraformer .