AdaReTaKe: Adaptive Redundancy Reduction to Perceive Longer for Video-language Understanding (2025.findings-acl)
Copied to clipboard
| Challenge: | Multimodal Large Language Models (MLLMs) are limited by context length when processing long videos. |
| Approach: | They propose a training-free method that flexibly reduces redundancy by allocating compression ratios among time and model layers with theoretical guarantees. |
| Outcome: | Experiments on videoMME, MLVU, LongVideoBench, and LVBench show that AdaRETAKE outperforms existing methods by 2.3% and 2.8% for 7B and 72B models. |
Similar Papers
ProLongVid: A Simple but Strong Baseline for Long-context Video Instruction Tuning (2025.emnlp-main)
Copied to clipboard
Rui Wang, Bohao Li, Xiyang Dai, Jianwei Yang, Yi-Ling Chen, Zhen Xing, Yifan Yang, Dongdong Chen, Xipeng Qiu, Zuxuan Wu, Yu-Gang Jiang
| Challenge: | Existing approaches to adapt image-focused models for video understanding have not been successful in analyzing long video sequences. |
| Approach: | They propose a video instruction dataset that outperforms existing video instruction data for fine-tuning MLLMs by incrementally increasing input context length. |
| Outcome: | The proposed model outperforms existing models on video benchmarks and outperformed proprietary models on VideoMME even with a compact 7B model. |
PruneVid: Visual Token Pruning for Efficient Video Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to video token pruning face significant computational challenges due to the redundancy inherent in video data. |
| Approach: | They propose a training-free visual token pruning method that reduces the redundancy inherent in video data and leverages LLMs’ inherent ability to selectively prune visual tokens irrelevant to specific queries. |
| Outcome: | The proposed method can prune over 80% of tokens while maintaining competitive performance when combined with different video LLMs. |
D-CoDe: Scaling Image-Pretrained VLMs to Video via Dynamic Compression and Question Decomposition (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing training-free adaptation frameworks for video large language models are limited by the scarcity of high-quality video-text data. |
| Approach: | They propose a training-free adaptation framework that incorporates dynamic compression and question decomposition to address perception bottleneck and token overload. |
| Outcome: | The proposed framework improves video understanding across various benchmarks and on long-video benchmarks. |
RedundancyLens: Revealing and Exploiting Visual Token Processing Redundancy for Efficient Decoder-Only MLLMs (2025.findings-acl)
Copied to clipboard
| Challenge: | Current decoder-only architectures achieve higher performance but lower efficiency . cross-attention-based architectures skip visual token computations . |
| Approach: | They propose a training-free framework for analyzing trained MLLMs to investigate redundancy . they propose 'probe-activated Dynamic FFN and Hollow Attention' algorithms for visual token reductions and a layer ranking algorithm for inference acceleration. |
| Outcome: | The proposed framework achieves comparable performance to or better than state-of-the-art methods while remaining compatible with them. |
From Inheritance to Saturation: Disentangling the Evolution of Visual Redundancy for Architecture-Aware MLLM Inference Acceleration (2026.acl-long)
Copied to clipboard
| Challenge: | Existing acceleration strategies suffer from severe "backbone dependency" Existing strategies such as token pruning or layer sparsity suffer from this . |
| Approach: | They propose a framework that decouples visual redundancy into IVR and architecture-dependent secondary saturation redundancies. |
| Outcome: | The proposed framework outperforms existing frameworks on Qwen25-VL and Qwa25-LL. |
Reducing Token Redundancy in LVLMs: A Systematic Review of Token Pruning Methods (2026.acl-long)
Copied to clipboard
| Challenge: | Large Vision-Language Models (LVLMs) excel at visual understanding but face severe computational bottlenecks when processing high-resolution images and long videos due to massive visual token counts. |
| Approach: | They propose a taxonomy categorizing methods into vision-side, LLM-side and hybrid paradigms and analyze token selection mechanisms and pruning strategy. |
| Outcome: | The proposed method selectively removes less informative tokens while maintaining performance. |
Sharper and Faster mean Better: Towards More Efficient Vision-Language Model for Hour-scale Long Video Understanding (2025.acl-long)
Copied to clipboard
| Challenge: | Existing multimodal large language models (LLMs) have shown impressive performance on the video understanding task, but extremely long videos still pose significant challenges to their context length, memory consumption, and computational complexity. |
| Approach: | They propose a vision-language model named Sophia for long video understanding which can efficiently handle hour-scale long videos. |
| Outcome: | The proposed model exhibits competitive performance compared to existing video understanding baselines across various benchmarks for long video understanding with reduced time and memory consumption. |
RaP: Redundancy-aware Video-language Pre-training for Text-Video Retrieval (2022.findings-emnlp)
Copied to clipboard
| Challenge: | sparse sampling of videos suffers from inter-modal redundancy and visual redundancies . et al., 2021) proposes to sparsestly sample frames from videos to alleviate temporal redundance . |
| Approach: | They propose to use sparse sampling to alleviate temporal redundancy in videos . they propose to penalize high-redundant video patches and text tokens . |
| Outcome: | The proposed method improves on four benchmark datasets. |
Vista-LLM: Decoupled Query-Guided Visual Token Pruning for Efficient Long-Video Large Language Models (2026.acl-long)
Copied to clipboard
| Challenge: | Long-video understanding is bottlenecked by the high cost of processing massive visual tokens. |
| Approach: | They propose a decoupled framework for query-guided visual token pruning . their method reduces visual tokens by 90% and accelerates inference by 98% . |
| Outcome: | The proposed framework reduces visual tokens by 90% and accelerates inference while retaining over 98% of baseline performance on average. |
Reducing Peak Memory Usage for Modern Multimodal Large Language Model Pipelines (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to reduce memory usage of multimodal large language models rely on storing large numbers of vision tokens in the key–value cache . however, such compression is typically only applied after all inputs are processed, resulting in high peak memory usage during the prefill stage. |
| Approach: | They propose a sequential input-compression mechanism that enforces a fixed memory budget by performing structure-aware key–value cache compression during the prefill stage. |
| Outcome: | The proposed approach reduces peak memory usage while maintaining generative performance with only minimal degradation, enabling more practical and memory-efficient multimodal inference. |