English
Related papers

Related papers: Better Prompt Compression Without Multi-Layer Perc…

200 papers

High-dimensional token embeddings underpin Large Language Models (LLMs), as they can capture subtle semantic information and significantly enhance the modelling of complex language patterns. However, this high dimensionality also introduces…

Computation and Language · Computer Science 2024-10-07 Mingxue Xu , Yao Lei Xu , Danilo P. Mandic

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

Feature compression is increasingly important for improving the efficiency of downstream tasks, especially in applications involving large-scale or multi-modal data. While existing methods typically rely on dedicated models for achieving…

Computer Vision and Pattern Recognition · Computer Science 2026-02-13 Yufan Liu , Daoyuan Ren , Zhipeng Zhang , Wenyang Luo , Bing Li , Weiming Hu , Stephen Maybank

Prompt learning has recently become a very efficient transfer learning paradigm for Contrastive Language Image Pretraining (CLIP) models. Compared with fine-tuning the entire encoder, prompt learning can obtain highly competitive results by…

Machine Learning · Computer Science 2024-08-30 Guoyizhe Wei , Feng Wang , Anshul Shah , Rama Chellappa

Pre-trained diffusion models have enabled significant advancements in All-in-One Restoration (AiOR), offering improved perceptual quality and generalization. However, diffusion-based restoration methods primarily rely on fine-tuning or…

Computer Vision and Pattern Recognition · Computer Science 2026-04-07 Sudarshan Rajagopalan , Vishal M. Patel

Transformer based large language models have achieved tremendous success. However, the significant memory and computational costs incurred during the inference process make it challenging to deploy large models on resource-constrained…

Computation and Language · Computer Science 2024-02-16 Wenxiao Wang , Wei Chen , Yicong Luo , Yongliu Long , Zhengkai Lin , Liye Zhang , Binbin Lin , Deng Cai , Xiaofei He

Large Language Models (LLMs) incur significant computational and memory costs when processing long prompts, as full self-attention scales quadratically with input length. Token compression aims to address this challenge by reducing the…

Computation and Language · Computer Science 2026-04-23 Zihao Xu , John Harvill , Ziwei Fan , Yizhou Sun , Hao Ding , Hao Wang

Prompts have been shown to be an effective method to adapt a frozen Pretrained Language Model (PLM) to perform well on downstream tasks. Prompts can be represented by a human-engineered word sequence or by a learned continuous embedding. In…

Computation and Language · Computer Science 2023-07-06 Jonathan Pilault , Can Liu , Mohit Bansal , Markus Dreyer

Modern foundation models such as large language models (LLMs) and large multi-modal models (LMMs) require a massive amount of computational and memory resources. We propose a new framework to convert such LLMs/LMMs into a reduced-dimension…

Machine Learning · Computer Science 2025-05-27 Toshiaki Koike-Akino , Xiangyu Chen , Jing Liu , Ye Wang , Pu , Wang , Matthew Brand

Retrieval-augmented generation (RAG) often suffers from long and noisy retrieved contexts. Prior context compression methods rely on predefined importance metrics or supervised compression models, rather than on the model's own…

Computation and Language · Computer Science 2026-01-27 Yong Zhang , Heng Li , Yanwen Huang , Ning Cheng , Yang Guo , Yun Zhu , Yanmeng Wang , Shaojun Wang , Jing Xiao

In this paper, we introduce the range of oBERTa language models, an easy-to-use set of language models which allows Natural Language Processing (NLP) practitioners to obtain between 3.8 and 24.3 times faster models without expertise in…

Computation and Language · Computer Science 2023-06-07 Daniel Campos , Alexandre Marques , Mark Kurtz , ChengXiang Zhai

Existing visual token compression methods for Multimodal Large Language Models (MLLMs) predominantly operate as post-encoder modules, limiting their potential for efficiency gains. To address this limitation, we propose LaCo (Layer-wise…

Computer Vision and Pattern Recognition · Computer Science 2025-07-04 Juntao Liu , Liqiang Niu , Wenchao Chen , Jie Zhou , Fandong Meng

Motivated by the high costs of using black-box Large Language Models (LLMs), we introduce a novel prompt compression paradigm, under which we use smaller LLMs to compress inputs for the larger ones. We present the first comprehensive…

Computation and Language · Computer Science 2026-01-12 Ivan Zakazov , Berke Argin , Oussama Gabouj , Kamel Charaf , Alexander Sharipov , Alexi Semiz , Lorenzo Drudi , Nicolas Baldwin , Robert West

Low-rank adaptation (LoRA) has become a prevalent method for adapting pre-trained large language models to downstream tasks. However, the simple low-rank decomposition form may constrain the hypothesis space. To address this limitation, we…

Machine Learning · Computer Science 2025-04-30 Zhekai Du , Yinjie Min , Jingjing Li , Ke Lu , Changliang Zou , Liuhua Peng , Tingjin Chu , Mingming Gong

Context compression is an advanced technique that accelerates large language model (LLM) inference by converting long inputs into compact representations. Existing methods primarily rely on autoencoding tasks to train special compression…

Computation and Language · Computer Science 2026-03-12 Xin Liu , Runsong Zhao , Pengcheng Huang , Xinyu Liu , Junyi Xiao , Chunyang Xiao , Tong Xiao , Shengxiang Gao , Zhengtao Yu , Jingbo Zhu

Long-context inference in decoder-only language models is costly because long prompts are processed during Prefill, cached at every layer, and repeatedly attended to during autoregressive Decode. We introduce \emph{Shallow Prefill, dEEp…

Artificial Intelligence · Computer Science 2026-05-08 Jungsuk Oh , Hyeseo Jeon , Hyunjune Ji , Kyongmin Kong , Jay-Yoon Lee

Printed electronics technology offers a cost-effectiveand fully-customizable solution to computational needs beyondthe capabilities of traditional silicon technologies, offering ad-vantages such as on-demand manufacturing and conformal,…

Hardware Architecture · Computer Science 2024-12-10 Florentia Afentaki , Paula Carolina Lozano Duarte , Georgios Zervakis , Mehdi B. Tahoori

Prompts are crucial to large language models as they provide context information such as topic or logical relationships. Inspired by this, we propose PromptASR, a framework that integrates prompts in end-to-end automatic speech recognition…

Audio and Speech Processing · Electrical Eng. & Systems 2024-01-25 Xiaoyu Yang , Wei Kang , Zengwei Yao , Yifan Yang , Liyong Guo , Fangjun Kuang , Long Lin , Daniel Povey

Large Language Models (LLMs) have enabled remarkable progress in natural language processing, yet their high computational and memory demands pose challenges for deployment in resource-constrained environments. Although recent low-rank…

Computation and Language · Computer Science 2026-02-09 Jiayi Tian , Ryan Solgi , Jinming Lu , Yifan Yang , Hai Li , Zheng Zhang

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