paper-with-me

홈 › Papers

Do We Really Need Permutations? Impact of Model Width on Linear Mode Connectivity

2025-10-09 · Akira Ito, Masanori Yamada, Daiki Chijiwa, Atsutoshi Kumagai 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 $\times$ 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.

📄 PDF Abstract BibTeX arXiv:2510.08023

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Exact Learning of Permutations for Nonzero Binary Inputs with Logarithmic Training Size and Quadratic Ensemble Complexity

2025-02-24 · George Giapitzakis, Artur Back de Luca, Kimon Fountoulakis

The ability of an architecture to realize permutations is quite fundamental. For example, Large Language Models need to be able to correctly copy (and perhaps rearrange) parts of the input prompt into the output. Classic…

Implicit Bias of Linear Equivariant Networks

2021-10-12 · Hannah Lawrence, Kristian Georgiev, Andrew Dienes, Bobak T. Kiani

Group equivariant convolutional neural networks (G-CNNs) are generalizations of convolutional neural networks (CNNs) which excel in a wide range of technical applications by explicitly encoding symmetries, such as rotati…

Binary Classification

Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networks

2020-01-16 · ICLR 2020 1 · Wei Hu, Lechao Xiao, Jeffrey Pennington

The selection of initial parameter values for gradient-based optimization of deep neural networks is one of the most impactful hyperparameter choices in deep learning systems, affecting both convergence times and model p…

C-MinHash: Practically Reducing Two Permutations to Just One

2021-09-10 · Xiaoyun Li, Ping Li

Traditional minwise hashing (MinHash) requires applying $K$ independent permutations to estimate the Jaccard similarity in massive binary (0/1) data, where $K$ can be (e.g.,) 1024 or even larger, depending on application…

Vocal Bursts Valence Prediction

Frivolous Units: Wider Networks Are Not Really That Wide

2019-12-10 · Stephen Casper, Xavier Boix, Vanessa D'Amario, Ling Guo 외

A remarkable characteristic of overparameterized deep neural networks (DNNs) is that their accuracy does not degrade when the network's width is increased. Recent evidence suggests that developing compressible representa…