Do We Really Need Permutations? Impact of Model Width on Linear Mode Connectivity
Not on the map. Why?
Abstract (arXiv)
Recently, Ainsworth et al. empirically demonstrated that, given two independently trained models, applying a parameter permutation that preserves the input-output behavior allows the two models to be connected by a low-loss linear path. When such a path exists, the models are said to achieve linear mode connectivity (LMC). Prior studies, including Ainsworth et al.(2023), have reported that achieving LMC requires not only an appropriate permutation search but also sufficiently wide models (e.g., a 32 × width multiplier for ResNet-20). This is broadly believed to be because increasing the model width ensures a large enough space of candidate permutations, increasing the chance of finding one that yields LMC. In this work, we empirically demonstrate that, even without any permutations, simply widening the models is sufficient for achieving LMC when using a suitable softmax temperature calibration. We further explain why this phenomenon arises by analyzing intermediate layer outputs. Specifically, we introduce layerwise exponentially weighted connectivity (LEWC), which states that the output of each layer of the merged model can be represented as an exponentially weighted sum of the outputs of the corresponding layers of the original models. Consequently the merged model's output matches that of an ensemble of the original models, facilitating LMC. To the best of our knowledge, this work is the first to show that widening the model not only facilitates nonlinear mode connectivity, as suggested in prior research, but also significantly increases the possibility of achieving linear mode connectivity.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 37 of its 44 references that are in the map. First posted on arXiv 9 Oct 2025.
Builds on
37 of 44 references.
References · 37
- 2017Attention Is All You Needcited by 59,932
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2023A Survey of Large Language Modelscited by 2,537
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2016WaveNet: A Generative Model for Raw Audiocited by 1,710
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 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
- 2020Federated Learning with Matched Averagingcited by 564
25 more
- 2016Federated Optimization: Distributed Machine Learning for On-Device Intelligencecited by 558
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 2019Uniform convergence may be unable to explain generalization in deep learningcited by 223
- 2019Model Fusion via Optimal Transportcited by 217
- 2021Geometry of the Loss Landscape in Overparameterized Neural Networks: Symmetries and Invariancescited by 125
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
- 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
- 2019Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Netscited by 63
- 2022Re-basin via implicit Sinkhorn differentiationcited by 61
- 2022Implicit Regularization Towards Rank Minimization in ReLU Networkscited by 53
- 2019On Connected Sublevel Sets in Deep Learningcited by 51
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2018On the loss landscape of a class of deep neural networks with no bad local valleyscited by 38
- 2019Landscape Connectivity and Dropout Stability of SGD Solutions for Over-parameterized Neural Networkscited by 35
- 2024Approaching Deep Learning through the Spectral Dynamics of Weightscited by 29
- 2023Proving Linear Mode Connectivity of Neural Networks via Optimal Transportcited by 24
- 2018Adding One Neuron Can Eliminate All Bad Local Minimacited by 21
- 2018On the Benefit of Width for Neural Networks: Disappearance of Bad Basinscited by 16
- 2024Exploring the loss landscape of regularized neural networks via convex dualitycited by 11
- 2021A Note on Connectivity of Sublevel Sets in Deep Learningcited by 8
- 2024Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methodscited by 8
- 2024Landscaping Linear Mode Connectivitycited by 7
Built on by
Citing papers per year: 2026: 2.
2 papers.