Towards Meta-Pruning via Optimal Transport
Alexander Theus, Olin Geimer, Friedrich Wicke, Thomas Hofmann, Sotiris Anagnostidis, Sidak Pal Singh
Abstract
Structural pruning of neural networks conventionally relies on identifying and discarding less important neurons, a practice often resulting in significant accuracy loss that necessitates subsequent fine-tuning efforts. This paper introduces a novel approach named Intra-Fusion, challenging this prevailing pruning paradigm. Unlike existing methods that focus on designing meaningful neuron importance metrics, Intra-Fusion redefines the overlying pruning procedure. Through utilizing the concepts of model fusion and Optimal Transport, we leverage an agnostically given importance metric to arrive at a more effective sparse model representation. Notably, our approach achieves substantial accuracy recovery without the need for resource-intensive fine-tuning, making it an efficient and promising tool for neural network compression. Additionally, we explore how fusion can be added to the pruning process to significantly decrease the training time while maintaining competitive performance. We benchmark our results for various networks on commonly used datasets such as CIFAR-10, CIFAR-100, and ImageNet. More broadly, we hope that the proposed Intra-Fusion approach invigorates exploration into a fresh alternative to the predominant compression approaches. Our code is available here: https://github.com/alexandertheus/Intra-Fusion.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers3
- Cut Less, Fold More: Model Compression through the Lens of Projection GeometryOlga Saukh, Dong Wang, Haris Sikic, Yun Cheng et al.ICLR 2026 · 4 citations
- Fusing Pruned and Backdoored Models: Optimal Transport-based Data-free Backdoor MitigationWeilin Lin, Li Liu, Jianze Li, Hui XiongAAAI 2025 · 1 citation
- Forget the Data and Fine-Tuning! Just Fold the Network to CompressDong Wang, Haris Sikic, Lothar Thiele, Olga SaukhICLR 2025
Builds on10
- SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language ModelsGuangxuan Xiao, Ji Lin, Mickaël Seznec, Hao Wu et al.ICML 2023 · 1,493 citations
- Federated Learning with Matched AveragingHongyi Wang, Mikhail Yurochkin, Yuekai Sun, Dimitris S. Papailiopoulos et al.ICLR 2020 · 1,368 citations
- SparseGPT: Massive Language Models Can be Accurately Pruned in One-ShotElias Frantar, Dan AlistarhICML 2023 · 1,240 citations
- ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale TransformersZhewei Yao, Reza Yazdani Aminabadi, Minjia Zhang, Xiaoxia Wu et al.NeurIPS 2022 · 816 citations
- Layer-adaptive Sparsity for the Magnitude-based PruningJaeho Lee, Sejun Park, Sangwoo Mo, Sungsoo Ahn et al.ICLR 2021 · 331 citations
Related papers
- Neuron Merging: Compensating for Pruned NeuronsWoojeong Kim, Suhyun Kim, Mincheol Park, Geunseok JeonNeurIPS 2020 · 42 citations
- Convolutional Neural Network Pruning With Structural Redundancy ReductionZi Wang, Chengcheng Li, Xiangyang WangCVPR 2021
- Pruning from ScratchYulong Wang, Xiaolu Zhang, Lingxi Xie, Jun Zhou et al.AAAI 2020 · 219 citations
- IDAP++: Advancing Divergence-Aware Pruning with Joint Filter and Layer OptimizationAleksei Samarin, Artem A. Nazarenko, Egor Kotenko, Alexander Savelev et al.SIGMOD 2026
- Partial Fusion of Neural Networks: Efficient Tradeoffs Between Ensembles and Weight AggregationFabian Morelli, Stephan EcksteinICML 2026
