English
Related papers

Related papers: Faster Causal Attention Over Large Sequences Throu…

200 papers

The computing cost of transformer self-attention often necessitates breaking long documents to fit in pretrained models in document ranking tasks. In this paper, we design Query-Directed Sparse attention that induces IR-axiomatic structures…

Artificial Intelligence · Computer Science 2020-10-27 Jyun-Yu Jiang , Chenyan Xiong , Chia-Jung Lee , Wei Wang

As the foundation of large language models (LLMs), self-attention module faces the challenge of quadratic time and memory complexity with respect to sequence length. FlashAttention accelerates attention computation and reduces its memory…

Machine Learning · Computer Science 2024-09-27 Shimao Chen , Zirui Liu , Zhiying Wu , Ce Zheng , Peizhuang Cong , Zihan Jiang , Yuhan Wu , Lei Su , Tong Yang

Efficient long-context understanding and reasoning are increasingly vital for large language model (LLM) applications such as multi-turn dialogue and program analysis. However, the core self-attention mechanism scales quadratically with…

Computation and Language · Computer Science 2025-12-17 Siran Liu , Zane Cao , Yongchao He

The efficiency of attention is critical because its time complexity grows quadratically with sequence length. SageAttention2 addresses this by utilizing quantization to accelerate matrix multiplications (Matmul) in attention. To further…

Machine Learning · Computer Science 2025-06-09 Jintao Zhang , Xiaoming Xu , Jia Wei , Haofeng Huang , Pengle Zhang , Chendong Xiang , Jun Zhu , Jianfei Chen

Attention serves as the fundamental mechanism for long-context modeling in large language models (LLMs), yet dense attention becomes structurally prohibitive for long sequences due to its quadratic complexity. Consequently, sparse attention…

Computation and Language · Computer Science 2026-01-07 Junxiang Qiu , Shuo Wang , Zhengsu Chen , Hengheng Zhang , Jinda Lu , Changcheng Li , Qi Tian

The design of Large Language Models (LLMs) has long been hampered by a fundamental conflict within their core attention mechanism: its remarkable expressivity is built upon a computational complexity of O(H N^2) that grows quadratically…

Machine Learning · Computer Science 2025-12-01 Mingkuan Zhao , Wentao Hu , Jiayin Wang , Xin Lai , Tianchen Huang , Yuheng Min , Rui Yan , Xiaoyan Zhu

The quadratic time and memory complexity inherent to self-attention mechanisms, with respect to sequence length, presents a critical computational bottleneck in the training and deployment of large-scale Transformer-based language models.…

Machine Learning · Computer Science 2024-03-19 Praneeth Kacham , Vahab Mirrokni , Peilin Zhong

Despite the success of Transformers, handling long contexts remains challenging due to the limited length generalization and quadratic complexity of self-attention. Thus Transformers often require post-training with a larger attention…

Computation and Language · Computer Science 2025-06-13 Xiang Hu , Zhihao Teng , Jun Zhao , Wei Wu , Kewei Tu

Transformer architectures have led to remarkable progress in many state-of-art applications. However, despite their successes, modern transformers rely on the self-attention mechanism, whose time- and space-complexity is quadratic in the…

Machine Learning · Computer Science 2022-09-13 Feyza Duman Keles , Pruthuvi Mahesakya Wijewardena , Chinmay Hegde

Since their introduction the Trasformer architectures emerged as the dominating architectures for both natural language processing and, more recently, computer vision applications. An intrinsic limitation of this family of "fully-attentive"…

Machine Learning · Computer Science 2023-03-16 Carmelo Scribano , Giorgia Franchini , Marco Prato , Marko Bertogna

Recently, it has been argued that encoder-decoder models can be made more interpretable by replacing the softmax function in the attention with its sparse variants. In this work, we introduce a novel, simple method for achieving sparsity in…

Computation and Language · Computer Science 2021-10-07 Biao Zhang , Ivan Titov , Rico Sennrich

One limitation of existing Transformer-based models is that they cannot handle very long sequences as input since their self-attention operations exhibit quadratic time and space complexity. This problem becomes especially acute when…

Machine Learning · Computer Science 2024-05-07 Yuzhen Mao , Martin Ester , Ke Li

Transformer models are computationally costly on long sequences since regular attention has quadratic $O(n^2)$ time complexity. We introduce Wavelet-Enhanced Random Spectral Attention (WERSA), a novel mechanism of linear $O(n)$ time…

Machine Learning · Computer Science 2025-07-14 Vincenzo Dentamaro

Visual AutoRegressive (VAR) modeling has garnered significant attention for its innovative next-scale prediction paradigm. However, mainstream VAR paradigms attend to all tokens across historical scales at each autoregressive step. As the…

Computer Vision and Pattern Recognition · Computer Science 2026-03-31 Zekun Li , Ning Wang , Tongxin Bai , Changwang Mei , Peisong Wang , Shuang Qiu , Jian Cheng

Scaling sequence length has become a critical demand in the era of large language models. However, existing methods struggle with either computational complexity or model expressivity, rendering the maximum sequence length restricted. To…

Computation and Language · Computer Science 2023-07-20 Jiayu Ding , Shuming Ma , Li Dong , Xingxing Zhang , Shaohan Huang , Wenhui Wang , Nanning Zheng , Furu Wei

Long-context inference in large language models is bottlenecked by the quadratic cost of full attention. Existing efficient alternatives often rely either on native sparse training or on heuristic token eviction, creating an undesirable…

Computation and Language · Computer Science 2026-05-19 Yanke Zhou , Yiduo Li , Hanlin Tang , Maohua Li , Kan Liu , Lan Tao , Lin Qu , Yuan Yao , Xiaoxing Ma

The Segment Anything Model (SAM) achieves strong open-vocabulary segmentation, but its ViT-based image encoders dominate inference latency and memory. Existing activation compression methods, such as token merging, reduce the token length…

Computer Vision and Pattern Recognition · Computer Science 2026-05-19 Hoai-Chau Tran , Chi H. Nguyen , Duy M. H. Nguyen , Mathias Niepert , Fan Lai , Khoa D. Doan

As the demand for processing extended textual data grows, the ability to handle long-range dependencies and maintain computational efficiency is more critical than ever. One of the key issues for long-sequence modeling using attention-based…

Computation and Language · Computer Science 2025-05-26 Aosong Feng , Rex Ying , Leandros Tassiulas

Sparse attention has been proposed as a way to alleviate the quadratic cost of transformers, a central bottleneck in long-context training. A promising line of work is $\alpha$-entmax attention, a differentiable sparse alternative to…

Machine Learning · Computer Science 2026-04-17 Nuno Gonçalves , Hugo Pitorro , Vlad Niculae , Edoardo Ponti , Lei Li , Andre Martins , Marcos Treviso

Transformers-based models, such as BERT, have been one of the most successful deep learning models for NLP. Unfortunately, one of their core limitations is the quadratic dependency (mainly in terms of memory) on the sequence length due to…