English
Related papers

Related papers: ParallelVLM: Lossless Video-LLM Acceleration with …

200 papers

Speculative decoding is widely used in accelerating large language model (LLM) inference. In this work, we focus on the online draft model selection problem in speculative decoding. We design an algorithm that provably competes with the…

Machine Learning · Computer Science 2026-04-24 Hongyi Liu , Jiaji Huang , Zhen Jia , Youngsuk Park , Yu-Xiang Wang

By treating visual tokens from visual encoders as text tokens, Multimodal Large Language Models (MLLMs) have achieved remarkable progress across diverse visual understanding tasks, leveraging the robust architectures of Large Language…

Computer Vision and Pattern Recognition · Computer Science 2024-12-03 Zeliang Zhang , Phu Pham , Wentian Zhao , Kun Wan , Yu-Jhe Li , Jianing Zhou , Daniel Miranda , Ajinkya Kale , Chenliang Xu

The rapid advancement of large language models (LLMs) has revolutionized code generation tasks across various programming languages. However, the unique characteristics of programming languages, particularly those like Verilog with specific…

Machine Learning · Computer Science 2025-03-19 Changran Xu , Yi Liu , Yunhao Zhou , Shan Huang , Ningyi Xu , Qiang Xu

Speculative decoding has emerged as a promising technique for large language model (LLM) inference by accelerating autoregressive decoding via draft-then-verify. This paper studies a new edge scenario with multi-user inference, where draft…

Information Theory · Computer Science 2026-04-24 Yaodan Xu , Sheng Zhou , Zhisheng Niu

Vision-Language Models (VLMs) are expensive because the LLM processes hundreds of largely redundant visual tokens. Existing token reduction methods typically exploit \textit{either} vision-encoder saliency (broad but query-agnostic)…

Computer Vision and Pattern Recognition · Computer Science 2026-02-03 Dhruv Parikh , Haoyang Fan , Rajgopal Kannan , Viktor Prasanna

Visual token pruning methods effectively mitigate the quadratic computational growth caused by processing high-resolution images and video frames in vision-language models (VLMs). However, existing approaches rely on predefined pruning…

Computer Vision and Pattern Recognition · Computer Science 2026-04-17 Huawei Ji , Yuanhao Sun , Yuan Jin , Cheng Deng , Jiaxin Ding , Luoyi Fu , Xinbing Wang

Vision-Language Models (VLMs) have achieved remarkable progress in multimodal reasoning and generation, yet their high computational demands remain a major challenge. Diffusion Vision-Language Models (DVLMs) are particularly attractive…

Computer Vision and Pattern Recognition · Computer Science 2025-11-18 Jingqi Xu , Jingxi Lu , Chenghao Li , Sreetama Sarkar , Souvik Kundu , Peter A. Beerel

RL post-training of frontier language models is increasingly bottlenecked by autoregressive rollout generation, making rollout acceleration a central systems challenge. Many existing efficiency methods improve throughput by changing the…

A well-known dilemma in large vision-language models (e.g., GPT-4, LLaVA) is that while increasing the number of vision tokens generally enhances visual understanding, it also significantly raises memory and computational costs, especially…

Computer Vision and Pattern Recognition · Computer Science 2024-08-30 Shiwei Wu , Joya Chen , Kevin Qinghong Lin , Qimeng Wang , Yan Gao , Qianli Xu , Tong Xu , Yao Hu , Enhong Chen , Mike Zheng Shou

Vision-language models (VLMs) can learn high-quality representations from a large-scale training dataset of image-text pairs. Prompt learning is a popular approach to fine-tuning VLM to adapt them to downstream tasks. Despite the satisfying…

Computer Vision and Pattern Recognition · Computer Science 2024-12-31 Zhifang Zhang , Yuwei Niu , Xin Liu , Beibei Li

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

We introduce ProVideLLM, an end-to-end framework for real-time procedural video understanding. ProVideLLM integrates a multimodal cache configured to store two types of tokens - verbalized text tokens, which provide compressed textual…

Computer Vision and Pattern Recognition · Computer Science 2025-04-22 Dibyadip Chatterjee , Edoardo Remelli , Yale Song , Bugra Tekin , Abhay Mittal , Bharat Bhatnagar , Necati Cihan Camgöz , Shreyas Hampali , Eric Sauser , Shugao Ma , Angela Yao , Fadime Sener

Token pruning has emerged as an effective approach to reduce the substantial computational overhead of Large Vision-Language Models (LVLMs) by discarding less informative visual tokens while preserving performance. However, existing methods…

Computer Vision and Pattern Recognition · Computer Science 2026-04-14 Kexin Ma , Jing Xiao , Chaofeng Chen , Geyong Min , Guibo Zhu , Jinqiao Wang , Liang Liao

Vision-language models (VLMs) excel at image understanding tasks, but the large number of visual tokens imposes significant computational costs, hindering deployment on mobile devices. Many pruning methods rely solely on token importance…

Computer Vision and Pattern Recognition · Computer Science 2026-02-27 Zhenkai Wu , Xiaowen Ma , Zhenliang Ni , Dengming Zhang , Han Shu , Xin Jiang , Xinghao Chen

Large Vision-Language Models (LVLMs) incur substantial inference costs due to the processing of a vast number of visual tokens. Existing methods typically struggle to model progressive visual token reduction as a multi-step decision process…

Computer Vision and Pattern Recognition · Computer Science 2026-03-17 Sihan Cao , Jianwei Zhang , Pengcheng Zheng , Jiaxin Yan , Caiyan Qin , Yalan Ye , Wei Dong , Peng Wang , Yang Yang , Chaoning Zhang

Autoregressive (AR) decoding is a major latency bottleneck for large language models. Speculative decoding (SD) accelerates AR by letting a drafter propose multi-token blocks that a verifier accepts or rejects. However, many SD systems…

Machine Learning · Computer Science 2025-10-08 Shrenik Bhansali , Larry Heck

Text generation with Large Language Models (LLMs) is known to be memory bound due to the combination of their auto-regressive nature, huge parameter counts, and limited memory bandwidths, often resulting in low token rates. Speculative…

Machine Learning · Computer Science 2024-05-15 Raghavv Goel , Mukul Gagrani , Wonseok Jeon , Junyoung Park , Mingu Lee , Christopher Lott

The Large Vision-Language Model (LVLM) has enhanced the performance of various downstream tasks in visual-language understanding. Most existing approaches encode images and videos into separate feature spaces, which are then fed as inputs…

Computer Vision and Pattern Recognition · Computer Science 2024-10-02 Bin Lin , Yang Ye , Bin Zhu , Jiaxi Cui , Munan Ning , Peng Jin , Li Yuan

In this paper, we introduce a simple training-free technique to improve the performance of drafter-based speculative decoding (SpD) methods that incorporates language modeling head (LM head) during drafting process. A drafter-based…

Computation and Language · Computer Science 2025-09-30 Raghavv Goel , Sudhanshu Agrawal , Mukul Gagrani , Junyoung Park , Yifan Zao , He Zhang , Tian Liu , Yiping Yang , Xin Yuan , Jiuyan Lu , Chris Lott , Mingu Lee

Inference with Multimodal Large Language Models (MLLMs) is slow due to their large-language-model backbone which suffers from memory bandwidth bottleneck and generates tokens auto-regressively. In this paper, we explore the application of…

Computation and Language · Computer Science 2024-04-16 Mukul Gagrani , Raghavv Goel , Wonseok Jeon , Junyoung Park , Mingu Lee , Christopher Lott