English
Related papers

Related papers: SparseVLM: Visual Token Sparsification for Efficie…

200 papers

Large vision-language models (VLMs) enable joint processing of text and images. However, incorporating vision data significantly increases the prompt length, resulting in a longer time to first token (TTFT). This bottleneck can be…

Computer Vision and Pattern Recognition · Computer Science 2026-02-02 Tharun Adithya Srikrishnan , Deval Shah , Timothy Hein , Ahmed Hasssan , Stephen Youn , Steven K. Reinhardt

The efficiency of large vision-language models (LVLMs) is constrained by the computational bottleneck of the attention mechanism during the prefill phase and the memory bottleneck of fetching the key-value (KV) cache in the decoding phase,…

Computer Vision and Pattern Recognition · Computer Science 2024-12-19 Yefei He , Feng Chen , Jing Liu , Wenqi Shao , Hong Zhou , Kaipeng Zhang , Bohan Zhuang

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

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) have recently expanded from static image understanding to video reasoning, but their scalability is fundamentally limited by the quadratic cost of processing dense frame sequences. Long videos often exceed the…

Computer Vision and Pattern Recognition · Computer Science 2025-10-17 Natan Bagrov , Eugene Khvedchenia , Borys Tymchenko , Shay Aharon , Lior Kadoch , Tomer Keren , Ofri Masad , Yonatan Geifman , Ran Zilberstein , Tuomas Rintamaki , Matthieu Le , Andrew Tao

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

Scaling the input image resolution is essential for enhancing the performance of Vision Language Models (VLMs), particularly in text-rich image understanding tasks. However, popular visual encoders such as ViTs become inefficient at high…

Computer Vision and Pattern Recognition · Computer Science 2025-05-19 Pavan Kumar Anasosalu Vasu , Fartash Faghri , Chun-Liang Li , Cem Koc , Nate True , Albert Antony , Gokul Santhanam , James Gabriel , Peter Grasch , Oncel Tuzel , Hadi Pouransari

Multimodal large language models (MLLMs) enhance their perceptual capabilities by integrating visual and textual information. However, processing the massive number of visual tokens incurs a significant computational cost. Existing analysis…

Computer Vision and Pattern Recognition · Computer Science 2024-12-31 Jiedong Zhuang , Lu Lu , Ming Dai , Rui Hu , Jian Chen , Qiang Liu , Haoji Hu

Large Multimodal Models (LMMs) excel in visual-language tasks by leveraging numerous visual tokens for fine-grained visual information, but this token redundancy results in significant computational costs. Previous research aimed at…

Computer Vision and Pattern Recognition · Computer Science 2025-09-12 Sihan Yang , Runsen Xu , Chenhang Cui , Tai Wang , Dahua Lin , Jiangmiao Pang

Recent Multimodal Large Language Models(MLLMs) often use a large number of visual tokens to compensate their visual shortcoming, leading to excessive computation and obvious visual redundancy. In this paper, we investigate what kind of…

Computer Vision and Pattern Recognition · Computer Science 2025-01-07 Yutao Jiang , Qiong Wu , Wenhao Lin , Wei Yu , Yiyi Zhou

Recent advancements in vision-language models (VLMs) have expanded their potential for real-world applications, enabling these models to perform complex reasoning on images. In the widely used fully autoregressive transformer-based models…

Computer Vision and Pattern Recognition · Computer Science 2024-10-21 Yuxin Wen , Qingqing Cao , Qichen Fu , Sachin Mehta , Mahyar Najibi

Visual token pruning reduces the computational cost of Vision-Language Models (VLMs) by removing redundant visual tokens. Existing methods typically rely on Gumbel-Softmax to approximate discrete selection during training. However, the…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Landi He , Mingde Yao , Shawn Young , Lijian Xu

In large vision-language models, visual tokens typically constitute the majority of input tokens, leading to substantial computational overhead. To address this, recent studies have explored pruning redundant or less informative visual…

Computer Vision and Pattern Recognition · Computer Science 2026-05-14 Sangin Lee , Yukyung Choi

Large Vision-Language Models (LVLMs) process multimodal inputs consisting of text tokens and vision tokens extracted from images or videos. Due to the rich visual information, a single image can generate thousands of vision tokens, leading…

Computer Vision and Pattern Recognition · Computer Science 2025-09-03 Zicong Tang , Ziyang Ma , Suqing Wang , Zuchao Li , Lefei Zhang , Hai Zhao , Yun Li , Qianren Wang

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

The rapid success of Vision Large Language Models (VLLMs) often depends on the high-resolution images with abundant visual tokens, which hinders training and deployment efficiency. Current training-free visual token compression methods…

Computer Vision and Pattern Recognition · Computer Science 2025-02-27 Jianjian Li , Junquan Fan , Feng Tang , Gang Huang , Shitao Zhu , Songlin Liu , Nian Xie , Wulong Liu , Yong Liao

Vision-Language Models (VLMs) leverage aligned visual encoders to transform images into visual tokens, allowing them to be processed similarly to text by the backbone large language model (LLM). This unified input paradigm enables VLMs to…

Computer Vision and Pattern Recognition · Computer Science 2025-03-18 Bangzheng Li , Fei Wang , Wenxuan Zhou , Nan Xu , Ben Zhou , Sheng Zhang , Hoifung Poon , Muhao Chen

Vision-Language Models (VLMs) excel across diverse tasks but suffer from high inference costs in time and memory. Token sparsity mitigates inefficiencies in token usage, while neuron sparsity reduces high-dimensional computations, both…

Machine Learning · Computer Science 2025-05-27 Qinsi Wang , Hancheng Ye , Ming-Yu Chung , Yudong Liu , Yueqian Lin , Martin Kuo , Mingyuan Ma , Jianyi Zhang , Yiran Chen

Visual tokens dominate inference cost in vision-language models (VLMs), yet many carry redundant information. Existing pruning methods alleviate this but typically rely on attention magnitude or similarity scores. We reformulate visual…

Computer Vision and Pattern Recognition · Computer Science 2026-03-10 Landi He , Xiaoyu Yang , Lijian Xu

Recently, reducing redundant visual tokens in vision-language models (VLMs) to accelerate VLM inference has emerged as a hot topic. However, most existing methods rely on heuristics constructed based on inter-visual-token similarity or…

Computer Vision and Pattern Recognition · Computer Science 2026-05-15 Haokui Zhang , Congyang Ou , Dawei Yan , Peng Wang , Qingsen Yan , Yu Zhang , Ying Li , Rong Xiao