English
Related papers

Related papers: Native Hybrid Attention for Efficient Sequence Mod…

200 papers

Efficient modeling of long sequences of high-order data requires a more efficient architecture than Transformer. In this paper, we investigate two key aspects of extending linear recurrent models, especially those originally designed for…

Machine Learning · Computer Science 2025-08-19 Yibo Zhong

In this work, we conduct a systematic analysis of Native Sparse Attention (NSA) and propose targeted improvements that enhance long-context modeling. A key insight is that alternating between local (sliding-window) and global (compression,…

Computation and Language · Computer Science 2025-11-04 Yuxuan Hu , Jianchao Tan , Jiaqi Zhang , Wen Zan , Pingwei Sun , Yifan Lu , Yerui Sun , Yuchen Xie , Xunliang Cai , Jing Zhang

Transformers face quadratic complexity and memory issues with long sequences, prompting the adoption of linear attention mechanisms using fixed-size hidden states. However, linear models often suffer from limited recall performance, leading…

Computation and Language · Computer Science 2025-07-10 Dustin Wang , Rui-Jie Zhu , Steven Abreu , Yong Shan , Taylor Kergan , Yuqi Pan , Yuhong Chou , Zheng Li , Ge Zhang , Wenhao Huang , Jason Eshraghian

Transformers with linear attention allow for efficient parallel training but can simultaneously be formulated as an RNN with 2D (matrix-valued) hidden states, thus enjoying linear-time inference complexity. However, linear attention…

Machine Learning · Computer Science 2024-08-28 Songlin Yang , Bailin Wang , Yikang Shen , Rameswar Panda , Yoon Kim

The attention mechanism is an important reason for the success of transformers. It relies on computing pairwise relations between tokens. To reduce the high computational cost of standard quadratic attention, linear attention has been…

Artificial Intelligence · Computer Science 2026-02-13 Hanno Ackermann , Hong Cai , Mohsen Ghafoorian , Amirhossein Habibian

The quadratic computational complexity of softmax transformers has become a bottleneck in long-context scenarios. In contrast, linear attention model families provide a promising direction towards a more efficient sequential model. These…

Computation and Language · Computer Science 2026-02-04 Difan Deng , Andreas Bentzen Winje , Lukas Fehring , Marius Lindauer

Long-context modeling is crucial for next-generation language models, yet the high computational cost of standard attention mechanisms poses significant computational challenges. Sparse attention offers a promising direction for improving…

The quadratic computational complexity of MultiHead SelfAttention (MHSA) remains a fundamental bottleneck in scaling Large Language Models (LLMs) for longcontext tasks. While sparse and linearized attention mechanisms attempt to mitigate…

Computation and Language · Computer Science 2025-12-19 Caner Erden

Transformers' quadratic computational complexity limits their scalability despite remarkable performance. While linear attention reduces this to linear complexity, pre-training such models from scratch remains, in most cases, prohibitively…

Machine Learning · Computer Science 2025-10-13 Martin Benfeghoul , Teresa Delgado , Adnan Oomerjee , Haitham Bou Ammar , Jun Wang , Zafeirios Fountas

Recent works show that hybrid architectures combining local sliding window attention layers and global attention layers outperform either of these architectures taken separately. However, the impact of the window length and the interplay…

Transformer architectures have achieved remarkable success in various domains. While efficient alternatives to Softmax Attention have been widely studied, the search for more expressive mechanisms grounded in theoretical insight-even at…

Machine Learning · Computer Science 2025-10-03 Yifei Zuo , Yutong Yin , Zhichen Zeng , Ang Li , Banghua Zhu , Zhaoran Wang

The attention mechanism has been the core component in modern transformer architectures. However, the computation of standard full attention scales quadratically with the sequence length, serving as a major bottleneck in long-context…

Computation and Language · Computer Science 2026-04-28 Yusheng Zhao , Hourun Li , Bohan Wu , Yichun Yin , Lifeng Shang , Jingyang Yuan , Meng Zhang , Ming Zhang

While the Transformer architecture dominates many fields, its quadratic self-attention complexity hinders its use in large-scale applications. Linear attention offers an efficient alternative, but its direct application often degrades…

Computer Vision and Pattern Recognition · Computer Science 2026-01-15 Kewei Zhang , Ye Huang , Yufan Deng , Jincheng Yu , Junsong Chen , Huan Ling , Enze Xie , Daquan Zhou

Hybrid Transformer architectures, which combine softmax attention blocks and recurrent neural networks (RNNs), have shown a desirable performance-throughput tradeoff for long-context modeling, but their adoption and studies are hindered by…

Computation and Language · Computer Science 2026-01-30 Yingfa Chen , Zhen Leng Thai , Zihan Zhou , Zhu Zhang , Xingyu Shen , Shuo Wang , Chaojun Xiao , Xu Han , Zhiyuan Liu

Modern autoregressive models rely on attention, yet the Softmax full attention in Transformers scales quadratically with sequence length. Sliding Window Attention (SWA) achieves linear-time encoding/decoding by constraining the attention…

Machine Learning · Computer Science 2026-01-08 Jiaxu Liu , Yuhe Bai , Xiangyu Yin , Christos-Savvas Bouganis

Recent advances in video diffusion models have shifted towards transformer-based architectures, achieving state-of-the-art video generation but at the cost of quadratic attention complexity, which severely limits scalability for longer…

Computer Vision and Pattern Recognition · Computer Science 2026-01-09 Mohsen Ghafoorian , Amirhossein Habibian

Long-sequence modeling faces a fundamental trade-off between the efficiency of compressive fixed-size memory in RNN-like models and the fidelity of lossless growing memory in attention-based Transformers. Inspired by the Multi-Store Model…

Computation and Language · Computer Science 2025-12-18 Yunhao Fang , Weihao Yu , Shu Zhong , Qinghao Ye , Xuehan Xiong , Lai Wei

The evolution of large language models (LLMs) towards applications with ultra-long contexts faces challenges posed by the high computational and memory costs of the Transformer architecture. While existing sparse and linear attention…

The original softmax-based attention mechanism (regular attention) in the extremely successful Transformer architecture computes attention between $N$ tokens, each embedded in a $D$-dimensional head, with a time complexity of $O(N^2D)$.…

Machine Learning · Computer Science 2025-10-28 Armin Gerami , Ramani Duraiswami

Transformer-based LLMs have achieved exceptional performance across a wide range of NLP tasks. However, the standard self-attention mechanism suffers from quadratic time complexity and linearly increased cache size. Sliding window attention…

Computation and Language · Computer Science 2025-01-03 Yixing Xu , Shivank Nag , Dong Li , Lu Tian , Emad Barsoum
‹ Prev 1 2 3 10 Next ›