English
Related papers

Related papers: TRIO: Token Reduction via Inference-Objective Guid…

200 papers

In vision-language models (VLMs), visual tokens usually bear a significant amount of computational overhead despite sparsity of information in them when compared to text tokens. To address this, most existing methods learn a network to…

Computer Vision and Pattern Recognition · Computer Science 2025-06-04 Yuan Zhang , Chun-Kai Fan , Junpeng Ma , Wenzhao Zheng , Tao Huang , Kuan Cheng , Denis Gudovskiy , Tomoyuki Okuno , Yohei Nakata , Kurt Keutzer , Shanghang Zhang

Recent Large Vision-Language Models (LVLMs) have advanced multi-modal understanding by incorporating finer-grained visual perception and encoding. However, such methods incur significant computational costs due to longer visual token…

Computer Vision and Pattern Recognition · Computer Science 2026-02-02 Ce Zhang , Kaixin Ma , Tianqing Fang , Wenhao Yu , Hongming Zhang , Zhisong Zhang , Haitao Mi , Dong Yu

Vision Language Models (VLMs) have demonstrated strong capabilities across various visual understanding and reasoning tasks, driven by incorporating image representations into the token inputs of Large Language Models (LLMs). However, their…

Computer Vision and Pattern Recognition · Computer Science 2025-04-22 Kevin Y. Li , Sachin Goyal , Joao D. Semedo , J. Zico Kolter

Despite achieving remarkable performance on various vision-language tasks, Transformer-based Vision-Language Models (VLMs) suffer from redundancy in inputs and parameters, significantly hampering their efficiency in real-world applications.…

Computation and Language · Computer Science 2024-02-27 Zekun Wang , Jingchang Chen , Wangchunshu Zhou , Haichao Zhu , Jiafeng Liang , Liping Shan , Ming Liu , Dongliang Xu , Qing Yang , Bing Qin

Recent advancements in vision-language models (VLMs) have improved performance by increasing the number of visual tokens, which are often significantly longer than text tokens. However, we observe that most real-world scenarios do not…

Computer Vision and Pattern Recognition · Computer Science 2025-07-18 Senqiao Yang , Junyi Li , Xin Lai , Bei Yu , Hengshuang Zhao , Jiaya Jia

Visual token pruning is a promising approach for reducing the computational cost of vision-language models (VLMs), and existing methods often rely on early pruning decisions to improve efficiency. While effective on coarse-grained reasoning…

Computer Vision and Pattern Recognition · Computer Science 2026-02-04 Chen Qian , Xinran Yu , Danyang Li , Guoxuan Chi , Zheng Yang , Qiang Ma , Xin Miao

Large Vision-Language Models (LVLMs) encode visual inputs as dense sequences of patch-level tokens to capture fine-grained semantics. These visual tokens often outnumber their textual counterparts by a large margin, leading to substantial…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Rui Xu , Yunke Wang , Yong Luo , Bo Du

Large vision-language models (LVLMs) have demonstrated remarkable capabilities in multimodal understanding tasks. However, the increasing demand for high-resolution image and long-video understanding results in substantial token counts,…

Computer Vision and Pattern Recognition · Computer Science 2026-02-26 Junjie Chen , Xuyang Liu , Zichen Wen , Yiyu Wang , Siteng Huang , Honggang Chen

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

Vision-language models (VLMs) have achieved remarkable multimodal understanding and reasoning capabilities, yet remain computationally expensive due to dense visual tokenization. Existing efficiency approaches either merge redundant visual…

Computer Vision and Pattern Recognition · Computer Science 2026-03-30 Aditya Kumar Singh , Hitesh Kandala , Pratik Prabhanjan Brahma , Zicheng Liu , Emad Barsoum

Vision-Language Models (VLMs) have achieved remarkable success in various multi-modal tasks, but they are often bottlenecked by the limited context window and high computational cost of processing high-resolution image inputs and videos.…

Computer Vision and Pattern Recognition · Computer Science 2025-03-04 Xubing Ye , Yukang Gan , Xiaoke Huang , Yixiao Ge , Yansong Tang

Multimodal large language models (MLLMs) suffer from high computational costs due to excessive visual tokens, particularly in high-resolution and video-based scenarios. Existing token reduction methods typically focus on isolated pipeline…

Computer Vision and Pattern Recognition · Computer Science 2026-03-31 Hanxun Yu , Wentong Li , Xuan Qu , Song Wang , Junbo Chen , Jianke Zhu

Visual language models encounter challenges in computational efficiency and latency, primarily due to the substantial redundancy in the token representations of high-resolution images and videos. Current attention/similarity-based…

Computer Vision and Pattern Recognition · Computer Science 2025-12-11 Dehua Zheng , Mouxiao Huang , Borui Jiang , Hailin Hu , Xinghao Chen

Recent advances on Multi-modal Large Language Models have demonstrated that high-resolution image input is crucial for model capabilities, especially for fine-grained tasks. However, high-resolution images lead to a quadratic increase in…

Computer Vision and Pattern Recognition · Computer Science 2024-11-22 Yuke Zhu , Chi Xie , Shuang Liang , Bo Zheng , Sheng Guo

Vision-Language Models (VLMs) face significant computational challenges in video processing due to massive data redundancy, which creates prohibitively long token sequences. To address this, we introduce Triage, a training-free,…

Computer Vision and Pattern Recognition · Computer Science 2026-02-02 Anmin Wang , Nan Zhang , Wei Tao , Xiaoyang Qu , Guokuan Li , Jiguang Wan , Jianzong Wang

The computational expense of redundant vision tokens in Large Vision-Language Models (LVLMs) has led many existing methods to compress them via a vision projector. However, this compression may lose visual information that is crucial for…

Computer Vision and Pattern Recognition · Computer Science 2025-11-27 Ze Feng , Jiang-jiang Liu , Sen Yang , Lingyu Xiao , Zhibin Quan , Zhenhua Feng , Wankou Yang , Jingdong Wang

By cropping high-resolution images into local tiles and encoding them independently, High-Resolution Large Vision-Language Models (HR-LVLMs) have demonstrated remarkable fine-grained visual understanding capabilities. However, this…

Computer Vision and Pattern Recognition · Computer Science 2025-09-30 Xu Li , Yuxuan Liang , Xiaolei Chen , Yi Zheng , Haotian Chen , Bin Li , Xiangyang Xue

Visual token pruning aims to compress and prune redundant visual tokens which play a critical role in efficient inference with large vision-language models (LVLMs). However, most existing work estimates visual redundancy using a single…

Computer Vision and Pattern Recognition · Computer Science 2025-11-20 Duo Li , Zuhao Yang , Xiaoqin Zhang , Ling Shao , Shijian Lu

Vision-Language Models (VLMs) have achieved remarkable success in visual question answering tasks, but their reliance on large numbers of visual tokens introduces significant computational overhead. While existing efficient VLM approaches…

Computer Vision and Pattern Recognition · Computer Science 2026-03-24 Zichuan Lin , Yicheng Liu , Yang Yang , Lvfang Tao , Deheng Ye

Vision-language models (VLMs) rely on long visual token sequences for visual understanding, making the prefill stage expensive in both computation and memory. Most existing pruning methods follow an absolute-ranking paradigm, assigning…

Computer Vision and Pattern Recognition · Computer Science 2026-05-29 Geng Li , Guohao Chen , Ting Chen , Shilin Shan , Kuangji Zuo , Bofan Lyu , Tuo An , Gen Li , Jianfei Yang
‹ Prev 1 2 3 10 Next ›