TIGER: Text-Conditioned Visual Gated Routing with Acceptance Alignment for Multimodal Speculative Decoding
- URL: http://arxiv.org/abs/2607.11131v1
- Date: Mon, 13 Jul 2026 06:06:27 GMT
- Title: TIGER: Text-Conditioned Visual Gated Routing with Acceptance Alignment for Multimodal Speculative Decoding
- Abstract summary: Speculative decoding accelerates autoregressive generation by letting a drafter propose multiple tokens that are verified by a larger target model.<n>We propose TIGER, a Text-conditioned vIsual GatEd framework for multimodal speculative decoding.<n>We show TIGER yields consistent gains in accepted prefix length and speculative speedup under exact verifier-side speculative decoding.
- Score: 8.451420931444215
- License: http://creativecommons.org/licenses/by-sa/4.0/
- Abstract: Speculative decoding accelerates autoregressive generation by letting a lightweight drafter propose multiple tokens that are verified by a larger target model. Although effective for text-only LLMs, speculative decoding yields limited gains in VLMs because drafters often diverge on vision-critical content, while existing multimodal acceleration methods do not directly address irrelevant visual evidence or optimize the verifier-accepted prefix length that governs speedup. We propose TIGER, a Text-conditioned vIsual GatEd Routing framework for multimodal speculative decoding. TIGER dynamically selects a sparse set of context-relevant visual tokens based on the drafter's current textual state, rather than expose the full visual token set or a fixed compressed interface. To better align training with inference-time efficiency, we optimize the drafter with acceptance-aligned group-based policy training using verifier-derived rewards based on accepted prefix length, built on top of distillation warm start with KL anchoring. This encourages the drafter not only to imitate the target model, but also to produce speculative continuations that survive verification for longer prefixes. Experiments show that TIGER yields consistent gains in accepted prefix length and speculative speedup under exact verifier-side speculative decoding, while achieving favorable quality-latency trade-offs with comparable downstream accuracy in visual-routing analyses.
Related papers
- FOVEA: Focused On-Demand Visual Evidence Adaptation for Cache-Friendly Multimodal Speculative Decoding [42.559533294854134]
Multimodal speculative decoding accelerates vision-language models by allowing a lightweight draft model to propose candidate tokens for parallel verification by a larger target model.<n>Existing methods typically condition the drafter on a fixed visual interface, such as a predefined visual-token budget or a static compressed representation.<n>We propose FOVEA, a cache-friendly approach that builds a reusable visual memory and dynamically retrieves a bounded subset for a draft state.
arXiv Detail & Related papers (2026-08-24T07:09:02Z) - Latent Visual States for Efficient Multimodal Reasoning [58.350643620457]
EVA (LatEnt Visual StAtes) is a novel framework that generates continuous latent visual representations.<n>These internal representations manifest as an adaptive sequence of Latent_slot tokens.<n> EVA achieves significant performance gains while enhancing inference efficiency.
arXiv Detail & Related papers (2026-06-23T07:22:22Z) - Reward-Guided Semantic Evolution for Test-time Adaptive Object Detection [82.2968697030677]
Open-vocabulary object detection with vision-language models (VLMs) such as Grounding DINO suffers from performance degradation under test-time distribution shifts.<n>We propose Reward-Guided Semantic Evolution (RGSE), a training-free framework that directly refines the text embeddings at test time.
arXiv Detail & Related papers (2026-05-06T06:17:41Z) - DIVERSED: Relaxed Speculative Decoding via Dynamic Ensemble Verification [29.426184837710952]
Speculative decoding is an effective technique for accelerating large language model inference by drafting multiple tokens in parallel.<n>We propose Dynamic Verification Relaxed Speculative Decoding (DIVERSED), a relaxed verification framework that improves time efficiency while preserving generation quality.<n>We demonstrate that DIVERSED achieves substantially higher inference efficiency compared to standard speculative decoding methods.
arXiv Detail & Related papers (2026-04-08T21:52:32Z) - Training-Free Acceleration for Document Parsing Vision-Language Model with Hierarchical Speculative Decoding [102.88996030431662]
We propose a training-free and highly efficient acceleration method for document parsing tasks.<n>Inspired by speculative decoding, we employ a lightweight document parsing pipeline as a draft model to predict batches of future tokens.<n>We demonstrate the effectiveness of our approach on the general-purpose OmniDocBench.
arXiv Detail & Related papers (2026-02-13T14:22:10Z) - Steering Pretrained Drafters during Speculative Decoding [32.75269650141292]
Speculative decoding accelerates language model inference by separating generation into fast drafting and parallel verification.<n>Its main limitation is drafter-verifier misalignment, which limits token acceptance and reduces overall effectiveness.<n>We introduce a lightweight dynamic alignment mechanism: a steering vector computed from the verifier's hidden states and injected into the pretrained drafter.<n>Our approach boosts the number of accepted tokens by up to 35% under standard sampling and 22% under greedy sampling, all while incurring negligible computational overhead.
arXiv Detail & Related papers (2025-11-13T00:58:32Z) - DynaSpec: Context-aware Dynamic Speculative Sampling for Large-Vocabulary Language Models [13.242009624334996]
DynaSpec is a dynamic shortlisting mechanism that is robust, speeds up drafting, and generalizes across diverse tasks.<n>It delivers consistent improvements in mean accepted length, for Llama-3-8B, reaching upto 98.2% of full-vocabulary performance.<n>By leveraging context-dependent selection, DynaSpec achieves up to a 2.18 times increase in generated tokens compared to 1.91 times for fixed-vocabulary approaches.
arXiv Detail & Related papers (2025-10-11T19:38:07Z) - DiffuSpec: Unlocking Diffusion Language Models for Speculative Decoding [66.40658898418316]
We present DiffuSpec, a training-free drop-in framework that uses a pretrained diffusion language model (DLM) to produce multi-token drafts in a single forward pass.<n>Across benchmarks, DiffuSpec yields up to 3x wall-clock speedup, establishing diffusion-based drafting as a robust alternative to autoregressive drafters for speculative decoding.
arXiv Detail & Related papers (2025-09-28T07:00:15Z) - Think Before You Accept: Semantic Reflective Verification for Faster Speculative Decoding [48.52389201779425]
Speculative decoding accelerates inference by generating multiple draft tokens using a lightweight model and verifying them in parallel.<n>Existing verification methods rely heavily on distributional consistency while overlooking semantic correctness.<n>We propose Reflective Verification, a training-free and semantics-aware approach that achieves a better trade-off between correctness and efficiency.
arXiv Detail & Related papers (2025-05-24T10:26:27Z) - BanditSpec: Adaptive Speculative Decoding via Bandit Algorithms [101.9736063064503]
Speculative decoding has emerged as a popular method to accelerate the inference of Large Language Models (LLMs)<n>This paper proposes a training-free online learning framework to adaptively choose the configuration of the hyper parameters for speculative decoding as text is being generated.
arXiv Detail & Related papers (2025-05-21T05:56:31Z) - Ouroboros: Generating Longer Drafts Phrase by Phrase for Faster Speculative Decoding [65.94521678103237]
Speculative decoding is a widely used method that accelerates the generation process of large language models.
We introduce Ouroboros, which can generate draft phrases to parallelize the drafting process.
Ouroboros can achieve speedups of up to $2.8times$ over speculative decoding and $3.9times$ over vanilla decoding.
arXiv Detail & Related papers (2024-02-21T11:31:28Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.