MULTIFLOW: Shifting Towards Task-Agnostic Vision-Language Pruning
Matteo Farina, Massimiliano Mancini, Elia Cunegatti, Gaowen Liu, Giovanni Iacca, Elisa Ricci
TL;DR
This work addresses the challenge of pruning vision-language models in a task-agnostic manner, aiming to produce a single sparse subnet that transfers to unknown downstream tasks. It introduces Multimodal Flow Pruning (MULTIFLOW), a gradient-free approach that scores parameters by combining edge magnitude with saliencies of connected input and output nodes, and employs a multimodal prior to guide layer-wise sparsity. The method is evaluated on two VLMs (BLIP and XVLM) and three vision-language tasks (ITR, IC, VQA) under 63% and 75% sparsity, consistently outperforming eight baselines and showing robustness under extreme sparsity. The results demonstrate that preserving the emergent, multimodal information flow from pretraining enables transferable sparsity, offering practical benefits for deploying VLMs on memory-constrained devices and reducing pruning costs.
Abstract
While excellent in transfer learning, Vision-Language models (VLMs) come with high computational costs due to their large number of parameters. To address this issue, removing parameters via model pruning is a viable solution. However, existing techniques for VLMs are task-specific, and thus require pruning the network from scratch for each new task of interest. In this work, we explore a new direction: Task-Agnostic Vision-Language Pruning (TA-VLP). Given a pretrained VLM, the goal is to find a unique pruned counterpart transferable to multiple unknown downstream tasks. In this challenging setting, the transferable representations already encoded in the pretrained model are a key aspect to preserve. Thus, we propose Multimodal Flow Pruning (MULTIFLOW), a first, gradient-free, pruning framework for TA-VLP where: (i) the importance of a parameter is expressed in terms of its magnitude and its information flow, by incorporating the saliency of the neurons it connects; and (ii) pruning is driven by the emergent (multimodal) distribution of the VLM parameters after pretraining. We benchmark eight state-of-the-art pruning algorithms in the context of TA-VLP, experimenting with two VLMs, three vision-language tasks, and three pruning ratios. Our experimental results show that MULTIFLOW outperforms recent sophisticated, combinatorial competitors in the vast majority of the cases, paving the way towards addressing TA-VLP. The code is publicly available at https://github.com/FarinaMatteo/multiflow.
