Robustness and Regularization in Hierarchical Re-Basin
Not on the map. Why?
Abstract (arXiv)
This paper takes a closer look at Git Re-Basin, an interesting new approach to merge trained models. We propose a hierarchical model merging scheme that significantly outperforms the standard MergeMany algorithm. With our new algorithm, we find that Re-Basin induces adversarial and perturbation robustness into the merged models, with the effect becoming stronger the more models participate in the hierarchical merging scheme. However, in our experiments Re-Basin induces a much bigger performance drop than reported by the original authors.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 12 of its 15 references that are in the map. First posted on arXiv 10 Oct 2025.
Builds on
12 of 15 references.
References · 12
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015DeepFool: a simple and accurate method to fool deep neural networkscited by 1,315
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2020Federated Learning with Matched Averagingcited by 564
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2017Adversarial Attacks on Neural Network Policiescited by 314
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 144
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2022Exploring Mode Connectivity for Pre-trained Language Modelscited by 26
- 2022Wasserstein Barycenter-based Model Fusion and Linear Mode Connectivity of Neural Networkscited by 14
- 2021Analytical bounds on the local Lipschitz constants of ReLU networkscited by 12
Built on by
Citing papers per year: 2025: 1.
1 paper.