- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes LCHTP, a training-free two-stage visual token pruning method for MLLMs. To preserve spatially distributed evidence, LCHTP selects tokens within each region before the LLM, merging the discarded tokens into the retained ones. It then prunes visual tokens at an intermediate decoder layer using the query averaged over the instruction.
Critical strengths
LCHTP outperforms existing methods consistently across image and video MLLMs over a wide range of token budgets. The advantage remains under aggressive pruning, where several methods degrade sharply.
Critical weaknesses
W1. Limited novelty of the analysis and the method.
- The analysis restates findings reported in prior work. For the vision encoder, Fig. 2 of VScan already shows the shift from local to global attention across the encoder depth (Fig. 2). The benefit of distributing the budget over regions (Fig. 5) is also the premise of HiRED [A] and HoloV [B].
For the language decoder, the analysis in Fig. 3 differs little from that in prior work.
- (Left) The positional bias of the attention in shallow layers is widely known, for example, from Fig. 3 of VScan [C].
- (Middle) The logit lens analysis follows a protocol similar to that in Fig. 4 of VScan [C].
- (Right) The difference between the two queries looks marginal.
- The method combines existing components with minor modifications. It adopts the budget allocation over windows from HoloV and the two-stage design from VScan [C].
- The two-stage schedule keeps more tokens in the early layers of the LLM and fewer in the deeper layers, favoring the method over the single-stage baselines. Thus, the comparison should include recent two-stage methods such as VScan [C], Nüwa [D], and VisionTrim [E].
W2. Assumptions and error terms.
- The theoretical analysis rests on several assumptions and bounds the logit perturbation through error terms that accumulate over the two pruning stages. This paper, however, reports no measured value for these constants and error terms, leaving unclear whether the assumptions hold and whether the error terms are small enough for the bounds to be informative in actual MLLMs. Reporting measurable quantities would make the theoretical analysis more convincing. For example,
- Eq. (80) states that the prediction is preserved when the logit margin of the unpruned model exceeds twice the bound on the logit perturbation. Both the margin and the actual perturbation are directly measurable.
- The total discarded influence in Eq. (59) is bounded by , which is informative only when , since the influence weights sum to one.
[A] HiRED: Attention-Guided Token Dropping for Efficient Inference of High-Resolution Vision-Language Models, AAAI 2025
[B] Don't Just Chase "Highlighted Tokens" in MLLMs: Revisiting Visual Holistic Context Retention, NeurIPS 2025
[C] VScan: Rethinking Visual Token Reduction for Efficient Large Vision-Language Models, TMLR 2026
[D] Nüwa: Mending the Spatial Integrity Torn by VLM Token Pruning, ICLR 2026
[E] VisionTrim: Unified Vision Token Compression for Training-Free MLLM Acceleration, ICLR 2026
Questions for authors
Please see weaknesses.
There seems no rebuttal submitted. Thus, I will keep my original rating.