- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes Reroute, a training-free, recoverable visual token routing method that addresses the loss of important visual information caused by irreversible token removal in existing visual token pruning methods. Reroute retains the importance-scoring mechanisms of existing pruning methods but replaces permanent token removal with stage-wise routing: unselected visual tokens bypass the current computation stage and re-enter the candidate pool at later stages. Experiments on multiple VLM backbones, including LLaVA-1.5, Qwen2.5-VL, and Qwen3.5, show that Reroute improves general VQA and visual grounding performance under aggressive token reduction in most evaluated settings, while preserving most of the computational efficiency gains.
Critical strengths
S1. This paper presents a simple and practically useful approach by addressing the irreversibility of existing visual token pruning methods. Reroute requires no additional training or redesign of the importance scorer and can be directly integrated with existing pruning methods, making it easy to implement.
S2. Reroute can substantially improve visual grounding performance under certain aggressive token reduction settings while retaining most of the computational efficiency benefits.
Critical weaknesses
W1. Limited methodological novelty. Although the authors discuss the relationship between Reroute and MoD in Section 4.4, their core computational mechanisms are largely similar. Reroute mainly replaces the learnable router with importance scores from existing pruning methods and adopts or modifies their stage-wise schedules. However, these modifications appear to be straightforward combinations and adaptations of existing techniques rather than genuinely novel algorithmic designs.
W2. The central hypothesis of this paper is that visual token importance changes across decoder depth, causing early pruning decisions to mistakenly remove tokens that may become important in later layers. However, Figure 2 mainly presents a few qualitative examples, without systematic quantitative analysis of cross-layer importance changes.
W3. We observe that FastV and PDrop exhibit nearly collapsed visual grounding performance under aggressive token reduction, while Reroute is primarily evaluated against these two methods and demonstrates substantial improvements. However, for Nüwa, which already achieves relatively strong grounding performance, the additional gains from Reroute in Table 1(a) are very limited, with slight performance degradation in some settings. Furthermore, although Table 12 includes results from other methods, it only reports the integration of Reroute with Nüwa, lacking systematic evaluation across a broader range of token reduction strategies.
W4. To improve the clarity and comparability of the experimental results, we suggest using consistent RefCOCO evaluation splits throughout the paper.
W5. Appendix Table 18 shows that Reroute degrades visual grounding performance on Qwen3-VL-8B at both 66.7% and 77.8% token reduction, with substantial drops in some cases. The explanation in Appendix C.3 remains largely speculative without supporting experimental evidence, leaving the applicability of Reroute across different model architectures and token reduction levels unclear.
Questions for authors
Please also address the concerns raised in W1–W5.
Q1. Existing visual token pruning methods handle low-importance tokens through either token dropping or token merging. In merging-based methods, information from compressed tokens is already partially preserved in the remaining tokens. Is Reroute still applicable to such methods? From this perspective, the rank-and-remove paradigm does not fully characterize existing pruning methods. Since both Reroute and token merging aim to preserve information from compressed tokens, what advantages does Reroute offer over token merging? We encourage the authors to provide further discussion or experimental comparisons.