English
Related papers

Related papers: Query-focused Sentence Compression in Linear Time

200 papers

Deep learning models have become state of the art for natural language processing (NLP) tasks, however deploying these models in production system poses significant memory constraints. Existing compression methods are either lossy or…

Machine Learning · Computer Science 2018-11-05 Anish Acharya , Rahul Goel , Angeliki Metallinou , Inderjit Dhillon

The advancement of large language models (LLMs) and multi-modal LLMs (MLLMs) has historically relied on scaling model parameters. However, as hardware limits constrain further model growth, the primary computational bottleneck has shifted…

Language Reasoning Models (LRMs) achieve strong performance by scaling test-time computation but often suffer from ``overthinking'', producing excessively long reasoning traces that increase latency and memory usage. Existing LRMs typically…

Multi-turn dialogues are essential in many real-world applications of large language models, such as chatbots and virtual assistants. As conversation histories become longer, existing large language models face increasing computational and…

Computation and Language · Computer Science 2025-09-29 Haoyang Li , Zhanchao Xu , Yiming Li , Xuejia Chen , Darian Li , Anxin Tian , Qingfa Xiao , Cheng Deng , Jun Wang , Qing Li , Lei Chen , Mingxuan Yuan

Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need to represent highly…

Data Structures and Algorithms · Computer Science 2019-11-25 Alberto Ordóñez , Gonzalo Navarro , Nieves R. Brisaboa

Semantic parsing has made significant progress, but most current semantic parsers are extremely slow (CKY-based) and rather primitive in representation. We introduce three new techniques to tackle these problems. First, we design the first…

Computation and Language · Computer Science 2014-12-17 Kai Zhao , Liang Huang

Retrieving documents and prepending them in-context at inference time improves performance of language model (LMs) on a wide range of tasks. However, these documents, often spanning hundreds of words, make inference substantially more…

Computation and Language · Computer Science 2023-10-09 Fangyuan Xu , Weijia Shi , Eunsol Choi

Long-context large language models remain computationally expensive to run and often fail to reliably process very long inputs, which makes context compression an important component of many systems. Existing compression approaches…

Computation and Language · Computer Science 2026-04-28 Yitian Zhou , Chaoning Zhang , Jiaquan Zhang , Zhenzhen Huang , Jinyu Guo , Sung-Ho Bae , Lik-Hang Lee , Caiyan Qin , Yang Yang

Real-world business applications require a trade-off between language model performance and size. We propose a new method for model compression that relies on vocabulary transfer. We evaluate the method on various vertical domains and…

Computation and Language · Computer Science 2024-02-16 Leonidas Gee , Andrea Zugarini , Leonardo Rigutini , Paolo Torroni

We explore the effectiveness of an LLM-guided query refinement paradigm for extending the usability of embedding models to challenging zero-shot search and classification tasks. Our approach refines the embedding representation of a user…

Computation and Language · Computer Science 2026-05-13 Ariel Gera , Shir Ashury-Tahan , Gal Bloch , Ohad Eytan , Assaf Toledo

Large Language Model (LLM)-based search agents have shown remarkable capabilities in solving complex tasks by dynamically decomposing problems and addressing them through interleaved reasoning and retrieval. However, this interleaved…

Artificial Intelligence · Computer Science 2025-05-20 Tiannuo Yang , Zebin Yao , Bowen Jin , Lixiao Cui , Yusen Li , Gang Wang , Xiaoguang Liu

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…

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

Despite the recent success of Large Language Models (LLMs), it remains challenging to feed LLMs with long prompts due to the fixed size of LLM inputs. As a remedy, prompt compression becomes a promising solution by removing redundant tokens…

Computation and Language · Computer Science 2025-01-06 Ziyang Yu , Yuyu Liu

Random access to highly compressed strings -- represented by straight-line programs or Lempel-Ziv parses, for example -- is a well-studied topic. Random access to such strings in strongly sublogarithmic time is impossible in the worst case,…

Data Structures and Algorithms · Computer Science 2026-02-05 Ferdinando Cicalese , Zsuzsanna Lipták , Travis Gagie , Gonzalo Navarro , Nicola Prezza , Cristian Urbina

Efficient context compression is crucial for improving the accuracy and scalability of question answering. For the efficiency of Retrieval Augmented Generation, context should be delivered fast, compact, and precise to ensure clue…

Computation and Language · Computer Science 2026-03-11 Thao Do , Dinh Phu Tran , An Vo , Seon Kwon Kim , Daeyoung Kim

Relational queries, and in particular join queries, often generate large output results when executed over a huge dataset. In such cases, it is often infeasible to store the whole materialized output if we plan to reuse it further down a…

Databases · Computer Science 2018-03-28 Shaleen Deep , Paraschos Koutris

Large Language Models (LLMs) have garnered widespread attention due to their remarkable performance across various tasks. However, to mitigate the issue of hallucinations, LLMs often incorporate retrieval-augmented pipeline to provide them…

Computation and Language · Computer Science 2024-08-29 Haowen Hou , Fei Ma , Binwen Bai , Xinxin Zhu , Fei Yu

We revisit the design choices in Transformers, and propose methods to address their weaknesses in handling long sequences. First, we propose a simple layer named gated attention unit, which allows the use of a weaker single-head attention…

Machine Learning · Computer Science 2022-06-28 Weizhe Hua , Zihang Dai , Hanxiao Liu , Quoc V. Le

Clustering is a fundamental tool that has garnered significant interest across a wide range of applications including text analysis. To improve clustering accuracy, many researchers have incorporated background knowledge, typically in the…

Machine Learning · Computer Science 2026-01-19 Chaoqi Jia , Weihong Wu , Longkun Guo , Zhigang Lu , Chao Chen , Kok-Leong Ong