ImageNet classification with deep convolutional neural networks
Alex Krizhevsky, Ilya Sutskever et al.
24
Citations
0
Influential Citations
Patterns
Venue
2025
Year
Transformer-based architectures have become the prevailing backbone of large language models. However, the quadratic time and memory complexity of self-attention remains a fundamental obstacle to efficient long-context modeling. To address this limitation, recent research has introduced two principal categories of efficient attention mechanisms. Linear attention methods achieve linear complexity through kernel approximations, recurrent formulations, or fastweight dynamics, thereby enabling scalable inference with reduced computational overhead. Sparse attention techniques, in contrast, limit attention computation to selected subsets of tokens based on fixed patterns, block-wise routing, or clustering strategies, enhancing efficiency while preserving contextual coverage. This survey provides a systematic and comprehensive overview of these developments, integrating both algorithmic innovations and hardware-level considerations. In addition, we analyze the incorporation of efficient attention into largescale pre-trained language models, including both architectures built entirely on efficient attention and hybrid designs that combine local and global components. By aligning theoretical foundations with practical deployment strategies, this work aims to serve as a foundational reference for advancing the design of scalable and efficient language models.
Transformer-based large language models have become ubiquitous, but their quadratic self-attention complexity severely limits long-context modeling. This survey addresses a critical bottleneck by systematically reviewing two principal categories of efficient attention: linear attention and sparse attention. Linear attention methods achieve linear complexity through kernel approximations, recurrent formulations, or fastweight dynamics, enabling scalable inference with reduced computational overhead. Sparse attention techniques limit computation to selected token subsets based on fixed patterns, block-wise routing, or clustering strategies, enhancing efficiency while preserving contextual coverage.
The paper's significance lies in its comprehensive integration of algorithmic innovations with hardware-level considerations, a perspective often missing in individual method papers. By analyzing how efficient attention is incorporated into large-scale pre-trained models—both pure efficient-attention architectures and hybrid designs combining local and global components—the survey provides a holistic view of the current landscape. This is particularly timely as the AI community pushes toward longer context windows and more efficient deployment.
The paper makes several key contributions:
As a survey, the paper does not present new experimental results. Instead, it synthesizes existing work, noting that linear attention methods achieve linear time and memory complexity in sequence length, while sparse attention methods maintain near-quadratic complexity but with significantly reduced constant factors. The survey highlights that hybrid designs often achieve the best trade-off between efficiency and model quality, though concrete metrics vary across implementations.
This survey serves as a foundational reference for advancing scalable and efficient language models. By aligning theoretical foundations with practical deployment strategies, it helps bridge the gap between research and production. The comprehensive overview is valuable for both newcomers seeking an introduction to efficient attention and experienced researchers looking for a structured comparison of methods. As long-context modeling becomes increasingly important for applications like document analysis, code generation, and multi-turn dialogue, this work provides essential guidance for choosing and designing efficient attention mechanisms.
Alex Krizhevsky, Ilya Sutskever et al.
Ashish Vaswani, Noam Shazeer et al.
Douglas M. Bates, Martin Mächler et al.
Diederik P. Kingma, Jimmy Ba