English
Related papers

Related papers: The Compression Paradox in LLM Inference: Provider…

200 papers

Prompt compression is often evaluated by input-token reduction, but its real deployment impact depends on how compression changes output length and total inference cost. We present a controlled replication and extension study of…

Computation and Language · Computer Science 2026-03-26 Warren Johnson

With the wide adoption of language models for IR -- and specifically RAG systems -- the latency of the underlying LLM becomes a crucial bottleneck, since the long contexts of retrieved passages lead large prompts and therefore, compute…

Information Retrieval · Computer Science 2026-04-06 Cornelius Kummer , Lena Jurkschat , Michael Färber , Sahar Vahdati

Prompt engineering enables Large Language Models (LLMs) to perform a variety of tasks. However, lengthy prompts significantly increase computational complexity and economic costs. To address this issue, we study six prompt compression…

Computation and Language · Computer Science 2025-05-02 Zheng Zhang , Jinyi Li , Yihuai Lan , Xiang Wang , Hao Wang

Large language models (LLMs) have been applied in various applications due to their astonishing capabilities. With advancements in technologies such as chain-of-thought (CoT) prompting and in-context learning (ICL), the prompts fed to LLMs…

Computation and Language · Computer Science 2023-12-07 Huiqiang Jiang , Qianhui Wu , Chin-Yew Lin , Yuqing Yang , Lili Qiu

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

In long context scenarios, large language models (LLMs) face three main challenges: higher computational cost, performance reduction, and position bias. Research indicates that LLM performance hinges on the density and position of key…

Computation and Language · Computer Science 2024-08-13 Huiqiang Jiang , Qianhui Wu , Xufang Luo , Dongsheng Li , Chin-Yew Lin , Yuqing Yang , Lili Qiu

Large Language Models (LLMs) have become widely used across various domains spanning search engines, code generation, and text creation. However, a major concern associated with their adoption is the high cost of inference, impacting both…

Computation and Language · Computer Science 2026-04-28 Marta Adamska , Daria Smirnova , Hamid Nasiri , Zhengxin Yu , Peter Garraghan

The rapid expansion of Large Language Models (LLMs) has introduced unprecedented energy demands, extending beyond training to large-scale inference workloads that often dominate total lifecycle consumption. Deploying these models requires…

Artificial Intelligence · Computer Science 2025-11-11 Francisco Caravaca , Ángel Cuevas , Rubén Cuevas

The shift from cloud-hosted Large Language Models (LLMs) to locally deployed open-source Small Language Models (SLMs) has democratized AI-assisted coding; however, it has also decentralized the environmental footprint of AI. While prompting…

Software Engineering · Computer Science 2026-04-06 Md Afif Al Mamun , Sayan Nath , Gias Uddin , Novarun Deb

While reasoning large language models (LLMs) demonstrate remarkable performance across various tasks, they also contain notable security vulnerabilities. Recent research has uncovered a "thinking-stopped" vulnerability in DeepSeek-R1, where…

Cryptography and Security · Computer Science 2025-04-30 Yu Cui , Yujun Cai , Yiwei Wang

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 reasoning models (LRMs) typically solve reasoning-intensive tasks by generating long chain-of-thought (CoT) traces, leading to substantial inference overhead. We identify a reproducible inference-time phenomenon, termed…

Computation and Language · Computer Science 2026-02-03 Jie Deng , Shining Liang , Jun Li , Hongzhi Li , Yutao Xie

In "Compress or Route?" (Johnson, 2026), we found that code generation tolerates aggressive prompt compression (r >= 0.6) while chain-of-thought reasoning degrades gradually. That study was limited to HumanEval (164 problems), left the…

Computation and Language · Computer Science 2026-02-19 Warren Johnson

Compressing Large Language Models (LLMs) often leads to reduced performance, especially for knowledge-intensive tasks. In this work, we dive into how compression damages LLMs' inherent knowledge and the possible remedies. We start by…

Computation and Language · Computer Science 2024-02-19 Duc N. M Hoang , Minsik Cho , Thomas Merth , Mohammad Rastegari , Zhangyang Wang

Large language models (LLMs) face significant token efficiency bottlenecks in code generation and logical reasoning tasks, a challenge that directly impacts inference cost and model interpretability. This paper proposes a formal framework…

Artificial Intelligence · Computer Science 2025-02-03 Lumen AI , Tengzhou No. 1 Middle School , Shihao Ji , Zihui Song , Fucheng Zhong , Jisen Jia , Zhaobo Wu , Zheyi Cao , Tianhao Xu

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) are increasingly recognized for their exceptional generative capabilities and versatility across various tasks. However, the high inference costs associated with these models have not received adequate…

Computation and Language · Computer Science 2025-03-18 Soham Poddar , Paramita Koley , Janardan Misra , Sanjay Podder , Niloy Ganguly , Saptarshi Ghosh

In large-scale industrial LLM systems, prompt templates often expand to thousands of tokens as teams iteratively incorporate sections such as task instructions, few-shot examples, and heuristic rules to enhance robustness and coverage. This…

Computation and Language · Computer Science 2025-10-09 Zhentao Xu , Fengyi Li , Albert Chen , Xiaofeng Wang

Recent advancements in large language models (LLMs) have enabled their successful application to a broad range of tasks. However, in information-intensive tasks, the prompt length can grow fast, leading to increased computational…

Computation and Language · Computer Science 2025-10-13 Weronika Łajewska , Momchil Hardalov , Laura Aina , Neha Anna John , Hang Su , Lluís Màrquez

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
‹ Prev 1 2 3 10 Next ›