English
Related papers

Related papers: CompLLM: Compression for Long Context Q&A

200 papers

Transformers suffer from a high computational cost that grows with sequence length for self-attention, making inference in long streams prohibited by memory consumption. Constant-memory alternatives such as RNNs and SSMs compress history…

Machine Learning · Computer Science 2026-04-24 Zhixin Zhang , Shabo Zhang , Chengcan Wu , Zeming Wei , Meng Sun

This technical report presents QwenLong-CPRS, a context compression framework designed for explicit long-context optimization, addressing prohibitive computation overhead during the prefill stage and the "lost in the middle" performance…

Large language models (LLMs) have demonstrated exceptional capabilities in generating text, images, and video content. However, as context length grows, the computational cost of attention increases quadratically with the number of tokens,…

Computation and Language · Computer Science 2025-04-23 Neusha Javidnia , Bita Darvish Rouhani , Farinaz Koushanfar

Large language models (LLMs) have received significant attention by achieving remarkable performance across various tasks. However, their fixed context length poses challenges when processing long documents or maintaining extended…

Computation and Language · Computer Science 2023-04-25 Yucheng Li

Making large language models (LLMs) more efficient in memory, latency, and serving cost is crucial for edge deployment, interactive applications, and sustainable inference at scale. Pruning is a promising technique, but existing pruning…

Computation and Language · Computer Science 2025-10-13 Eugene Kwek , Wenpeng Yin

Vision-Language Models (VLMs) have achieved remarkable success in various multi-modal tasks, but they are often bottlenecked by the limited context window and high computational cost of processing high-resolution image inputs and videos.…

Computer Vision and Pattern Recognition · Computer Science 2025-03-04 Xubing Ye , Yukang Gan , Xiaoke Huang , Yixiao Ge , Yansong Tang

This paper presents a context key/value compression method for Transformer language models in online scenarios, where the context continually expands. As the context lengthens, the attention process demands increasing memory and…

Machine Learning · Computer Science 2024-02-07 Jang-Hyun Kim , Junyoung Yeom , Sangdoo Yun , Hyun Oh Song

Large Language Models (LLMs) have pushed the frontier of artificial intelligence but are comprised of hundreds of billions of parameters and operations. For faster inference latency, LLMs are deployed on multiple hardware accelerators…

Machine Learning · Computer Science 2026-01-07 Jan Hansen-Palmus , Michael Truong Le , Oliver Hausdörfer , Alok Verma

While significant advancements have been made in compressed representations for text embeddings in large language models (LLMs), the compression of visual tokens in multi-modal LLMs (MLLMs) has remained a largely overlooked area. In this…

Computer Vision and Pattern Recognition · Computer Science 2024-11-19 Jieneng Chen , Luoxin Ye , Ju He , Zhao-Yang Wang , Daniel Khashabi , Alan Yuille

Large Language Models (LLMs), epitomized by ChatGPT's release in late 2022, have revolutionized various industries with their advanced language comprehension. However, their efficiency is challenged by the Transformer architecture's…

Computation and Language · Computer Science 2024-11-21 Luohe Shi , Hongyi Zhang , Yao Yao , Zuchao Li , Hai Zhao

The rapid growth of high-resolution scientific simulations and observation systems is generating massive spatiotemporal datasets, making efficient, error-bounded compression increasingly important. Meanwhile, decoder-only large language…

Machine Learning · Computer Science 2025-11-06 Guozhong Li , Muhannad Alhumaidi , Spiros Skiadopoulos , Panos Kalnis

In this paper, we explore the idea of training large language models (LLMs) over highly compressed text. While standard subword tokenizers compress text by a small factor, neural text compressors can achieve much higher rates of…

Computation and Language · Computer Science 2024-12-16 Brian Lester , Jaehoon Lee , Alex Alemi , Jeffrey Pennington , Adam Roberts , Jascha Sohl-Dickstein , Noah Constant

Large language models (LLMs) have shown promising efficacy across various tasks, becoming powerful tools in numerous aspects of human life. However, Transformer-based LLMs suffer a performance degradation when modeling long-term contexts…

Computation and Language · Computer Science 2026-03-23 Weiyao Luo , Suncong Zheng , Heming Xia , Weikang Wang , Yan Lei , Tianyu Liu , Shuang Chen , Zhifang Sui

Large Language Models (LLMs) demonstrate proficiency across diverse tasks but often require targeted adaptations for specific applications. Various methods have been proposed to facilitate this adaptation, including fewshot fine-tuning,…

Machine Learning · Computer Science 2025-11-10 Rajesh Upadhayaya , Manish Raj Osti , Zachary Smith , Chritopher Kottmyer

Fine-tuning large language models (LLMs) with low-rank adaptations (LoRAs) has become common practice, often yielding numerous copies of the same LLM differing only in their LoRA updates. This paradigm presents challenges for systems that…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-02 Rickard Brüel-Gabrielsson , Jiacheng Zhu , Onkar Bhardwaj , Leshem Choshen , Kristjan Greenewald , Mikhail Yurochkin , Justin Solomon

Large Language Models (LLMs) demonstrate exceptional reasoning abilities, enabling strong generalization across diverse tasks such as commonsense reasoning and instruction following. However, as LLMs scale, inference costs become…

Computation and Language · Computer Science 2025-02-06 Rhea Sanjay Sukthanker , Benedikt Staffler , Frank Hutter , Aaron Klein

In-context learning (ICL) is critical for large language models (LLMs), but its effectiveness is constrained by finite context windows, particularly in ultra-long contexts. To overcome this, we introduce InfiniteICL, a framework that…

Computation and Language · Computer Science 2025-04-04 Bowen Cao , Deng Cai , Wai Lam

We formalize the problem of prompt compression for large language models (LLMs) and present a framework to unify token-level prompt compression methods which create hard prompts for black-box models. We derive the distortion-rate function…

Machine Learning · Computer Science 2024-12-12 Alliot Nagle , Adway Girish , Marco Bondaschi , Michael Gastpar , Ashok Vardhan Makkuva , Hyeji Kim

Large language models (LLMs) exhibit outstanding performance in machine translation via in-context learning. In contrast to sentence-level translation, document-level translation (DOCMT) by LLMs based on in-context learning faces two major…

Computation and Language · Computer Science 2024-06-12 Menglong Cui , Jiangcun Du , Shaolin Zhu , Deyi Xiong

Key-Value cache (\texttt{KV} \texttt{cache}) compression has emerged as a promising technique to optimize Large Language Model (LLM) serving. It primarily decreases the memory consumption of \texttt{KV} \texttt{cache} to reduce the…

Machine Learning · Computer Science 2025-04-01 Wei Gao , Xinyu Zhou , Peng Sun , Tianwei Zhang , Yonggang Wen