mlsanityData to 7 Oct 2026

CAPA: Contribution-Aware Pruning and FFN Approximation for Efficient Large Vision-Language Models

arXiv 2602.00247 ↗First posted 30 Jan 2026cs.CV cs.LGcited by 1

On the map: Multimodal LLMs / vision-language models → Visual token pruning and efficiency

Abstract (arXiv)

Efficient inference in Large Vision-Language Models is constrained by the high cost of processing thousands of visual tokens, yet it remains unclear which tokens and computations can be safely removed. While attention scores are commonly used to estimate visual token importance, they are an imperfect proxy for actual contribution. We show that Attention Contribution, which weights attention probabilities by value vector magnitude, provides a more accurate criterion for visual token selection. Our empirical analysis reveals that visual attention sinks are functionally heterogeneous, comprising Probability Dumps with low contribution that can be safely pruned, and Structural Anchors with high contribution essential for maintaining model performance. Further, we identify substantial redundancy in Feed-Forward Networks (FFNs) associated with visual tokens, particularly in intermediate layers where image tokens exhibit linear behavior. Based on our findings, we introduce CAPA (Contribution-Aware Pruning and FFN Approximation), a dual-strategy framework that prunes visual tokens using attention contribution at critical functional transitions and reduces FFN computation through efficient linear approximations. Experiments on various benchmarks across baselines show that CAPA achieves competent efficiency--performance trade-offs with improved robustness.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Placed in Visual token pruning and efficiency, one of 16 directions in Multimodal LLMs / vision-language models. Builds on 23 of its 37 references that are in the map. First posted on arXiv 30 Jan 2026.

Builds on

23 of 37 references.

Closest ancestors · 4

Same direction, newest first

  1. 2025RedundancyLens: Revealing and Exploiting Visual Token Processing Redundancy for Efficient Decoder-Only MLLMs31 Jan
  2. 2024Feather the Throttle: Revisiting Visual Token Pruning for Vision-Language Model Acceleration17 Dec
  3. 2024Beyond Text-Visual Attention: Exploiting Visual Cues for Effective Token Pruning in VLMs2 Dec
  4. 2024Treat Visual Tokens as Text? But Your MLLM Only Needs Fewer Efforts to See8 Oct

Other references · 19

  1. 2014Microsoft COCO: Common Objects in Contextcited by 17,498
  2. 2024Qwen2-VL: Enhancing Vision-Language Model's Perception of the World at Any Resolutioncited by 4,151
  3. 2016Making the V in VQA Matter: Elevating the Role of Image Understanding in Visual Question Answeringcited by 2,498
  4. 2023Efficient Streaming Language Models with Attention Sinkscited by 2,115
  5. 2023MMMU: A Massive Multi-discipline Multimodal Understanding and Reasoning Benchmark for Expert AGIcited by 2,044
  6. 2019Towards VQA Models That Can Readcited by 1,696
  7. 2023MM-Vet: Evaluating Large Multimodal Models for Integrated Capabilitiescited by 1,221
  8. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
  9. 2023SEED-Bench: Benchmarking Multimodal LLMs with Generative Comprehensioncited by 929
  10. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
  11. 2022MegaBlocks: Efficient Sparse Training with Mixture-of-Expertscited by 204
  12. 2021MoEfication: Transformer Feed-forward Layers are Mixtures of Expertscited by 149
7 more
  1. 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matterscited by 73
  2. 2023Monarch Mixer: A Simple Sub-Quadratic GEMM-Based Architecturecited by 62
  3. 2025Attention Sinks and Compression Valleys in LLMs are Two Sides of the Same Coincited by 47
  4. 2023TensorGPT: Efficient Compression of Large Language Models based on Tensor-Train Decompositioncited by 15
  5. 2025How Multimodal LLMs Solve Image Tasks: A Lens on Visual Grounding, Task Reasoning, and Answer Decodingcited by 13
  6. 2025FREE: Fast and Robust Vision Language Models with Early Exitscited by 12
  7. 2024Surgical Feature-Space Decomposition of LLMs: Why, When and How?cited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026LearnPruner: Rethinking Attention-based Token Pruning in Vision Language Models
  2. 2026IWP: Token Pruning as Implicit Weight Pruning in Large Vision Language Models
  3. 2025STAR: Stage-Wise Attention-Guided Token Reduction for Efficient Large Vision-Language Models Inference
  4. 2026Efficient Inference for Large Vision-Language Models: Bottlenecks, Techniques, and Prospects
  5. 2026Not All Attention Heads Contribute to Critical Visual Token Selection: Head-Aware Pruning Matters More
  6. 2026The Model Knows Which Tokens Matter: Automatic Token Selection via Noise Gating
  7. 2026AgilePruner: An Empirical Study of Attention and Diversity for Adaptive Visual Token Pruning in Large Vision-Language Models
  8. 2025GreedyPrune: Retenting Critical Visual Token Set for Large Vision Language Models