English
Related papers

Related papers: LanguaShrink: Reducing Token Overhead with Psychol…

200 papers

This paper focuses on task-agnostic prompt compression for better generalizability and efficiency. Considering the redundancy in natural language, existing approaches compress prompts by removing tokens or lexical units according to their…

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

Standard Large Language Models (LLMs) struggle with handling dialogues with long contexts due to efficiency and consistency issues. According to our observation, dialogue contexts are highly structured, and the special token of…

Computation and Language · Computer Science 2024-11-05 Jia-Nan Li , Quan Tu , Cunli Mao , Zhengtao Yu , Ji-Rong Wen , Rui Yan

Large language models (LLMs) demonstrate exceptional capabilities in various scenarios. However, they suffer from much redundant information and are sensitive to the position of key information in long context scenarios. To address these…

Computation and Language · Computer Science 2025-02-11 Jiwei Tang , Jin Xu , Tingwei Lu , Zhicheng Zhang , Yiming Zhao , Lin Hai , Hai-Tao Zheng

Large language models (LLMs) are great at processing multiple natural language processing tasks, but their abilities are constrained by inferior performance with long context, slow inference speed, and the high cost of computing the…

Computation and Language · Computer Science 2024-04-03 Yu-Neng Chuang , Tianwei Xing , Chia-Yuan Chang , Zirui Liu , Xun Chen , Xia Hu

Large Language Models (LLMs) deliver powerful reasoning and generation capabilities but incur substantial run-time costs when operating in agentic workflows that chain together lengthy prompts and process rich data streams. We introduce…

Artificial Intelligence · Computer Science 2025-10-22 Joong Ho Choi , Jiayang Zhao , Jeel Shah , Ritvika Sonawane , Vedant Singh , Avani Appalla , Will Flanagan , Filipe Condessa

Despite their remarkable achievements, modern Large Language Models (LLMs) face exorbitant computational and memory footprints. Recently, several works have shown significant success in training-free and data-free compression (pruning and…

Computation and Language · Computer Science 2024-03-19 Ajay Jaiswal , Zhe Gan , Xianzhi Du , Bowen Zhang , Zhangyang Wang , Yinfei Yang

Prompt compression reduces inference cost and context length in large language models, but prior evaluations focus primarily on autoregressive architectures. This study investigates whether prompt compression transfers effectively to…

Computation and Language · Computer Science 2026-05-19 Sterling Huang , Abigayle Brown , Jiyoo Noh , Jiakang Xu , Wantong Huo , Kaung Myat Kyaw , Jonathan Chan

Large language models (LLMs) excel at complex reasoning, yet their efficiency is limited by the surging cognitive overhead of long thought traces. In this paper, we propose LightThinker, a method that enables LLMs to dynamically compress…

Computation and Language · Computer Science 2026-04-07 Yuqi Zhu , Jintian Zhang , Zhenjie Wan , Yujie Luo , Shuofei Qiao , Zhengke Gui , Da Zheng , Lei Liang , Huajun Chen , Ningyu Zhang

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

Evaluating the quality of machine-generated natural language content is a challenging task in Natural Language Processing (NLP). Recently, large language models (LLMs) like GPT-4 have been employed for this purpose, but they are…

Computation and Language · Computer Science 2024-12-23 Daniil Larionov , Steffen Eger

Large language models (LLMs) have achieved widespread adoption across numerous applications. However, many LLMs are vulnerable to malicious attacks even after safety alignment. These attacks typically bypass LLMs' safety guardrails by…

Cryptography and Security · Computer Science 2025-06-17 Yucheng Li , Surin Ahn , Huiqiang Jiang , Amir H. Abdi , Yuqing Yang , Lili Qiu

The rapid advancement of Large Language Models (LLMs) has inaugurated a transformative epoch in natural language processing, fostering unprecedented proficiency in text generation, comprehension, and contextual scrutiny. Nevertheless,…

Machine Learning · Computer Science 2024-04-22 Cangqing Wang , Yutian Yang , Ruisi Li , Dan Sun , Ruicong Cai , Yuzhu Zhang , Chengqian Fu , Lillian Floyd

The widespread use of Large Language Models (LLMs) in software engineering has intensified the need for improved model and resource efficiency. In particular, for neural code generation, LLMs are used to translate function/method signature…

Software Engineering · Computer Science 2025-06-12 Guang Yang , Yu Zhou , Wei Cheng , Xiangyu Zhang , Xiang Chen , Terry Yue Zhuo , Ke Liu , Xin Zhou , David Lo , Taolue Chen

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

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

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

While the numerous parameters in Large Language Models (LLMs) contribute to their superior performance, this massive scale makes them inefficient and memory-hungry. Thus, they are hard to deploy on commodity hardware, such as one single…

Computation and Language · Computer Science 2023-10-11 Zhaozhuo Xu , Zirui Liu , Beidi Chen , Yuxin Tang , Jue Wang , Kaixiong Zhou , Xia Hu , Anshumali Shrivastava

Recent advances in fine-tuning large language models (LLMs) have greatly enhanced their usage in domain-specific tasks. Despite the success, fine-tuning continues to rely on repeated and lengthy prompts, which escalate computational…

Computation and Language · Computer Science 2024-10-17 Jiaru Zou , Mengyu Zhou , Tao Li , Shi Han , Dongmei Zhang

Prompt engineering is an essential technique for enhancing the abilities of large language models (LLMs) by providing explicit and specific instructions. It enables LLMs to excel in various tasks, such as arithmetic reasoning, question…

Computation and Language · Computer Science 2024-03-29 Fobo Shi , Peijun Qing , Dong Yang , Nan Wang , Youbo Lei , Haonan Lu , Xiaodong Lin , Duantengchuan Li