English
Related papers

Related papers: LanguaShrink: Reducing Token Overhead with Psychol…

200 papers

Large Language Models (LLMs) have demonstrated impressive quality when applied to predictive tasks such as relevance ranking and semantic search. However, deployment of such LLMs remains prohibitively expensive for industry applications…

Large Language Models (LLMs) have achieved state-of-the-art performance in text re-ranking. This process includes queries and candidate passages in the prompts, utilizing pointwise, listwise, and pairwise prompting strategies. A limitation…

Computation and Language · Computer Science 2024-05-29 Muhammad Shihab Rashid , Jannat Ara Meem , Yue Dong , Vagelis Hristidis

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

Communication has emerged as a critical bottleneck in the distributed training of large language models (LLMs). While numerous approaches have been proposed to reduce communication overhead, the potential of lossless compression has…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-05-01 Wenxiang Lin , Xinglin Pan , Ruibo Fan , Shaohuai Shi , Xiaowen Chu

Large Language Models (LLMs) exhibit remarkable proficiency in addressing a diverse array of tasks within the Natural Language Processing (NLP) domain, with various prompt design strategies significantly augmenting their capabilities.…

Computation and Language · Computer Science 2024-08-05 Xiangyu Zhao , Chengqian Ma

There is a belief that learning to compress well will lead to intelligence. Recently, language modeling has been shown to be equivalent to compression, which offers a compelling rationale for the success of large language models (LLMs): the…

Computation and Language · Computer Science 2024-08-20 Yuzhen Huang , Jinghan Zhang , Zifei Shan , Junxian He

Large language models (LLMs) have shown remarkable capabilities in Natural Language Processing (NLP), especially in domains where labeled data is scarce or expensive, such as clinical domain. However, to unlock the clinical knowledge hidden…

Computation and Language · Computer Science 2023-09-18 Sonish Sivarajkumar , Mark Kelley , Alyssa Samolyk-Mazzanti , Shyam Visweswaran , Yanshan Wang

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 are growing in size, and we expect them to continue to do so, as larger models train quicker. However, this increase in size will severely impact inference costs. Therefore model compression is important, to retain the…

Machine Learning · Computer Science 2024-04-10 Georgy Tyukin

To extend the context length of Transformer-based large language models (LLMs) and improve comprehension capabilities, we often face limitations due to computational resources and bounded memory storage capacity. This work introduces a…

Computation and Language · Computer Science 2024-06-11 Chensen Huang , Guibo Zhu , Xuepeng Wang , Yifei Luo , Guojing Ge , Haoran Chen , Dong Yi , Jinqiao Wang

Deploying Large Language Models (LLMs) in streaming applications such as multi-round dialogue, where long interactions are expected, is urgently needed but poses two major challenges. Firstly, during the decoding stage, caching previous…

Computation and Language · Computer Science 2024-04-09 Guangxuan Xiao , Yuandong Tian , Beidi Chen , Song Han , Mike Lewis

Large Language Models (LLMs) have achieved remarkable performance across a wide range of Natural Language Processing (NLP) tasks. However, in long-context scenarios, they face two challenges: high computational cost and information…

Computation and Language · Computer Science 2026-02-10 Jiwei Tang , Zhicheng Zhang , Shunlong Wu , Jingheng Ye , Lichen Bai , Zitai Wang , Tingwei Lu , Lin Hai , Yiming Zhao , Hai-Tao Zheng , Hong-Gee Kim

Utilizing large language models (LLMs) for zero-shot document ranking is done in one of two ways: (1) prompt-based re-ranking methods, which require no further training but are only feasible for re-ranking a handful of candidate documents…

Information Retrieval · Computer Science 2024-10-22 Shengyao Zhuang , Xueguang Ma , Bevan Koopman , Jimmy Lin , Guido Zuccon

Recently, advanced large language models (LLMs) have emerged at an increasingly rapid pace. However, when faced with complex problems, most users are often unable to provide accurate and effective prompts to interact with LLMs, thus…

Computation and Language · Computer Science 2026-04-17 Wenjin Liu , Haoran Luo , Xueyuan Lin , Haoming Liu , Tiesunlong Shen , Jiapu Wang , Rui Mao , Erik Cambria

The rise of large language models (LLMs) has highlighted the importance of prompt engineering as a crucial technique for optimizing model outputs. While experimentation with various prompting methods, such as Few-shot, Chain-of-Thought, and…

Artificial Intelligence · Computer Science 2026-03-27 Michael Hewing , Vincent Leinhos

Prompt optimization improves the reasoning abilities of large language models (LLMs) without requiring parameter updates to the target model. Following heuristic-based "Think step by step" approaches, the field has evolved in two main…

Computation and Language · Computer Science 2025-07-25 Andreea Nica , Ivan Zakazov , Nicolas Mario Baldwin , Saibo Geng , Robert West

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

The rise of Large Language Models (LLMs) has had a profoundly transformative effect on a number of fields and domains. However, their uptake in Law has proven more challenging due to the important issues of reliability and transparency. In…

Artificial Intelligence · Computer Science 2025-09-03 Strahinja Klem , Noura Al Moubayed

Large reasoning models (LRMs) like OpenAI o1 and DeepSeek-R1 achieve high accuracy on complex tasks by adopting long chain-of-thought (CoT) reasoning paths. However, the inherent verbosity of these processes frequently results in redundancy…

Computation and Language · Computer Science 2026-03-10 Chenzhi Hu , Qinzhe Hu , Yuhang Xu , Junyi Chen , Ruijie Wang , Shengzhong Liu , Jianxin Li , Fan Wu , Guihai Chen

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