- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies training-free visual token compression for efficient VLLMs. It addresses the limitations of existing token compression methods that overlook cross-frame complementarity and consequently retain redundant visual evidence. It proposes GleanVID, which combines Temporal Novelty-Guided Budgeting with Complementary Token Selection based on local representativeness and subspace-level cross-frame complementarity. Experiments on Qwen3-VL-8B-Instruct show that GleanVID preserves 98.6% of the original performance with 25% of visual tokens while reducing prefill latency by 44.7%.
Critical strengths
GleanVID is training-free and does not require access to attention weights, making it compatible with different VideoLLM architectures.
The method achieves competitive performance across three VideoLLMs and four video understanding benchmarks, particularly under tighter token budgets.
The paper provides component ablations and additional analyses to investigate the proposed design and its performance-efficiency tradeoff.
Critical weaknesses
The related work discussion overlooks several relevant VideoLLM token compression methods. STTM[1] exploits spatial and temporal redundancy through token merging, while MeToM[2] and DyToK[3] investigate adaptive frame-level token allocation. AOT[4] further explores local and global context aggregation. This paper should discuss how GleanVID differs from these methods and consider comparisons with representative approaches under matched settings.
The distinction and advantages of subspace-level complementarity over existing set-aware and diversity-driven token selection methods remain insufficiently validated. Although MMG-Vid [5] is cited in the related work, it is not included in the experimental comparisons. Other relevant methods, such as FLoC [6] and CDPruner [7], are also omitted. FLoC selects representative and diverse tokens using a facility location objective, while CDPruner employs DPP-based selection to maximize conditional diversity. However, Table 6(b) only compares SCS with a pairwise-distance criterion. This paper should further clarify the advantages of subspace-level complementarity over these alternative formulations and provide direct comparisons under matched evaluation settings.
The motivation does not sufficiently establish that subspace-level complementarity corresponds to task-relevant evidence. Repeated spatial regions may contain distinct temporal information, while a small projection residual does not necessarily imply that a token is irrelevant to downstream reasoning. Although Appendix C.4 analyzes Effective Rank, Cross-Frame Residual Energy, and Coverage Error, it does not directly establish how these geometric properties relate to task-specific prediction accuracy. This paper should investigate this relationship on tasks involving repeated actions, event counting, and subtle state changes.
The relationship between TNB and CTS requires further investigation. TNB estimates temporal novelty using historical neighborhood prototypes from preceding frames, whereas CTS measures complementarity against previously retained tokens (Eqs. 4 and 9). Consequently, a frame may receive a smaller token budget because similar content appeared earlier, even if that content was not retained. This paper should investigate whether such cases lead to insufficient token allocation and degraded downstream performance.
The temporal novelty estimation in TNB relies on historical neighborhood prototypes at corresponding spatial locations (Eq. 4), which may be sensitive to object and camera motion. Although the proposed 2 × 2 neighborhood pooling can mitigate small spatial shifts, it does not explicitly account for larger displacements across frames. This may cause TNB to allocate fewer tokens to frames containing visual evidence that appeared earlier but was not retained by CTS. This paper should further investigate the robustness of TNB under substantial object motion and camera movement, and examine their effects on frame-budget allocation and downstream performance.
The evaluation of the performance-efficiency tradeoff is incomplete, particularly for longer video inputs. In Table 4, GleanVID improves VideoMME over V-CAST by only 0.1 point while increasing prefill latency from 121.2s to 132.6s, with nearly identical total latency and throughput. Moreover, efficiency is only evaluated with 32 frames at a 25% retention ratio. According to Appendix B.2 and B.3, the default use of all preceding frames introduces a history-dependent computational cost that grows with the number of input frames. Tables 1 and 3 report accuracy with up to 64 input frames, while Table 7 further evaluates 80 and 160 frames under a fixed LLM-side visual-token budget. However, the corresponding runtime efficiency is not reported. Additional efficiency evaluations across different frame counts and retention ratios are needed to establish the scalability and practical advantages of GleanVID.
The qualitative analysis lacks direct visualizations of retained visual tokens. Figure 3 shows frame-level budget allocation, while Figure 5 presents video question answering examples. Neither figure illustrates which spatial tokens are selected across consecutive frames. Visual comparisons with VidCom² and V-CAST would help demonstrate how GleanVID reduces cross-frame redundancy and preserves complementary visual evidence.
[1] Hyun, Jeongseok, et al. "Multi-granular spatio-temporal token merging for training-free acceleration of video llms." ICCV 2025.
[2] Wu, Zhuojie, et al. "MeToM: Metadata-Guided Token Merging for Efficient Video LLMs." CVPR 2026.
[3] Li, Yulin, et al. "Less is more, but where? dynamic token compression via llm-guided keyframe prior." NeurIPS 2025.
[4] Li, Jinlong, et al. "Token reduction via local and global contexts optimization for efficient video large language models." CVPR 2026.
[5] Ma, Junpeng, et al. "Mmg-vid: Maximizing marginal gains at segment-level and token-level for efficient video llms." AAAI 2026.
[6] Cho, Janghoon, et al. "Floc: Facility location-based efficient visual token compression for long video understanding." ICLR 2026.
[7] Zhang, Qizhe, et al. "Beyond attention or similarity: Maximizing conditional diversity for token pruning in mllms." NeurIPS 2025.
Questions for authors
Plz refer to the weaknesses.