English
Related papers

Related papers: Infor-Coef: Information Bottleneck-based Dynamic T…

200 papers

In recent years, Transformer-based language models have become the standard approach for natural language processing tasks. However, stringent throughput and latency requirements in industrial applications are limiting their adoption. To…

Machine Learning · Computer Science 2023-06-30 Haihao Shen , Hengyu Meng , Bo Dong , Zhe Wang , Ofir Zafrir , Yi Ding , Yu Luo , Hanwen Chang , Qun Gao , Ziheng Wang , Guy Boudoukh , Moshe Wasserblat

The adoption of Transformer-based models in natural language processing (NLP) has led to great success using a massive number of parameters. However, due to deployment constraints in edge devices, there has been a rising interest in the…

Computation and Language · Computer Science 2021-08-04 Klaudia Bałazy , Mohammadreza Banaei , Rémi Lebret , Jacek Tabor , Karl Aberer

Pre-trained Transformer-based models have achieved state-of-the-art performance for various Natural Language Processing (NLP) tasks. However, these models often have billions of parameters, and, thus, are too resource-hungry and…

Machine Learning · Computer Science 2021-09-29 Prakhar Ganesh , Yao Chen , Xin Lou , Mohammad Ali Khan , Yin Yang , Hassan Sajjad , Preslav Nakov , Deming Chen , Marianne Winslett

Multimodal Large Language Models (MLLMs) incur significant computational cost from processing numerous vision tokens through all LLM layers. Prior pruning methods operate either before the LLM, limiting generality due to diverse…

Computer Vision and Pattern Recognition · Computer Science 2026-02-16 Omer Faruk Deniz , Ruiyu Mao , Ruochen Li , Yapeng Tian , Latifur Khan

Transformer-based models have driven significant advancements in Multimodal Large Language Models (MLLMs), yet their computational costs surge drastically when scaling resolution, training data, and model parameters. A key bottleneck stems…

Computer Vision and Pattern Recognition · Computer Science 2025-07-04 Weili Zeng , Ziyuan Huang , Kaixiang Ji , Yichao Yan

Transformer-based approaches have been successfully used to obtain state-of-the-art accuracy on natural language processing (NLP) tasks with semi-structured tables. These model architectures are typically deep, resulting in slow training…

Computation and Language · Computer Science 2021-06-02 Syrine Krichene , Thomas Müller , Julian Martin Eisenschlos

Large language models (LLMs) demonstrate strong performance as text embedding models when finetuned with supervised contrastive training. However, their large size balloons inference time and memory requirements. In this paper, we show that…

Computation and Language · Computer Science 2024-10-21 Thennal D K , Tim Fischer , Chris Biemann

Large language models (LLMs) excel at language understanding and generation, but their enormous computational and memory requirements hinder deployment. Compression offers a potential solution to mitigate these constraints. However, most…

Machine Learning · Computer Science 2026-05-19 Huanrong Liu , Chunlin Tian , Xuyang Wei , Qingbiao Li , Li Li

Since ChatGPT released its API for public use, the number of applications built on top of commercial large language models (LLMs) increase exponentially. One popular usage of such models is leveraging its in-context learning ability and…

Computation and Language · Computer Science 2023-10-26 Junyi Liu , Liangzhi Li , Tong Xiang , Bowen Wang , Yiming Qian

Identifying algorithms for computational efficient unsupervised training of large language models is an important and active area of research. In this work, we develop and study a straightforward, dynamic always-sparse pre-training approach…

Computation and Language · Computer Science 2021-08-16 Anastasia Dietrich , Frithjof Gressmann , Douglas Orr , Ivan Chelombiev , Daniel Justus , Carlo Luschi

Modern language models are trained almost exclusively on token sequences produced by a fixed tokenizer, an external lossless compressor often over UTF-8 byte sequences, thereby coupling the model to that compressor. This work introduces…

Computation and Language · Computer Science 2026-05-15 Lin Zheng , Xinyu Li , Qian Liu , Xiachong Feng , Lingpeng Kong

Despite the recent success of large language models (LLMs), LLMs are particularly challenging in long-sequence inference scenarios due to the quadratic computational complexity of the attention mechanism. Inspired by the interpretability…

Computation and Language · Computer Science 2025-04-10 Yao Tao , Yehui Tang , Yun Wang , Mingjian Zhu , Hailin Hu , Yunhe Wang

Transformer-based language models have become the standard approach to solving natural language processing tasks. However, industry adoption usually requires the maximum throughput to comply with certain latency constraints that prevents…

Computation and Language · Computer Science 2022-12-08 Haihao Shen , Ofir Zafrir , Bo Dong , Hengyu Meng , Xinyu Ye , Zhe Wang , Yi Ding , Hanwen Chang , Guy Boudoukh , Moshe Wasserblat

Large language models (LLMs) process entire input contexts indiscriminately, which is inefficient when the information required to answer a query is localized within the context. We present dynamic context cutoff, a novel method enabling…

Computation and Language · Computer Science 2026-02-10 Roy Xie , Junlin Wang , Paul Rosu , Chunyuan Deng , Bolun Sun , Zihao Lin , Bhuwan Dhingra

Traditional language models operate autoregressively, i.e., they predict one token at a time. Rapid explosion in model sizes has resulted in high inference times. In this work, we propose DynaMo, a suite of multi-token prediction language…

Computation and Language · Computer Science 2024-05-03 Shikhar Tuli , Chi-Heng Lin , Yen-Chang Hsu , Niraj K. Jha , Yilin Shen , Hongxia Jin

As large language models continue to scale, their growing computational and storage demands pose significant challenges for real-world deployment. In this work, we investigate redundancy within Transformer-based models and propose an…

Computation and Language · Computer Science 2025-04-08 Liangwei Yang , Yuhui Xu , Juntao Tan , Doyen Sahoo , Silvio Savarese , Caiming Xiong , Huan Wang , Shelby Heinecke

With the wide adoption of language models for IR -- and specifically RAG systems -- the latency of the underlying LLM becomes a crucial bottleneck, since the long contexts of retrieved passages lead large prompts and therefore, compute…

Information Retrieval · Computer Science 2026-04-06 Cornelius Kummer , Lena Jurkschat , Michael Färber , Sahar Vahdati

Recent advancements in Large Language Models (LLMs) have demonstrated impressive capabilities as their scale expands to billions of parameters. Deploying these large-scale models on resource-constrained platforms presents significant…

Hardware Architecture · Computer Science 2025-05-15 Keran Zheng , Yinting Huang , Zhewen Yu , Christos-Savvas Bouganis

Recently, prompt tuning \cite{lester2021power} has gradually become a new paradigm for NLP, which only depends on the representation of the words by freezing the parameters of pre-trained language models (PLMs) to obtain remarkable…

Computation and Language · Computer Science 2022-01-31 Pan He , Yuxi Chen , Yan Wang , Yanru Zhang

Prompt compression methods enhance the efficiency of Large Language Models (LLMs) and minimize the cost by reducing the length of input context. The goal of prompt compression is to shorten the LLM prompt while maintaining a high generation…

Computation and Language · Computer Science 2025-08-25 Tinghui Zhang , Yifan Wang , Daisy Zhe Wang
‹ Prev 1 4 5 6 7 8 10 Next ›