mlsanityData to 14 Oct 2026

Generalized Linear Mode Connectivity for Transformers

arXiv 2506.22712 ↗First posted 28 Jun 2025cs.LG stat.MLcited by 16

Not on the map. Why?

Abstract (arXiv)

Understanding the geometry of neural network loss landscapes is a central question in deep learning, with implications for generalization and optimization. A striking phenomenon is linear mode connectivity (LMC), where independently trained models can be connected by low- or zero-loss paths despite appearing to lie in separate loss basins. However, this is often obscured by symmetries in parameter space -- such as neuron permutations -- which make functionally equivalent models appear dissimilar. Prior work has predominantly focused on neuron reordering through permutations, but such approaches are limited in scope and fail to capture the richer symmetries exhibited by modern architectures such as Transformers. In this work, we introduce a unified framework that captures four symmetry classes -- permutations, semi-permutations, orthogonal transformations, and general invertible maps -- broadening the set of valid reparameterizations and subsuming many previous approaches as special cases. Crucially, this generalization enables, for the first time, the discovery of low- and zero-barrier linear interpolation paths between independently trained Vision Transformers and GPT-2 models. Furthermore, our framework extends beyond pairwise alignment to multi-model and width-heterogeneous settings, enabling alignment across architectures of different sizes. These results reveal deeper structure in the loss landscape and underscore the importance of symmetry-aware analysis for understanding model space geometry.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 21 of its 28 references that are in the map. First posted on arXiv 28 Jun 2025.

Builds on

21 of 28 references.

References · 21

  1. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  2. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  3. 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
  4. 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
  5. 2024SliceGPT: Compress Large Language Models by Deleting Rows and Columnscited by 385
  6. 2018Essentially No Barriers in Neural Network Energy Landscapecited by 330
  7. 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 291
  8. 2019Model Fusion via Optimal Transportcited by 219
  9. 2023ZipIt! Merging Models from Different Tasks without Trainingcited by 179
  10. 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 120
  11. 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
  12. 2023Deep Model Fusion: A Surveycited by 91
9 more
  1. 2020Optimizing Mode Connectivity via Neuron Alignmentcited by 86
  2. 2022Re-basin via implicit Sinkhorn differentiationcited by 62
  3. 2021Relating Adversarially Robust Generalization to Flat Minimacited by 57
  4. 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
  5. 2022A Unified Framework for Implicit Sinkhorn Differentiationcited by 28
  6. 2023Layer-wise Linear Mode Connectivitycited by 22
  7. 2024C2M3: Cycle-Consistent Multi-Model Mergingcited by 20
  8. 2024Merging Text Transformer Models from Different Initializationscited by 16
  9. 2024Analysis of Linear Mode Connectivity via Permutation-Based Weight Matching: With Insights into Other Permutation Search Methodscited by 9

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 2; 2026: 14.

16 papers.

Sort:

By area: