Low-Rank Attention
Overview
Low-rank attention studies how to represent the interactions between tokens with fewer dimensions, making long-context models and large attention layers cheaper to train and run. Common approaches factorize query-key or attention matrices with SVD and Tucker decompositions, route through compact latent states, or combine low-rank global mixing with sparse local attention. These methods are being tested in language-model decoding and KV-cache compression, as well as video generation, recommendation, and neural operators, where benchmarks often measure both task quality and latency or memory use. A central tension is that compact representations can preserve broad attention patterns and perplexity yet lose retrieval or task-specific detail, while the rank needed for reliable approximation can depend strongly on the data and setting.
Latest papers
24 papers1 paper in the last four weeks, down 75% on the four weeks before. 0.0% of all new papers.