English
Related papers

Related papers: LLMLingua-2: Data Distillation for Efficient and F…

200 papers

The key challenge in semantic search is to create models that are both accurate and efficient in pinpointing relevant sentences for queries. While BERT-style bi-encoders excel in efficiency with pre-computed embeddings, they often miss…

Computation and Language · Computer Science 2024-06-26 Zihan Liao , Hang Yu , Jianguo Li , Jun Wang , Wei Zhang

While significant advancements have been made in compressed representations for text embeddings in large language models (LLMs), the compression of visual tokens in multi-modal LLMs (MLLMs) has remained a largely overlooked area. In this…

Computer Vision and Pattern Recognition · Computer Science 2024-11-19 Jieneng Chen , Luoxin Ye , Ju He , Zhao-Yang Wang , Daniel Khashabi , Alan Yuille

The rapid growth of high-resolution scientific simulations and observation systems is generating massive spatiotemporal datasets, making efficient, error-bounded compression increasingly important. Meanwhile, decoder-only large language…

Machine Learning · Computer Science 2025-11-06 Guozhong Li , Muhannad Alhumaidi , Spiros Skiadopoulos , Panos Kalnis

Extractive summarization can produce faithful summaries but often requires additional constraints such as a desired summary length. Traditional sentence compression models do not typically consider the constraints because of their…

Computation and Language · Computer Science 2024-06-21 Juseon-Do , Jingun Kwon , Hidetaka Kamigaito , Manabu Okumura

Distilling robust reasoning capabilities from large language models (LLMs) into smaller, computationally efficient student models remains an unresolved challenge. Despite recent advances, distilled models frequently suffer from superficial…

Computation and Language · Computer Science 2026-03-23 Zhen Tan , Chengshuai Zhao , Song Wang , Jundong Li , Tianlong Chen , Huan Liu

In this report, we investigate the potential use of large language models (LLM's) in the task of data compression. Previous works have demonstrated promising results in applying LLM's towards compressing not only text, but also a wide range…

Computation and Language · Computer Science 2026-01-07 Chen-Han Tsai

Existing Multimodal Large Language Models (MLLMs) process a large number of visual tokens, leading to significant computational costs and inefficiency. Instruction-related visual token compression demonstrates strong task relevance, which…

Computer Vision and Pattern Recognition · Computer Science 2026-05-05 Lei Lei , Jie Gu , Xiaokang Ma , Chu Tang , Jingmin Chen , Tong Xu

Despite the remarkable success of Large Language Models (LLMs), the massive size poses significant deployment challenges, particularly on resource-constrained hardware. While existing LLM compression methods focus on quantization, pruning…

Artificial Intelligence · Computer Science 2023-10-12 Song Guo , Jiahang Xu , Li Lyna Zhang , Mao Yang

Recent studies have demonstrated the great potential of Large Language Models (LLMs) serving as zero-shot relevance rankers. The typical approach involves making comparisons between pairs or lists of documents. Although effective, these…

Information Retrieval · Computer Science 2023-11-06 Weiwei Sun , Zheng Chen , Xinyu Ma , Lingyong Yan , Shuaiqiang Wang , Pengjie Ren , Zhumin Chen , Dawei Yin , Zhaochun Ren

Leading open-source large language models (LLMs) such as Llama-3.1-Instruct-405B are extremely capable at generating text, answering questions, and solving a variety of natural language understanding tasks. However, they incur higher…

Machine Learning · Computer Science 2024-10-25 Anup Shirgaonkar , Nikhil Pandey , Nazmiye Ceren Abay , Tolga Aktas , Vijay Aski

With the advent of foundation models, prompt tuning has positioned itself as an important technique for directing model behaviors and eliciting desired responses. Prompt tuning regards selecting appropriate keywords included into the input,…

Machine Learning · Computer Science 2024-07-23 Yunseon Choi , Sangmin Bae , Seonghyun Ban , Minchan Jeong , Chuheng Zhang , Lei Song , Li Zhao , Jiang Bian , Kee-Eung Kim

Autoprompting is the process of automatically selecting optimized prompts for language models, which is gaining popularity due to the rapid development of prompt engineering driven by extensive research in the field of large language models…

Computation and Language · Computer Science 2025-09-09 Ernest A. Dyagin , Nikita I. Kulin , Artur R. Khairullin , Viktor N. Zhuravlev , Alena N. Sitkina

Compressed prompts aid instruction-tuned language models (LMs) in overcoming context window limitations and reducing computational costs. Existing methods, which primarily based on training embeddings, face various challenges associated…

Computation and Language · Computer Science 2024-06-04 Hoyoun Jung , Kyung-Joong Kim

Data-free knowledge distillation (DFKD) conducts knowledge distillation via eliminating the dependence of original training data, and has recently achieved impressive results in accelerating pre-trained language models. At the heart of DFKD…

Computation and Language · Computer Science 2022-05-17 Xinyin Ma , Xinchao Wang , Gongfan Fang , Yongliang Shen , Weiming Lu

We consider the problem of language model inversion: given outputs of a language model, we seek to extract the prompt that generated these outputs. We develop a new black-box method, output2prompt, that learns to extract prompts without…

Computation and Language · Computer Science 2024-10-10 Collin Zhang , John X. Morris , Vitaly Shmatikov

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

Autoregressive Transformers adopted in Large Language Models (LLMs) are hard to scale to long sequences. Despite several works trying to reduce their computational cost, most of LLMs still adopt attention layers between all pairs of tokens…

Computation and Language · Computer Science 2024-06-03 Sotiris Anagnostidis , Dario Pavllo , Luca Biggio , Lorenzo Noci , Aurelien Lucchi , Thomas Hofmann

In spite of strong performance achieved by LLMs, the costs of their deployment are unaffordable. For the compression of LLMs, gradient-based pruning methods present promising effectiveness. However, in these methods, the gradient…

Computation and Language · Computer Science 2025-06-16 Hourun Zhu , Chengchao Shen

Large Language Models (LLMs) have been shown to be able to learn different tasks without explicit finetuning when given many input-output examples / demonstrations through In-Context Learning (ICL). Increasing the number of examples, called…

Large language models (LLMs) excel at capturing global token dependencies via self-attention but face prohibitive compute and memory costs on lengthy inputs. While sub-quadratic methods (e.g., linear attention) can reduce these costs, they…

Machine Learning · Computer Science 2025-06-18 Yeonju Ro , Zhenyu Zhang , Souvik Kundu , Zhangyang Wang , Aditya Akella
‹ Prev 1 4 5 6 7 8 10 Next ›