English
Related papers

Related papers: vAttention: Verified Sparse Attention

200 papers

While sparse attention mitigates the computational bottleneck of long-context LLM training, its distributed training process exhibits extreme heterogeneity in both \textit{1)} sequence length and \textit{2)} sparsity sensitivity, leading to…

Machine Learning · Computer Science 2026-04-27 Hongtao Xu , Jianchao Tan , Yuxuan Hu , Pengju Lu , Hongyu Wang , Pingwei Sun , Yerui Sun , Yuchen Xie , Xunliang Cai , Mingzhen Li , Weile Jia

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

Self-attention has recently been adopted for a wide range of sequence modeling problems. Despite its effectiveness, self-attention suffers from quadratic compute and memory requirements with respect to sequence length. Successful approaches…

Machine Learning · Computer Science 2020-10-27 Aurko Roy , Mohammad Saffar , Ashish Vaswani , David Grangier

The quadratic complexity of attention mechanisms poses a critical bottleneck for large language models processing long contexts. While dynamic sparse attention methods offer input-adaptive efficiency, they face fundamental trade-offs:…

Computation and Language · Computer Science 2026-02-06 Siran Liu , Guoxia Wang , Sa Wang , Jinle Zeng , HaoYang Xie , Siyu Lou , JiaBin Yang , DianHai Yu , Haifeng Wang , Chao Yang

Long-Context Transformer Models (LCTMs) are vital for real-world applications but suffer high computational costs due to attention's quadratic complexity. Block-sparse attention mitigates this by focusing computation on critical regions,…

Computation and Language · Computer Science 2025-03-21 Ruyi Xu , Guangxuan Xiao , Haofeng Huang , Junxian Guo , Song Han

Chunked prefill has become a widely adopted serving strategy for long-context large language models, but efficient attention computation in this regime remains challenging. Existing sparse attention methods are primarily designed for…

Computation and Language · Computer Science 2026-05-19 Jiwon Song , Dongwon Jo , Beomseok Kang , Jae-Joon Kim

Large language models spend most of their inference cost on attention over long contexts, yet empirical behavior suggests that only a small subset of tokens meaningfully contributes to each query. We formalize this phenomenon by modeling…

Artificial Intelligence · Computer Science 2026-02-17 Vashista Nobaub

Efficient long-sequence generation is a critical challenge for Large Language Models. While recent sparse decoding methods improve efficiency, they suffer from KV cache misalignment, where approximation errors accumulate and degrade…

Computation and Language · Computer Science 2025-06-06 Yutao Sun , Tianzhu Ye , Li Dong , Yuqing Xia , Jian Chen , Yizhao Gao , Shijie Cao , Jianyong Wang , Furu Wei

Transformer-based language models have found many diverse applications requiring them to process sequences of increasing length. For these applications, the causal self-attention -- which is the only component scaling quadratically w.r.t.…

Machine Learning · Computer Science 2023-06-05 Matteo Pagliardini , Daniele Paliotta , Martin Jaggi , François Fleuret

Many training-free sparse attention methods are effective for accelerating diffusion models. Recently, several works suggest that making sparse attention trainable can further increase sparsity while preserving generation quality. We study…

Computer Vision and Pattern Recognition · Computer Science 2026-02-17 Jintao Zhang , Kai Jiang , Chendong Xiang , Weiqi Feng , Yuezhou Hu , Haocheng Xi , Jianfei Chen , Jun Zhu

Large language model (LLM) inference demands significant amount of computation and memory, especially in the key attention mechanism. While techniques, such as quantization and acceleration algorithms, like FlashAttention, have improved…

Machine Learning · Computer Science 2024-12-18 Hao Kang , Srikant Bharadwaj , James Hensman , Tushar Krishna , Victor Ruhle , Saravan Rajmohan

Following the success of dot-product attention in Transformers, numerous approximations have been recently proposed to address its quadratic complexity with respect to the input length. While these variants are memory and compute efficient,…

Computation and Language · Computer Science 2021-06-15 Ankit Gupta , Guy Dar , Shaya Goodman , David Ciprut , Jonathan Berant

The attention mechanism of a transformer has a quadratic complexity, leading to high inference costs and latency for long sequences. However, attention matrices are mostly sparse, which implies that many entries may be omitted from…

Machine Learning · Computer Science 2025-11-25 Jeffrey Willette , Heejun Lee , Sung Ju Hwang

Sparse attention reduces the quadratic complexity of full self-attention but faces two challenges: (1) an attention gap, where applying sparse attention to full-attention-trained models causes performance degradation due to train-inference…

Computation and Language · Computer Science 2026-02-02 Zhenyi Shen , Junru Lu , Lin Gui , Jiazheng Li , Yulan He , Di Yin , Xing Sun

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…

Machine Learning · Computer Science 2021-10-29 Beidi Chen , Tri Dao , Eric Winsor , Zhao Song , Atri Rudra , Christopher Ré

Large vision-language models (VLMs) enable joint processing of text and images. However, incorporating vision data significantly increases the prompt length, resulting in a longer time to first token (TTFT). This bottleneck can be…

Computer Vision and Pattern Recognition · Computer Science 2026-02-02 Tharun Adithya Srikrishnan , Deval Shah , Timothy Hein , Ahmed Hasssan , Stephen Youn , Steven K. Reinhardt

As Large Language Models (LLMs) scale to longer context windows, the computational cost of attention mechanisms, which traditionally grows quadratically with input length, presents a critical challenge for real-time and memory-constrained…

Computation and Language · Computer Science 2024-12-10 James Vo

Large Language Models (LLMs) have emerged as a pivotal research area, yet the attention module remains a critical bottleneck in LLM inference, even with techniques like KVCache to mitigate redundant computations. While various top-$k$…

We present an approximate attention mechanism named HyperAttention to address the computational challenges posed by the growing complexity of long contexts used in Large Language Models (LLMs). Recent work suggests that in the worst-case…

Machine Learning · Computer Science 2023-12-04 Insu Han , Rajesh Jayaram , Amin Karbasi , Vahab Mirrokni , David P. Woodruff , Amir Zandieh

Diffusion Transformers, particularly for video generation, achieve remarkable quality but suffer from quadratic attention complexity, leading to prohibitive latency. Existing acceleration methods face a fundamental trade-off: dynamically…

Computer Vision and Pattern Recognition · Computer Science 2025-11-17 Dor Shmilovich , Tony Wu , Aviad Dahan , Yuval Domb