Non-Uniform Parameter-Wise Model Merging
Not on the map. Why?
Abstract (arXiv)
Combining multiple machine learning models has long been a technique for enhancing performance, particularly in distributed settings. Traditional approaches, such as model ensembles, work well, but are expensive in terms of memory and compute. Recently, methods based on averaging model parameters have achieved good results in some settings and have gained popularity. However, merging models initialized differently that do not share a part of their training trajectories can yield worse results than simply using the base models, even after aligning their neurons. In this paper, we introduce a novel approach, Non-uniform Parameter-wise Model Merging, or NP Merge, which merges models by learning the contribution of each parameter to the final model using gradient-based optimization. We empirically demonstrate the effectiveness of our method for merging models of various architectures in multiple settings, outperforming past methods. We also extend NP Merge to handle the merging of multiple models, showcasing its scalability and robustness.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 34 of its 37 references that are in the map. First posted on arXiv 20 Dec 2024.
Builds on
34 of 37 references.
References · 34
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2015Rethinking the Inception Architecture for Computer Visioncited by 5,451
- 2016Wide Residual Networkscited by 3,057
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2017A Closer Look at Memorization in Deep Networkscited by 936
22 more
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2021Robust fine-tuning of zero-shot modelscited by 785
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2020What is being transferred in transfer learning?cited by 365
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2019Model Fusion via Optimal Transportcited by 217
- 2015Convergent Learning: Do different neural networks learn the same representations?cited by 215
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 178
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
- 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
- 2024Representation Surgery for Multi-Task Model Mergingcited by 95
- 2020Optimizing Mode Connectivity via Neuron Alignmentcited by 85
- 2022Re-basin via implicit Sinkhorn differentiationcited by 61
- 2020On Power Laws in Deep Ensemblescited by 26
- 2023PopulAtion Parameter Averaging (PAPA)cited by 23
- 2021Exploring the Geometry and Topology of Neural Network Loss Landscapescited by 14
- 2024Harmony in Diversity: Merging Neural Networks with Canonical Correlation Analysiscited by 9
- 2023Leveraging Function Space Aggregation for Federated Learning at Scalecited by 4
Built on by
Not cited yet.