- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes QPrune, a quantum-inspired visual token pruning method for multimodal large language models , aiming to reduce the number of visual tokens during the decoding stage while preserving the model’s multimodal understanding ability as much as possible. The method consists of three core modules: Mixed-State Representation, which measures the contribution of visual tokens through quantum-inspired state representations (the authors claim it is based on image-text pairs); State-Aware Token Pruning, which combines token contributions and inter-token overlap to balance information retention and redundancy control; and State-Preserving Token Refinement, which supplements local details potentially missed during the main pruning stage. The authors achieve good results on multiple datasets based on the LLaVA-1.5-7B and LLaVA-NeXT-7B architectures.
Critical strengths
S1. The method is logically sound. QPrune considers the relevance between visual tokens and question text, token contributions, and inter-token information overlap. It also uses a refinement stage to recover omitted local details.
S2. The experiments show good compression and performance retention. The authors achieve good results across multiple datasets on LLaVA-1.5-7B and LLaVA-NeXT-7B, particularly maintaining relatively high performance under high compression ratios with LLaVA-NeXT-7B.
Critical weaknesses
W1. The unique contribution of the quantum-inspired representation is unclear.
The method represents visual tokens as states, constructs mixed states using probability weights, and measures token contributions based on relationships between states. However, the actual computation combines weights from text-visual semantic responses and visual attention, then selects tokens based on the resulting token probabilities and inter-token similarities. The authors should clarify its advantages over conventional similarity-based token selection (e.g., weighted similarity with greedy redundancy reduction). If the final computation is essentially equivalent to conventional similarity or its squared transformation, the quantum-inspired formulation may not constitute a sufficiently strong methodological contribution.
W2. Key algorithmic steps are unclear.
For example, Section 3.2 describes dynamic Residual Score updates without providing the update formula. Similarly, Section 3.1 and Appendix A.2 do not specify the exact form of the entropy-to-budget mapping function (\gamma(H(p))). These missing details affect Token Selection, Budget Allocation, and reproducibility. The authors should provide the update rules, budget mapping function, and relevant hyperparameters. I suggest including pseudocode to describe the method precisely.
W3. The benefits of adaptive budget allocation are limited, and evidence of stability is insufficient.
In the ablation study (Table 7), adaptive budget allocation achieves an average score of 55.34, compared with 55.10 for a fixed 20% refinement budget, a difference of only 0.24. This result is insufficient to demonstrate a stable and significant advantage of the adaptive strategy. The authors should further evaluate it under different compression ratios and model settings.
W4. Comparison with strong baselines is insufficient.
The evaluation could be strengthened by including stronger baselines, such as ApET (CVPR 2026), AgilePruner (ICLR 2026), and TransPrune (CVPR 2026), as well as additional datasets such as MME, VizWiz, AI2D and SEED.
W5. Cross-architecture generalization is insufficiently validated.
QPrune is evaluated only on LLaVA-1.5-7B and LLaVA-NeXT-7B, both from the LLaVA family. Moreover, its reliance on Global Visual Token Attention raises questions about its applicability to different vision encoders (Qwen-VL/InternVL).
Questions for authors
Q1. Practical Contribution of the Quantum-Inspired Representation
What are the unique advantages of the Quantum-inspired Mixed-state Representation over conventional normalized features and cosine similarity? Would replacing it with conventional similarity computation affect token selection or model performance?
Q2. Is Question–Image Token Similarity Sufficient to Guide Pruning?
Does the text–vision relevance score reliably identify the visual evidence needed to answer a question, particularly for complex relationships, attribute binding, counting, OCR, and multi-step reasoning?
Q3. Mathematical Definitions of Key Algorithms
The Residual Score update formula in Section 3.2 and the budget mapping function in Section 3.1 are not clearly specified. Could the authors provide their explicit mathematical definitions and parameter settings?
Q4. Effectiveness of Adaptive Budget Allocation
How stable are the performance gains of adaptive budget allocation across different token retention ratios compared with fixed budget allocation? Additional experimental results would help validate its effectiveness.
Q5. Comparison with Stronger Baselines and More Datasets
The evaluation would benefit from comparisons with recent token pruning methods, such as ApET, AgilePruner, and TransPrune, under the same token budgets and experimental settings.
Q6. Cross-Architecture Generalization
Does the Vision Encoder Attention-based probability estimation generalize to different vision encoders? Validation on non-LLaVA architectures, such as Qwen-VL or InternVL, would help establish the method's generalizability.