GSMM: Efficient Global Sparsification for Resource-Conscious Multimodal Models

Large Multimodal Models (LMMs) are increasingly essential in various real-time applications, yet their substantial parameter counts and complex architectures pose significant challenges. Traditional global compression methods often rely on trial-and-error experimentation, leading to inefficiencies. In this paper, we introduce new GS-MM, an Efficient Global Sparsification technique tailored for resource-conscious multimodal models. GS-MM assigns global sparsification strategies by extracting primitive importance from the model’s components. We first derive the importance of elements from the mapping values of fully weighted activations, based on the weights of the elements. Subsequently, we compute the average multimodal importance to establish a global importance score. This score is then linearly mapped to determine the global allocation ratio, enabling the realization of global sparsity in LMMs. We demonstrate the effectiveness of our approach through extensive experiments on diverse benchmarks, including visual question-answering and reasoning tasks. Our pruned models consistently outperform conventional pruning methods, setting new standards for compressed model performance. Notably, our approach exhibits remarkable resilience to increasing sparsity ratios, preserving model quality even under extreme compression.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889859
Primary Topic
Speech and dialogue systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GSMM: Efficient Global Sparsification for Resource-Conscious Multimodal Models

Wenlun Zhang, Haoran Pang, L. Li, Yucai Zhou et al.
Speech and dialogue systems
article

GSMM: Efficient Global Sparsification for Resource-Conscious Multimodal Models

Wenlun Zhang, Haoran Pang, L. Li, Yucai Zhou, Shixiao Wang
article en

Abstract

Large Multimodal Models (LMMs) are increasingly essential in various real-time applications, yet their substantial parameter counts and complex architectures pose significant challenges. Traditional global compression methods often rely on trial-and-error experimentation, leading to inefficiencies. In this paper, we introduce new GS-MM, an Efficient Global Sparsification technique tailored for resource-conscious multimodal models. GS-MM assigns global sparsification strategies by extracting primitive importance from the model’s components. We first derive the importance of elements from the mapping values of fully weighted activations, based on the weights of the elements. Subsequently, we compute the average multimodal importance to establish a global importance score. This score is then linearly mapped to determine the global allocation ratio, enabling the realization of global sparsity in LMMs. We demonstrate the effectiveness of our approach through extensive experiments on diverse benchmarks, including visual question-answering and reasoning tasks. Our pruned models consistently outperform conventional pruning methods, setting new standards for compressed model performance. Notably, our approach exhibits remarkable resilience to increasing sparsity ratios, preserving model quality even under extreme compression.

Keio University (JP), Guangdong Polytechnic of Science and Technology (CN), Institute of Science and Technology, University of Birmingham (GB)
Decent work and economic growth
Openalex Percentile: Top 98%
Speech and dialogue systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.