English
Related papers

Related papers: Constraint-aware and Ranking-distilled Token Pruni…

200 papers

Token compression expedites the training and inference of Vision Transformers (ViTs) by reducing the number of the redundant tokens, e.g., pruning inattentive tokens or merging similar tokens. However, when applied to downstream tasks,…

Computer Vision and Pattern Recognition · Computer Science 2024-08-14 Shibo Jie , Yehui Tang , Jianyuan Guo , Zhi-Hong Deng , Kai Han , Yunhe Wang

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

With the rapid development of deep learning, large language models have shown strong capabilities in complex reasoning tasks such as mathematical equation solving. However, their substantial computational and storage costs hinder practical…

Machine Learning · Computer Science 2025-11-25 Fengming Yu , Qingyu Meng , Haiwei Pan , Kejia Zhang

Pre-trained language models have shown stellar performance in various downstream tasks. But, this usually comes at the cost of high latency and computation, hindering their usage in resource-limited settings. In this work, we propose a…

Computation and Language · Computer Science 2022-03-18 Ali Modarressi , Hosein Mohebbi , Mohammad Taher Pilehvar

Vision Transformers (ViTs) have achieved remarkable success across various vision tasks, yet their deployment is often hindered by prohibitive computational costs. While structured weight pruning and token compression have emerged as…

Computer Vision and Pattern Recognition · Computer Science 2026-02-19 Hyunchan Moon , Cheonjun Park , Steven L. Waslander

Vision-Language Models (VLMs) demand substantial computational resources during inference, largely due to the extensive visual input tokens for representing visual information. Previous studies have noted that visual tokens tend to receive…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Cheng Yang , Yang Sui , Jinqi Xiao , Lingyi Huang , Yu Gong , Chendi Li , Jinghua Yan , Yu Bai , Ponnuswamy Sadayappan , Xia Hu , Bo Yuan

In response to the rising interest in large multimodal models, we introduce Cross-Attention Token Pruning (CATP), a precision-focused token pruning method. Our approach leverages cross-attention layers in multimodal models, exemplified by…

Computation and Language · Computer Science 2026-02-16 Ruqi Liao , Chuqing Zhao , Jin Li , Weiqi Feng , Yi Lyu , Bingxian Chen , Haochen Yang

Large Vision-Language Models (LVLMs) have shown impressive performance across multi-modal tasks by encoding images into thousands of tokens. However, the large number of image tokens results in significant computational overhead, and the…

Computer Vision and Pattern Recognition · Computer Science 2025-10-24 Kaiyuan Li , Xiaoyue Chen , Chen Gao , Yong Li , Xinlei Chen

Deep language models such as BERT pre-trained on large corpus have given a huge performance boost to the state-of-the-art information retrieval ranking systems. Knowledge embedded in such models allows them to pick up complex matching…

Information Retrieval · Computer Science 2020-07-23 Luyu Gao , Zhuyun Dai , Jamie Callan

Token reduction accelerates Multimodal Large Language Models (MLLMs) by reducing excessive tokens, but overlooks structural redundancy differences, where critical and redundant modules process identical token loads. For fine-grained…

Machine Learning · Computer Science 2025-11-14 Aoming Liu , Reuben Tan , Boqing Gong , Bryan A. Plummer

Long-context inference enhances the reasoning capability of Large Language Models (LLMs), but incurs significant computational overhead. Token-oriented methods, such as pruning and skipping, have shown great promise in reducing inference…

Computation and Language · Computer Science 2026-02-03 Zimeng Wu , Donghao Wang , Chaozhe Jin , Jiaxin Chen , Yunhong Wang

Current language models rely on static vocabularies determined at pretraining time, which can lead to decreased performance and increased computational cost for domains underrepresented in the original vocabulary. New tokens can be added to…

Computation and Language · Computer Science 2026-03-16 Konstantin Dobler , Desmond Elliott , Gerard de Melo

Modern deployment often requires trading accuracy for efficiency under tight CPU and memory constraints, yet common compression proxies such as parameter count or FLOPs do not reliably predict wall-clock inference time. In particular,…

Machine Learning · Computer Science 2026-04-10 Longsheng Zhou , Yu Shen

As pretrained transformer language models continue to achieve state-of-the-art performance, the Natural Language Processing community has pushed for advances in model compression and efficient attention mechanisms to address high…

Computation and Language · Computer Science 2023-11-27 Nathan Brown , Ashton Williamson , Tahj Anderson , Logan Lawrence

Large Language Models (LLMs) have made significant strides in problem-solving by incorporating reasoning processes. However, this enhanced reasoning capability results in an increased number of output tokens during inference, leading to…

Computation and Language · Computer Science 2025-11-05 Jingxian Xu , Mengyu Zhou , Weichang Liu , Hanbing Liu , Shi Han , Dongmei Zhang

We present a novel approach to knowledge transfer in model-based reinforcement learning, addressing the critical challenge of deploying large world models in resource-constrained environments. Our method efficiently distills a high-capacity…

Machine Learning · Computer Science 2025-07-03 Dmytro Kuzmenko , Nadiya Shvai

The recent trend in industry-setting Natural Language Processing (NLP) research has been to operate large %scale pretrained language models like BERT under strict computational limits. While most model compression work has focused on…

Computation and Language · Computer Science 2021-04-13 J. S. McCarley , Rishav Chakravarti , Avirup Sil

Pretrained language models (PLMs) such as BERT adopt a training paradigm which first pretrain the model in general data and then finetune the model on task-specific data, and have recently achieved great success. However, PLMs are notorious…

Computation and Language · Computer Science 2021-06-07 Weiyue Su , Xuyi Chen , Shikun Feng , Jiaxiang Liu , Weixin Liu , Yu Sun , Hao Tian , Hua Wu , Haifeng Wang

In modern large language models (LLMs), increasing the context length is crucial for improving comprehension and coherence in long-context, multi-modal, and retrieval-augmented language generation. While many recent transformer models…

Computation and Language · Computer Science 2025-01-24 Heejun Lee , Geon Park , Youngwan Lee , Jaduk Suh , Jina Kim , Wonyoung Jeong , Bumsik Kim , Hyemin Lee , Myeongjae Jeon , Sung Ju Hwang

Late interaction neural IR models like ColBERT offer a competitive effectiveness-efficiency trade-off across many benchmarks. However, they require a huge memory space to store the contextual representation for all the document tokens. Some…

Information Retrieval · Computer Science 2025-04-18 Yuxuan Zong , Benjamin Piwowarski