Harmony in Diversity: Merging Neural Networks with Canonical Correlation Analysis
Not on the map. Why?
Abstract (arXiv)
Combining the predictions of multiple trained models through ensembling is generally a good way to improve accuracy by leveraging the different learned features of the models, however it comes with high computational and storage costs. Model fusion, the act of merging multiple models into one by combining their parameters reduces these costs but doesn't work as well in practice. Indeed, neural network loss landscapes are high-dimensional and non-convex and the minima found through learning are typically separated by high loss barriers. Numerous recent works have been focused on finding permutations matching one network features to the features of a second one, lowering the loss barrier on the linear path between them in parameter space. However, permutations are restrictive since they assume a one-to-one mapping between the different models' neurons exists. We propose a new model merging algorithm, CCA Merge, which is based on Canonical Correlation Analysis and aims to maximize the correlations between linear combinations of the model features. We show that our alignment method leads to better performances than past methods when averaging models trained on the same, or differing data splits. We also extend this analysis into the harder setting where more than 2 models are merged, and we find that CCA Merge works significantly better than past methods. Our code is publicly available at https://github.com/shoroi/align-n-merge
Key facts. Cited by 9 papers in the map (data through 14 Oct 2026). Builds on 31 of its 38 references that are in the map. First posted on arXiv 7 Jul 2024.
Builds on
31 of 38 references.
References · 31
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
19 more
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
- 2018Insights on representational similarity in neural networks with canonical correlationcited by 324
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
- 2015Convergent Learning: Do different neural networks learn the same representations?cited by 220
- 2019Model Fusion via Optimal Transportcited by 219
- 2014Qualitatively characterizing neural network optimization problemscited by 188
- 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 120
- 2018A Closer Look at Deep Learning Heuristics: Learning rate restarts, Warmup and Distillationcited by 110
- 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
- 2020Optimizing Mode Connectivity via Neuron Alignmentcited by 86
- 2022Re-basin via implicit Sinkhorn differentiationcited by 62
- 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
- 2024Simultaneous linear connectivity of neural networks modulo permutationcited by 10
Built on by
Citing papers per year: 2024: 3; 2025: 5; 2026: 1.
9 papers.
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descentcited by 39
- 2025Scalable Model Merging with Progressive Layer-wise Distillationcited by 10
- 2025MASS: MoErging through Adaptive Subspace Selectioncited by 5
- 2025Model Assembly Learning with Heterogeneous Layer Weight Mergingcited by 2
- 2025Model Merging Improves Zero-Shot Generalization in Bioacoustic Foundation Modelscited by 2
- 2026Partial Fusion of Neural Networks: Efficient Tradeoffs Between Ensembles and Weight Aggregationcited by 1
- 2024DoubleCCA: Improving Foundation Model Group Robustness with Random Sentence Embeddingscited by 0
- 2024Non-Uniform Parameter-Wise Model Mergingcited by 0
- 2026Partial Fusion of Neural Networks: Efficient Tradeoffs Between Ensembles and Weight Aggregation21 May 2026
- 2025Model Merging Improves Zero-Shot Generalization in Bioacoustic Foundation Models7 Nov 2025
- 2025MASS: MoErging through Adaptive Subspace Selection6 Apr 2025
- 2025Model Assembly Learning with Heterogeneous Layer Weight Merging27 Mar 2025
- 2025Scalable Model Merging with Progressive Layer-wise Distillation18 Feb 2025
- 2025Modeling Multi-Task Model Merging as Adaptive Projective Gradient Descent2 Jan 2025
- 2024Non-Uniform Parameter-Wise Model Merging20 Dec 2024
- 2024DoubleCCA: Improving Foundation Model Group Robustness with Random Sentence Embeddings25 Nov 2024
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunities14 Aug 2024