Skip to content

Look Less, Think Faster: Joint Token-Compute Adaptation for Multimodal LLMs

Jul 2026 · arXiv.org · Vol abs/2607.20357 · 0 citations · 45 references
Computer Science

TL;DR

SmartVL is proposed, a unified adaptive inference framework that jointly controls vision token number and model compute capability in response to varying input contents and compute budgets and consistently outperforms prior adaptive methods and achieves superior accuracy-efficiency Pareto frontiers.

Abstract

Multimodal Large Language Models (MLLMs) have recently demonstrated strong performance across vision-language tasks. However, their high inference cost, arising from both the large number of input visual tokens and the heavy computation of the large language model (LLM), remains a key barrier to practical deployment. Recent work attempts to reduce the cost by adaptively optimizing individual dimensions, e.g., pruning redundant visual tokens or skipping LLM layers and heads. Nonetheless, prior approaches typically treat these dimensions independently and overlook a fundamental coupling: the available compute resources must be dynamically allocated across all dimensions based on the input content. To bridge the gap, we propose SmartVL, a unified adaptive inference framework that jointly controls vision token number and model compute capability in response to varying input contents and compute budgets. SmartVL introduces a vision-side token controller that dynamically selects informative visual tokens and an LLM-side compute controller that adaptively adjusts LLM computation. Importantly, these controllers are trained to coordinate with each other so that the overall inference cost satisfies a target budget. To allow this joint scheduling, we connect the controllers using a shared budget encoding and leverage a differentiable latency estimator for end-to-end training. This design enables SmartVL to learn cross-stage allocation strategies that adapt to both input complexity and runtime compute constraints. Experiments across multiple MLLM benchmarks demonstrate that, with joint scheduling, SmartVL consistently outperforms prior adaptive methods and achieves superior accuracy-efficiency Pareto frontiers. Project page: https://www.schaterji.io/publications/2026/jointtokencompute.

View source

Similar papers

Jul 2026

Attention-Free and Lightweight Token Reduction for Efficient Vision-Language Models

An attention-free and lightweight token reduction framework as a plug-and-play module for VLMs, which preserves both important and diverse tokens to produce a compact visual representation, and achieves a favorable accuracy-efficiency trade-off.

Xuanyi Hao, Zuoyuan Zhang, Zhibo Wang et al. · 0 citations
Preprint Aug 2026

ParVL: Parallel Scaling and Expandable Compute Allocation for Multimodal LLMs

Existing scaling strategies for Multimodal Large Language Models (MLLMs) typically expand either model parameters or sequential inference computation, incurring substantial memory or latency overhead. More importantly, most existing methods fail to alter the rigid, fixed computation allocation between the Vision Transf...

Yang Yang, Qinyu Zhao, Mou-Xiang Chen et al. · 0 citations
Jul 2026

Capturing Token Tendencies for Training-Free Token Pruning in Multimodal Large Language Models

Trend-aware Pruning is proposed, a novel framework that elevates pruning from a local snapshot decision to a temporal trajectory modeling problem, and enables a dynamic rectification mechanism that selectively reactivates "late-blooming" tokens, those initially undervalued but exhibiting rising semantic importance, the...

Jie Ma, Zhike Qiu, Jie Gao et al. · 0 citations
#small language model Preprint Aug 2026

Not All Attention Heads Contribute to Critical Visual Token Selection: Head-Aware Pruning Matters More

ProViP is proposed, a training-free progressive visual token pruning framework that removes redundant visual tokens based on the embedding similarity of input tokens before reasoning of the LLM backbone, and then prunes tokens during reasoning via head-aware pruning.

Chao-Fang Ma, Lin Jiang, Carol Jingyi Li et al. · 1 citation
#computer vision Preprint Aug 2026

PACE: A Unified Condense-and-Extract Paradigm for Fast VLM Inference

PACE (Pixel-Adaptive Condense and Extract), a training-free inference framework that accelerates both the vision encoder and the Large Language Model (LLM) via a unified Condense-and-Extract paradigm, is proposed.

Jun-Jie Liu, Shengyuan Ye, Xu Chen · 0 citations
Jul 2026

GOTS: Greedy Orthogonal Token Selection for High-Resolution Vision-Language Models

This work proposes Greedy Orthogonal Token Selection (GOTS), a training-free and query-agnostic method that achieves higher average performance retention than the strongest evaluated baselines, and a controlled OCRBench study shows that it reduces model-side time-to-first-token after accounting for selection overhead.

Jun Ling, Tao Huang, Junzhuo Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.