English
Related papers

Related papers: Detecting Overflow in Compressed Token Representat…

200 papers

This work investigates context compression for Large Language Models (LLMs) using learned compression tokens to reduce the memory and computational demands of processing long sequences. We demonstrate that pre-trained LLMs can be fine-tuned…

Computation and Language · Computer Science 2025-11-12 Dmitrii Tarasov , Elizaveta Goncharova , Kuznetsov Andrey

Long-context LLM agents often struggle with growing token, memory, and latency costs, making efficient context compression essential for practical deployment. Existing LLM-as-a-compressor methods remain noticeably inferior to using the full…

Computation and Language · Computer Science 2026-05-22 Jiangnan Ye , Hanqi Yan , Zhenyi Shen , Heng Chang , Ye Mao , Yulan He

Large Language Models (LLMs) have shown remarkable performance in Open-Domain Question Answering (ODQA) by leveraging external documents through Retrieval-Augmented Generation (RAG). To reduce RAG overhead, from longer context, context…

Computation and Language · Computer Science 2025-06-09 Yeonseok Jeong , Jinsu Kim , Dohyeon Lee , Seung-won Hwang

Repository-level code intelligence tasks require large language models (LLMs) to process long, multi-file contexts. Such inputs introduce three challenges: crucial context can be obscured by noise, truncated due to limited windows, and…

Software Engineering · Computer Science 2026-04-16 Jia Feng , Zhanyue Qin , Cuiyun Gao , Ruiqi Wang , Chaozheng Wang , Yingwei Ma , Xiaoyuan Xie

The exponential growth of Large Multimodal Models (LMMs) has driven advancements in cross-modal reasoning but at significant computational costs. In this work, we focus on visual language models. We highlight the redundancy and inefficiency…

Computer Vision and Pattern Recognition · Computer Science 2025-04-28 Yasmine Omri , Parth Shroff , Thierry Tambe

Large language models (LLMs) have triggered a new stream of research focusing on compressing the context length to reduce the computational cost while ensuring the retention of helpful information for LLMs to answer the given question.…

Computation and Language · Computer Science 2024-12-20 Barys Liskavets , Maxim Ushakov , Shuvendu Roy , Mark Klibanov , Ali Etemad , Shane Luke

Standard language models employ unique, monolithic embeddings for each token, potentially limiting their ability to capture the multifaceted nature of word meanings. We investigate whether tokens can be more effectively represented through…

Computation and Language · Computer Science 2025-09-24 Kavin R , Pawan Goyal

While RAG demonstrates remarkable capabilities in LLM applications, its effectiveness is hindered by the ever-increasing length of retrieved contexts, which introduces information redundancy and substantial computational overhead. Existing…

Computation and Language · Computer Science 2025-10-28 Yixiong Fang , Tianran Sun , Yuling Shi , Xiaodong Gu

Retrieval-Augmented Generation (RAG) helps LLMs stay accurate, but feeding long documents into a prompt makes the model slow and expensive. This has motivated context compression, ranging from token pruning and summarization to…

Computation and Language · Computer Science 2026-01-09 Jianbo Li , Yi Jiang , Sendong Zhao , Bairui Hu , Haochun Wang , Bing Qin

Recent efforts to accelerate inference in Multimodal Large Language Models (MLLMs) have largely focused on visual token compression. The effectiveness of these methods is commonly evaluated by measuring the accuracy drop on existing MLLM…

Computer Vision and Pattern Recognition · Computer Science 2026-04-21 Chenfei Liao , Wensong Wang , Zichen Wen , Xu Zheng , Yiyu Wang , Haocong He , Yuanhuiyi Lyu , Lutao Jiang , Xin Zou , Yuqian Fu , Bin Ren , Linfeng Zhang , Xuming Hu

Soft context compression reduces the computational workload of processing long contexts in LLMs by encoding long context into a smaller number of latent tokens. However, existing frameworks apply uniform compression ratios, failing to…

Computation and Language · Computer Science 2026-03-30 Yijiong Yu , Shuai Yuan , Jie Zheng , Huazheng Wang , Ji Pei

Transformer-based document cross-encoder rerankers are a central component of modern information retrieval systems. Despite their success, these models suffer from high computational costs due to processing long query-document sequences at…

Information Retrieval · Computer Science 2026-05-22 Shengyao Zhuang , Zhichao Xu , Ivano Lauriola

Multimodal large language models (MLLMs) have demonstrated great performance on visual question answering (VQA). When it comes to knowledge-based Visual Question Answering (KB-VQA), MLLMs may lack the specialized domain knowledge needed to…

Computer Vision and Pattern Recognition · Computer Science 2025-02-04 Weixi Weng , Jieming Zhu , Xiaojun Meng , Hao Zhang , Rui Zhang , Chun Yuan

Large Vision-Language Models (LVLMs) excel in visual understanding and reasoning, but the excessive visual tokens lead to high inference costs. Although recent token reduction methods mitigate this issue, they mainly target single-turn…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Yi Wang , Haofei Zhang , Qihan Huang , Anda Cao , Gongfan Fang , Wei Wang , Xuan Jin , Jie Song , Mingli Song , Xinchao Wang

Retrieved documents containing noise will hinder RAG from detecting answer clues and make the inference process slow and expensive. Therefore, context compression is necessary to enhance its accuracy and efficiency. Existing context…

Computation and Language · Computer Science 2026-04-28 Qianchi Zhang , Hainan Zhang , Liang Pang , Hongwei Zheng , Zhiming Zheng

Large language models (LLMs) process entire input contexts indiscriminately, which is inefficient when the information required to answer a query is localized within the context. We present dynamic context cutoff, a novel method enabling…

Computation and Language · Computer Science 2026-02-10 Roy Xie , Junlin Wang , Paul Rosu , Chunyuan Deng , Bolun Sun , Zihao Lin , Bhuwan Dhingra

As reasoning LLMs increasingly trade tokens for accuracy through deliberation, search, and self-correction, a single accuracy score can no longer tell whether those tokens buy useful reasoning, recovery from hard instances, or unnecessary…

Computation and Language · Computer Science 2026-05-19 Daniel Kaiser , Arnoldo Frigessi , Ali Ramezani-Kebrya , Benjamin Ricaud

Large language model (LLM) tokenizers act as structured compressors: by mapping text to discrete token sequences, they determine token count (and thus compute and context usage) and the statistical structure seen by downstream models.…

Information Theory · Computer Science 2026-01-15 Mete Erdogan , Abhiram Gorle , Shubham Chandak , Mert Pilanci , Tsachy Weissman

Large Language Models (LLMs) excel in language tasks but are prone to hallucinations and outdated knowledge. Retrieval-Augmented Generation (RAG) mitigates these by grounding LLMs in external knowledge. However, in complex domains involving…

Computation and Language · Computer Science 2025-08-28 Peiran Zhou , Junnan Zhu , Yichen Shen , Ruoxi Yu

As large language models increasingly gain popularity in real-world applications, processing extremely long contexts, often exceeding the model's pre-trained context limits, has emerged as a critical challenge. While existing approaches to…