English
Related papers

Related papers: Efficient Pretraining Length Scaling

200 papers

Autoregressive decoding strategy is a commonly used method for text generation tasks with pre-trained language models, while early-exiting is an effective approach to speedup the inference stage. In this work, we propose a novel decoding…

Computation and Language · Computer Science 2024-03-25 Yunqi Zhu , Xuebing Yang , Yuanyuan Wu , Wensheng Zhang

Scaling Transformers to ultra-long contexts is bottlenecked by the $O(n^2 d)$ cost of self-attention. Existing methods reduce this cost along the sequence axis through local windows, kernel approximations, or token-level sparsity, but these…

Machine Learning · Computer Science 2026-03-31 Yan Xie , Tiansheng Wen , Tangda Huang , Bo Chen , Chenyu You , Stefanie Jegelka , Yifei Wang

Many studies have been conducted to improve the efficiency of Transformer from quadric to linear. Among them, the low-rank-based methods aim to learn the projection matrices to compress the sequence length. However, the projection matrices…

Machine Learning · Computer Science 2022-11-30 Bosheng Qin , Juncheng Li , Siliang Tang , Yueting Zhuang

Key-Value (KV) cache remains a major bottleneck for deploying Large Language Models (LLMs) in long-generation tasks. Prior work often applies uniform compression across both prefill and decoding caches, but compressing the prefill cache…

Artificial Intelligence · Computer Science 2026-05-29 Soumyadeep Jana , Sagar Nishad , Sanasam Ranbir Singh

The inference process for large language models is slow and memory-intensive, with one of the most critical bottlenecks being excessive Key-Value (KV) cache accesses. This paper introduces "Double Sparsity," a novel post-training sparse…

Machine Learning · Computer Science 2024-08-20 Shuo Yang , Ying Sheng , Joseph E. Gonzalez , Ion Stoica , Lianmin Zheng

This paper presents "Predictive Pipelined Decoding (PPD)," an approach that speeds up greedy decoding in Large Language Models (LLMs) while maintaining the exact same output as the original decoding. Unlike conventional strategies, PPD…

Computation and Language · Computer Science 2024-07-30 Seongjun Yang , Gibbeum Lee , Jaewoong Cho , Dimitris Papailiopoulos , Kangwook Lee

Large-scale pre-training has been proven to be crucial for various computer vision tasks. However, with the increase of pre-training data amount, model architecture amount, and the private/inaccessible data, it is not very efficient or…

Computer Vision and Pattern Recognition · Computer Science 2022-03-29 Ruifei He , Shuyang Sun , Jihan Yang , Song Bai , Xiaojuan Qi

Generative Large Language Models (LLMs) based on the Transformer architecture have recently emerged as a dominant foundation model for a wide range of Natural Language Processing tasks. Nevertheless, their application in real-time scenarios…

Computation and Language · Computer Science 2024-01-04 Coleman Hooper , Sehoon Kim , Hiva Mohammadzadeh , Hasan Genc , Kurt Keutzer , Amir Gholami , Sophia Shao

Large language models (LLMs) can now handle longer sequences of tokens, enabling complex tasks like book understanding and generating lengthy novels. However, the key-value (KV) cache required for LLMs consumes substantial memory as context…

Machine Learning · Computer Science 2024-11-13 Haojie Duanmu , Zhihang Yuan , Xiuhong Li , Jiangfei Duan , Xingcheng Zhang , Dahua Lin

Autoregressive Transformer KV caches grow linearly with context length; sliding-window caching bounds memory but discards evicted tokens entirely, so relevant evidence outside the window becomes inaccessible. We introduce \emph{Tensor…

Machine Learning · Computer Science 2026-05-25 Kabir Swain , Sijie Han , Daniel Karl I. Weidele , Mauro Martino , Antonio Torralba

Continual pre-training has demonstrated significant potential in enhancing model performance, particularly in domain-specific scenarios. The most common approach for packing data before continual pre-training involves concatenating input…

Computation and Language · Computer Science 2025-05-30 Ruicheng Yin , Xuan Gao , Changze Lv , Xiaohua Wang , Xiaoqing Zheng , Xuanjing Huang

Accommodating long sequences efficiently in autoregressive Transformers, especially within an extended context window, poses significant challenges due to the quadratic computational complexity and substantial KV memory requirements…

Computation and Language · Computer Science 2024-06-25 Chao Lou , Zixia Jia , Zilong Zheng , Kewei Tu

Scaling sequence modeling to extreme contexts requires balancing computational efficiency with representational expressivity. While Transformers provide precise retrieval via the attention mechanism, their quadratic $\mathcal{O}(T^2)$…

Machine Learning · Computer Science 2026-01-06 Vladimer Khasia

Slim attention shrinks the context memory size by 2x for transformer models with MHA (multi-head attention), which can speed up inference by up to 2x for large context windows. Slim attention is an exact, mathematically identical…

Machine Learning · Computer Science 2025-06-04 Nils Graef , Andrew Wasielewski

The rapid expansion of context window sizes in Large Language Models~(LLMs) has enabled them to tackle increasingly complex tasks involving lengthy documents. However, this progress comes at the cost of a substantial increase in memory…

Computation and Language · Computer Science 2025-08-05 Da Ma , Lu Chen , Situo Zhang , Yuxun Miao , Su Zhu , Zhi Chen , Hongshen Xu , Hanqi Li , Shuai Fan , Lei Pan , Kai Yu

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

Multi-head latent attention (MLA) is designed to optimize KV cache memory through low-rank key-value joint compression. Rather than caching keys and values separately, MLA stores their compressed latent representations, reducing memory…

Computation and Language · Computer Science 2025-09-09 Guihong Li , Mehdi Rezagholizadeh , Mingyu Yang , Vikram Appia , Emad Barsoum

The Key-Value (KV) cache is crucial for efficient Large Language Models (LLMs) inference, but excessively long contexts drastically increase KV cache memory footprint. Existing KV cache compression methods typically rely on input-side…

Computation and Language · Computer Science 2026-03-13 Zhenxu Tian , Yi Su , Juntao Li , Min Zhang

Multi-head attention layers, as used in the Transformer neural sequence model, are a powerful alternative to RNNs for moving information across and between sequences. While training these layers is generally fast and simple, due to…

Neural and Evolutionary Computing · Computer Science 2019-11-07 Noam Shazeer

Large language models (LLMs) based on Transformer Decoders have become the preferred choice for conversational generative AI. Despite the overall superiority of the Decoder architecture, the gradually increasing Key-Value (KV) cache during…

Computation and Language · Computer Science 2025-07-16 Luohe Shi , Zuchao Li , Lefei Zhang , Guoming Liu , Baoyuan Qi , Hai Zhao