English
Related papers

Related papers: Full Attention Strikes Back: Transferring Full Att…

200 papers

Transformers are considered one of the most important deep learning models since 2018, in part because it establishes state-of-the-art (SOTA) records and could potentially replace existing Deep Neural Networks (DNNs). Despite the remarkable…

Machine Learning · Computer Science 2022-08-23 Hongwu Peng , Shaoyi Huang , Shiyang Chen , Bingbing Li , Tong Geng , Ang Li , Weiwen Jiang , Wujie Wen , Jinbo Bi , Hang Liu , Caiwen Ding

Effective attention modules have played a crucial role in the success of Transformer-based large language models (LLMs), but the quadratic time and memory complexities of these attention modules also pose a challenge when processing long…

Distributed, Parallel, and Cluster Computing · Computer Science 2024-06-07 Ao Sun , Weilin Zhao , Xu Han , Cheng Yang , Zhiyuan Liu , Chuan Shi , Maosong Sun

Long-context inference increasingly operates over CPU-resident KV caches, either because decoding-time KV states exceed GPU memory capacity or because disaggregated prefill-decode systems place KV data in host memory. Although block-sparse…

Machine Learning · Computer Science 2026-05-11 Feiyu Yao , Zhixiong Niu , Xiaqing Li , Yongqiang Xiong , Juan Fang , Qian Wang

Large Language Models (LLMs) have achieved unprecedented breakthroughs in various natural language processing domains. However, the enigmatic ``black-box'' nature of LLMs remains a significant challenge for interpretability, hampering…

Computation and Language · Computer Science 2023-12-27 Zhen Tan , Tianlong Chen , Zhenyu Zhang , Huan Liu

Long-context inference in large language models (LLMs) is bottlenecked by the linear growth of the self-attention key-value (KV) cache. Top-k sparse attention alleviates this by loading only a small fraction of the KV cache, but accurately…

Computation and Language · Computer Science 2026-05-28 Keqi Deng , Shaoshi Ling , Ruchao Fan , Jinyu Li

A major drawback of backpropagation through time (BPTT) is the difficulty of learning long-term dependencies, coming from having to propagate credit information backwards through every single step of the forward computation. This makes BPTT…

Artificial Intelligence · Computer Science 2017-11-08 Nan Rosemary Ke , Anirudh Goyal , Olexa Bilaniuk , Jonathan Binas , Laurent Charlin , Chris Pal , Yoshua Bengio

Large language models (LLMs) have achieved impressive performance in numerous domains but often struggle to process lengthy inputs effectively and efficiently due to limited length generalization and attention's quadratic computational…

Computation and Language · Computer Science 2024-03-26 Yi Lu , Xin Zhou , Wei He , Jun Zhao , Tao Ji , Tao Gui , Qi Zhang , Xuanjing Huang

Transformer-based large language models (LLMs) have achieved remarkable success, yet their standard attention mechanism incurs quadratic computation and memory costs with respect to sequence length, posing a major bottleneck for…

Machine Learning · Computer Science 2025-10-22 Tao Bu , Qiangang Wang , Bowen Zeng , Hanwen Sun , Yunpeng Huang , Chun Cao , Jingwei Xu

Long-context video understanding and generation pose a significant computational challenge for Transformer-based video models due to the quadratic complexity of self-attention. While existing sparse attention methods employ coarse-grained…

Computer Vision and Pattern Recognition · Computer Science 2026-04-01 Anmin Liu , Ruixuan Yang , Huiqiang Jiang , Bin Lin , Minmin Sun , Yong Li , Chen Zhang , Tao Xie

The Transformer architecture model, based on self-attention and multi-head attention, has achieved remarkable success in offline end-to-end Automatic Speech Recognition (ASR). However, self-attention and multi-head attention cannot be…

Computation and Language · Computer Science 2022-10-03 Chendong Zhao , Jianzong Wang , Wen qi Wei , Xiaoyang Qu , Haoqian Wang , Jing Xiao

In order to address the chain of thought in the large language model inference cost surge, this research proposes to use a sparse attention mechanism that only focuses on a few relevant tokens. The researcher constructed a new attention…

Machine Learning · Computer Science 2025-07-11 Libo Wang

In recent years, the success of large language models (LLMs) has driven the exploration of scaling laws in recommender systems. However, models that demonstrate scaling laws are actually challenging to deploy in industrial settings for…

Information Retrieval · Computer Science 2026-01-27 Weijiang Lai , Beihong Jin , Di Zhang , Siru Chen , Jiongyan Zhang , Yuhang Gou , Jian Dong , Xingxing Wang

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

Long-context modeling is a pivotal capability for Large Language Models, yet the quadratic complexity of attention remains a critical bottleneck, particularly during the compute-intensive prefilling phase. While various sparse attention…

Computation and Language · Computer Science 2026-03-09 Qihang Fan , Huaibo Huang , Zhiying Wu , Juqiu Wang , Bingning Wang , Ran He

Sparse computation offers a compelling solution for the inference of Large Language Models (LLMs) in low-resource scenarios by dynamically skipping the computation of inactive neurons. While traditional approaches focus on ReLU-based LLMs,…

Machine Learning · Computer Science 2024-02-07 Zhengyan Zhang , Yixin Song , Guanghui Yu , Xu Han , Yankai Lin , Chaojun Xiao , Chenyang Song , Zhiyuan Liu , Zeyu Mi , Maosong Sun

The Transformer model is widely successful on many natural language processing tasks. However, the quadratic complexity of self-attention limit its application on long text. In this paper, adopting a fine-to-coarse attention mechanism on…

Computation and Language · Computer Science 2019-11-12 Zihao Ye , Qipeng Guo , Quan Gan , Xipeng Qiu , Zheng Zhang

Serving long-context LLMs is costly because attention computation grows linearly with context length. Dynamic sparse attention algorithms (DSAs) mitigate this by attending only to the key-value (KV) cache of critical tokens. However, with…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-30 Qihui Zhou , Peiqi Yin , Pengfei Zuo , James Cheng

Scaling context length is reshaping large-model development, yet full-attention Transformers suffer from prohibitive computation and inference bottlenecks at long sequences. A key challenge is to design foundation models that maintain…

Large Language Models (LLMs) have achieved remarkable success with their billion-level parameters, yet they incur high inference overheads. The emergence of activation sparsity in LLMs provides a natural approach to reduce this cost by…

Computation and Language · Computer Science 2024-12-13 Haizhong Zheng , Xiaoyan Bai , Xueshen Liu , Z. Morley Mao , Beidi Chen , Fan Lai , Atul Prakash

Large language models are increasingly applied to multi-document and long-form inputs, yet long-context inference remains memory- and noise-inefficient. Key-value (KV) caching scales linearly with context length, while external retrieval…

Computation and Language · Computer Science 2026-01-29 Qingsen Ma , Dianyun Wang , Yaoye Wang , Lechen Ning , Sujie Zhu , Xiaohang Zhang , Jiaming Lyu , Linhao Ren , Zhenbo Xu , Zhaofeng He