Towards Meta-Pruning via Optimal Transport
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 27 of its 37 references that are in the map. First posted on arXiv 12 Feb 2024.
Builds on
27 of 37 references.
References · 27
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2020Knowledge Distillation: A Surveycited by 1,578
- 2017Quantization and Training of Neural Networks for Efficient Integer-Arithmetic-Only Inferencecited by 1,548
- 2022SmoothQuant: Accurate and Efficient Post-Training Quantization for Large Language Modelscited by 1,338
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
- 2017Channel Pruning for Accelerating Very Deep Neural Networkscited by 697
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
15 more
- 2020What is the State of Neural Network Pruning?cited by 578
- 2020Federated Learning with Matched Averagingcited by 564
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2022ZeroQuant: Efficient and Affordable Post-Training Quantization for Large-Scale Transformerscited by 517
- 2019Bayesian Nonparametric Federated Learning of Neural Networkscited by 385
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2017NISP: Pruning Networks using Neuron Importance Score Propagationcited by 228
- 2019Model Fusion via Optimal Transportcited by 217
- 2015Convergent Learning: Do different neural networks learn the same representations?cited by 215
- 2015Learning with a Wasserstein Losscited by 194
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2019EigenDamage: Structured Pruning in the Kronecker-Factored Eigenbasiscited by 98
- 2021CHIP: CHannel Independence-based Pruning for Compact Neural Networkscited by 76
- 2021Co-Transport for Class-Incremental Learningcited by 38
Built on by
Citing papers per year: 2024: 2; 2025: 5; 2026: 1.
8 papers.
- 2025MergeMoE: Efficient Compression of MoE Models via Expert Output Mergingcited by 8
- 2025Forget the Data and Fine-Tuning! Just Fold the Network to Compresscited by 7
- 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometrycited by 4
- 2024Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importancecited by 2
- 2025Merging Feed-Forward Sublayers for Compressed Transformerscited by 1
- 2025DOTResize: Reducing LLM Width via Discrete Optimal Transport-based Neuron Mergingcited by 1
- 2024Subspace Node Pruningcited by 0
- 2025Smooth Model Compression without Fine-Tuningcited by 0
- 2026Cut Less, Fold More: Model Compression through the Lens of Projection Geometry20 Feb 2026
- 2025MergeMoE: Efficient Compression of MoE Models via Expert Output Merging16 Oct 2025
- 2025DOTResize: Reducing LLM Width via Discrete Optimal Transport-based Neuron Merging6 Jul 2025
- 2025Smooth Model Compression without Fine-Tuning30 May 2025
- 2025Forget the Data and Fine-Tuning! Just Fold the Network to Compress14 Feb 2025
- 2025Merging Feed-Forward Sublayers for Compressed Transformers10 Jan 2025
- 2024Small Contributions, Small Networks: Efficient Neural Network Pruning Based on Relative Importance21 Oct 2024
- 2024Subspace Node Pruning26 May 2024