English
Related papers

Related papers: Characterizing Prompt Compression Methods for Long…

200 papers

Large language models solve complex tasks by generating long reasoning chains, achieving higher accuracy at the cost of increased computational cost and reduced ability to isolate functionally relevant reasoning. Prior work on compact…

Computation and Language · Computer Science 2026-04-22 Janvijay Singh , Dilek Hakkani-Tür

Continuous prompts, or "soft prompts", are a widely-adopted parameter-efficient tuning strategy for large language models, but are often less favorable due to their opaque nature. Prior attempts to interpret continuous prompts relied on…

Computation and Language · Computer Science 2024-10-16 Dana Ramati , Daniela Gottesman , Mor Geva

Retrieval-Augmented Generation (RAG) enhances coding tasks by incorporating retrieved code examples into prompts. However, lengthy prompts, often exceeding tens of thousands of tokens, introduce challenges related to limited context windows…

Software Engineering · Computer Science 2026-04-13 Pengfei He , Shaowei Wang , Tse-Hsun Chen

Most of the world's digital data is currently encoded in a sequential form, and compression methods for sequences have been studied extensively. However, there are many types of non-sequential data for which good compression techniques are…

Information Theory · Computer Science 2016-01-15 Christian Steinruecken

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

The amount of text data available online is increasing at a very fast pace hence text summarization has become essential. Most of the modern recommender and text classification systems require going through a huge amount of data. Manually…

Computation and Language · Computer Science 2021-08-03 Anushka Gupta , Diksha Chugh , Anjum , Rahul Katarya

Chain-of-Thought (CoT) reasoning enhances large language models (LLMs) by enabling step-by-step problem-solving, yet its extension to Long-CoT introduces substantial computational overhead due to increased token length. Existing compression…

Computation and Language · Computer Science 2025-11-14 Yibo Wang , Haotian Luo , Huanjin Yao , Tiansheng Huang , Haiying He , Rui Liu , Naiqiang Tan , Jiaxing Huang , Xiaochun Cao , Dacheng Tao , Li Shen

Human communication heavily relies on laconism and inferential pragmatics, allowing listeners to successfully reconstruct rich meaning from sparse, telegraphic speech. In contrast, large language models (LLMs) owe much of their stellar…

Computation and Language · Computer Science 2026-03-13 Syed Rifat Raiyan , Md Farhan Ishmam , Abdullah Al Imran , Mohammad Ali Moni

Retrieval-augmented generation improves various aspects of large language models (LLMs) generation, but suffers from computational overhead caused by long contexts as well as the propagation of irrelevant retrieved information into…

Computation and Language · Computer Science 2025-01-31 Nadezhda Chirkova , Thibault Formal , Vassilina Nikoulina , Stéphane Clinchant

As large language models (LLMs) improve their capabilities in handling complex tasks, the issues of computational cost and efficiency due to long prompts are becoming increasingly prominent. To accelerate model inference and reduce costs,…

Computation and Language · Computer Science 2024-09-04 Xuechen Liang , Meiling Tao , Yinghui Xia , Tianyu Shi , Jun Wang , JingSong Yang

Modern deep neural networks, particularly recent large language models, come with massive model sizes that require significant computational and storage resources. To enable the deployment of modern models on resource-constrained…

Machine Learning · Computer Science 2024-08-12 Hongrong Cheng , Miao Zhang , Javen Qinfeng Shi

In-context learning has established itself as an important learning paradigm for Large Language Models (LLMs). In this paper, we demonstrate that LLMs can learn encoding keys in-context and perform analysis directly on encoded…

Computation and Language · Computer Science 2026-04-16 Andresa Rodrigues de Campos , David Lee , Imry Kissos , Piyush Paritosh

Text summarization aims to compress a textual document to a short summary while keeping salient information. Extractive approaches are widely used in text summarization because of their fluency and efficiency. However, most of existing…

Computation and Language · Computer Science 2020-10-14 Peng Cui , Le Hu , Yuanchao Liu

Extractive compression is a challenging natural language processing problem. This work contributes by formulating neural extractive compression as a parse tree transduction problem, rather than a sequence transduction task. Motivated by…

Information Retrieval · Computer Science 2018-09-26 Davide Bacciu , Antonio Bruno

Recently, compressive text summarisation offers a balance between the conciseness issue of extractive summarisation and the factual hallucination issue of abstractive summarisation. However, most existing compressive summarisation methods…

Computation and Language · Computer Science 2023-06-07 Peggy Tang , Junbin Gao , Lei Zhang , Zhiyong Wang

Emerging reasoning LLMs such as OpenAI-o1 and DeepSeek-R1 have achieved strong performance on complex reasoning tasks by generating long chain-of-thought (CoT) traces. However, these long CoTs result in increased token usage, leading to…

Machine Learning · Computer Science 2025-11-18 Yuxiang Zhang , Zhengxu Yu , Weihang Pan , Zhongming Jin , Qiang Fu , Deng Cai , Binbin Lin , Jieping Ye

Large Reasoning Models (LRMs) have demonstrated remarkable capabilities by scaling up the length of Chain-of-Thought (CoT). However, excessively long reasoning traces pose substantial challenges for training cost and inference latency.…

Machine Learning · Computer Science 2026-01-09 Wenhao Zeng , Yaoning Wang , Chao Hu , Yuling Shi , Chengcheng Wan , Hongyu Zhang , Xiaodong Gu

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

Select-then-compress is a popular hybrid, framework for text summarization due to its high efficiency. This framework first selects salient sentences and then independently condenses each of the selected sentences into a concise version.…

Computation and Language · Computer Science 2021-06-22 Hou Pong Chan , Irwin King

Large language models (LLMs) based on Transformer have been widely applied in the filed of natural language processing (NLP), demonstrating strong performance, particularly in handling short text tasks. However, when it comes to long…

Computation and Language · Computer Science 2025-07-09 Yijun Liu , Jinzheng Yu , Yang Xu , Zhongyang Li , Qingfu Zhu