Scatterbrain: Unifying Sparse and Low-rank Attention Approximation

Abstract

Recent advances in efficient Transformers have exploited either the sparsity or low-rank properties of attention matrices to reduce the computational and memory bottlenecks of modeling long sequences. However, it is still challenging to balance the trade-off between model quality and efficiency to perform a one-size-fits-all approximation for different tasks. To better understand this trade-off, we observe that sparse and low-rank approximations excel in different regimes, determined by the softmax temperature in attention, and sparse + low-rank can outperform each individually. Inspired by the classical robust-PCA algorithm for sparse and low-rank decomposition, we propose Scatterbrain, a novel way to unify sparse (via locality sensitive hashing) and low-rank (via kernel feature map) attention for accurate and efficient approximation. The estimation is unbiased with provably low error. We empirically show that Scatterbrain can achieve 2.1x lower error than baselines when serving as a drop-in replacement in BigGAN image generation and pre-trained T2T-ViT. On a pre-trained T2T Vision transformer, even without fine-tuning, Scatterbrain can reduce 98% of attention memory at the cost of only 1% drop in accuracy. We demonstrate Scatterbrain for end-to-end training with up to 4 points better perplexity and 5 points better average accuracy than sparse or low-rank efficient transformers on language modeling and long-range-arena tasks.

NeurIPS 2021

References in corpus (13)

• Language Models are Few-Shot Learners
• Linformer: Self-Attention with Linear Complexity
• Generating Long Sequences with Sparse Transformers
• Pointer Sentinel Mixture Models
• Reformer: The Efficient Transformer
• Pay Less Attention with Lightweight and Dynamic Convolutions
• Transformers are RNNs: Fast Autoregressive Transformers with Linear Attention
• Long Range Arena: A Benchmark for Efficient Transformers
• Luna: Linear Unified Nested Attention
• Nyströmformer: A Nyström-Based Algorithm for Approximating Self-Attention
• Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Maps
• Sub-Linear Memory: How to Make Performers SLiM
• Climbing the WOL: Training for Cheaper Inference