Challenge: Visualized Document Retrieval (VDR) uses large vision-language models to encode document pages into embeddings.
Approach: They evaluate methods to reduce patch embeddings per page while minimizing performance degradation.
Outcome: The proposed method maintains 98.2% of retrieval performance with only 11.8% of original memory usage and preserves 94.6% effectiveness at 2% memory footprint.

Similar Papers

Sculpting the Vector Space: Towards Efficient Multi-Vector Visual Document Retrieval via Prune-then-Merge Framework (2026.findings-acl)

Copied to clipboard

Challenge: Visual Document Retrieval (VDR) is of importance in multimodal retrieval applications.
Approach: They propose a two-stage pruning and merging frameworks that combine pruning and merge techniques to achieve higher compression rates.
Outcome: The proposed framework outperforms existing methods on 29 visual document retrieval 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.
PuMer: Pruning and Merging Tokens for Efficient Vision Language Models (2023.acl-long)

Copied to clipboard

Challenge: Large-scale vision language models use Transformers to perform cross-modal interactions . state-of-the-art models are memory intensive and expensive due to quadratic complexity .
Approach: They propose a token reduction framework that uses text-informed Pruning and modality-aware Merging strategies to progressively reduce the tokens of input image and text.
Outcome: The proposed framework improves inference speed and memory footprint on four vision language tasks.
Improving Visual-Semantic Embedding with Adaptive Pooling and Optimization Objective (2023.eacl-main)

Copied to clipboard

Challenge: Recent VSE models combine simple pooling methods with hard triplet loss to improve performance.
Approach: They propose an adaptive pooling strategy that allows the model to learn how to aggregate features through a combination of simple pooling methods.
Outcome: The proposed strategy outperforms current state-of-the-art systems on image-to-text and text-toimage retrieval.
CoViPAL: Layer-wise Contextualized Visual Token Pruning for Large Vision-Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Existing methods to prune redundant vision tokens struggle in shallow layers due to the lack of contextual information.
Approach: They propose a layer-wise contextualized visual token pruning method that uses a plug-and-play Pruning Module to prune redundant vision tokens.
Outcome: The proposed method outperforms training-free pruning methods under equal token budgets and surpasses training based methods with comparable supervision.
TrimTokenator: Towards Adaptive Visual Token Pruning for Large Multimodal Models (2026.findings-acl)

Copied to clipboard

Challenge: Existing token pruning methods rely on costly calibration or suboptimal importance metrics, leading to redundant retained tokens.
Approach: They propose a token pruning strategy that preserves cross-modal alignment and informational diversity.
Outcome: The proposed method maintains strong performance while reducing tokens by 88.9% on two models.
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.
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.
VisRet: Visualization Improves Knowledge-Intensive Text-to-Image Retrieval (2026.acl-long)

Copied to clipboard

Challenge: Text-to-image retrieval is challenging because of cross-modal embeddings are bags of concepts, underrepresenting structured visual relationships.
Approach: They propose a retrieval paradigm that embeds textual queries into the image modality via T2I generation and performs retrieval within the image mode to bypass weaknesses of cross-modal retrievers in recognizing subtle visual-spatial features.
Outcome: The proposed retrieval paradigm outperforms previous approaches in visual-spatial retrieval benchmarks.
Focus on the Core: Efficient Attention via Pruned Token Compression for Document Classification (2023.findings-emnlp)

Copied to clipboard

Challenge: Pre-trained transformers suffer from a computationally expensive self-attention mechanism that interacts with all tokens, including those unfavorable to classification performance.
Approach: They propose to integrate token pruning and token combining strategies to improve model performance and reduce computational demands.
Outcome: Experiments with various datasets show that the proposed model performs better than baseline models, with the best improvement over the existing model.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations