English
Related papers

Related papers: DAST: Context-Aware Compression in LLMs via Dynami…

200 papers

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

Long-context inputs in large language models (LLMs) often suffer from the "lost in the middle" problem, where critical information becomes diluted or ignored due to excessive length. Context compression methods aim to address this by…

Computation and Language · Computer Science 2026-02-04 Xuancheng Li , Haitao Li , Yujia Zhou , Qingyao Ai , Yiqun Liu

Large Language Models (LLMs) face significant computational challenges when processing long contexts due to the quadratic complexity of self-attention. While soft context compression methods, which map input text to smaller latent…

Computation and Language · Computer Science 2025-09-24 Gabriele Berton , Jayakrishnan Unnikrishnan , Son Tran , Mubarak Shah

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

Transformer-based language models (LMs) are inefficient in long contexts. We propose Dodo, a solution for context compression. Instead of one vector per token in a standard transformer model, Dodo represents text with a dynamic number of…

Computation and Language · Computer Science 2024-12-10 Guanghui Qin , Corby Rosset , Ethan C. Chau , Nikhil Rao , Benjamin Van Durme

Autoregressive Transformers adopted in Large Language Models (LLMs) are hard to scale to long sequences. Despite several works trying to reduce their computational cost, most of LLMs still adopt attention layers between all pairs of tokens…

Computation and Language · Computer Science 2024-06-03 Sotiris Anagnostidis , Dario Pavllo , Luca Biggio , Lorenzo Noci , Aurelien Lucchi , Thomas Hofmann

Large language models (LLMs) often struggle to accurately read and comprehend extremely long texts. Current methods for improvement typically rely on splitting long contexts into fixed-length chunks. However, fixed truncation risks…

Computation and Language · Computer Science 2025-06-04 Boheng Sheng , Jiacheng Yao , Meicong Zhang , Guoxiu He

Recent advancements in slow thinking reasoning models have shown exceptional performance in complex reasoning tasks. However, these models often exhibit overthinking (generating redundant reasoning steps for simple problems), leading to…

Machine Learning · Computer Science 2026-01-13 Yi Shen , Jian Zhang , Jieyun Huang , Shuming Shi , Wenjing Zhang , Jiangze Yan , Ning Wang , Kai Wang , Zhaoxiang Liu , Shiguo Lian

Large Language Models (LLMs) have demonstrated exceptional performance across diverse tasks. However, their deployment in long-context scenarios faces high computational overhead and information redundancy. While soft prompt compression has…

Computation and Language · Computer Science 2026-05-12 Jiwei Tang , Zhijing Huang , Xinyu Zhang , Chen Jason Zhang , Jianxing Yu , Libin Zheng , Rui Meng , Jian Yin

Through reading the documentation in the context, tool-using language models can dynamically extend their capability using external tools. The cost is that we have to input lengthy documentation every time the model needs to use the tool,…

Computation and Language · Computer Science 2024-07-03 Yang Xu , Yunlong Feng , Honglin Mu , Yutai Hou , Yitong Li , Xinghao Wang , Wanjun Zhong , Zhongyang Li , Dandan Tu , Qingfu Zhu , Min Zhang , Wanxiang Che

Long-context understanding is crucial for many NLP applications, yet transformers struggle with efficiency due to the quadratic complexity of self-attention. Sparse attention methods alleviate this cost but often impose static, predefined…

Computation and Language · Computer Science 2025-06-16 Hanzhi Zhang , Heng Fan , Kewei Sha , Yan Huang , Yunhe Feng

Context compression is an advanced technique that accelerates large language model (LLM) inference by converting long inputs into compact representations. Existing methods primarily rely on autoencoding tasks to train special compression…

Computation and Language · Computer Science 2026-03-12 Xin Liu , Runsong Zhao , Pengcheng Huang , Xinyu Liu , Junyi Xiao , Chunyang Xiao , Tong Xiao , Shengxiang Gao , Zhengtao Yu , Jingbo Zhu

The quadratic complexity of self-attention constrains Large Language Models (LLMs) in processing long contexts, a capability essential for many advanced applications. Context compression aims to alleviate this computational bottleneck while…

Computation and Language · Computer Science 2025-12-05 Yangning Li , Shaoshen Chen , Yinghui Li , Yankai Chen , Hai-Tao Zheng , Hui Wang , Wenhao Jiang , Philip S. Yu

Transformer-based Large Language Models (LLMs) often impose limitations on the length of the text input to ensure the generation of fluent and relevant responses. This constraint restricts their applicability in scenarios involving long…

Computation and Language · Computer Science 2023-12-18 Weizhi Fei , Xueyan Niu , Pingyi Zhou , Lu Hou , Bo Bai , Lei Deng , Wei Han

This chapter explores advancements in decoding strategies for large language models (LLMs), focusing on enhancing the Locally Typical Sampling (LTS) algorithm. Traditional decoding methods, such as top-k and nucleus sampling, often struggle…

Computation and Language · Computer Science 2025-06-12 Jaydip Sen , Saptarshi Sengupta , Subhasis Dasgupta

The KV cache used in large language models has linearly growing time complexity, so LLMs face memory blow-up and reduced decoding efficiency when they process long contexts. Current KV Cache eviction has become an important research…

Artificial Intelligence · Computer Science 2026-05-26 Wei Luo , Yi Huang , Songchen Ma , Huanyu Qu , Jiang Cai , Mingkun Xu

Task-agnostic prompt compression leverages the redundancy in natural language to reduce computational overhead and enhance information density within prompts, especially in long-context scenarios. Existing methods predominantly rely on…

Computation and Language · Computer Science 2025-07-17 Yi Zhao , Zuchao Li , Hai Zhao , Baoyuan Qi , Guoming Liu

Large Language Models (LLMs) often experience performance degradation during long-running interactions due to increasing context length, memory saturation, and computational overhead. This paper presents an adaptive context compression…

Computer Vision and Pattern Recognition · Computer Science 2026-04-01 Payal Fofadiya , Sunil Tiwari

Present Large Language Models (LLM) self-training methods always under-sample on challenging queries, leading to inadequate learning on difficult problems which limits LLMs' ability. Therefore, this work proposes a difficulty-aware…

Computation and Language · Computer Science 2025-03-13 Boyang Xue , Qi Zhu , Hongru Wang , Rui Wang , Sheng Wang , Hongling Xu , Fei Mi , Yasheng Wang , Lifeng Shang , Qun Liu , Kam-Fai Wong

Personalizing large language models (LLMs) to individual users requires incorporating extensive interaction histories and profiles, but input token constraints make this impractical due to high inference latency and API costs. Existing…

‹ Prev 1 2 3 10 Next ›