Linear Mode Connectivity in Differentiable Tree Ensembles
Not on the map. Why?
Abstract (arXiv)
Linear Mode Connectivity (LMC) refers to the phenomenon that performance remains consistent for linearly interpolated models in the parameter space. For independently optimized model pairs from different random initializations, achieving LMC is considered crucial for understanding the stable success of the non-convex optimization in modern machine learning models and for facilitating practical parameter-based operations such as model merging. While LMC has been achieved for neural networks by considering the permutation invariance of neurons in each hidden layer, its attainment for other models remains an open question. In this paper, we first achieve LMC for soft tree ensembles, which are tree-based differentiable models extensively used in practice. We show the necessity of incorporating two invariances: subtree flip invariance and splitting order invariance, which do not exist in neural networks but are inherent to tree architectures, in addition to permutation invariance of trees. Moreover, we demonstrate that it is even possible to exclude such additional invariances while keeping LMC by designing decision list-based tree architectures, where such invariances do not exist by definition. Our findings indicate the significance of accounting for architecture-specific invariances in achieving LMC.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 22 of its 33 references that are in the map. First posted on arXiv 23 May 2024.
Builds on
22 of 33 references.
References · 22
- 2017Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layercited by 3,413
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020GShard: Scaling Giant Models with Conditional Computation and Automatic Shardingcited by 1,601
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2022Editing Models with Task Arithmeticcited by 1,076
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 313
- 2021The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networkscited by 285
- 2022Quark: Controllable Text Generation with Reinforced Unlearningcited by 236
10 more
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 218
- 2019Neural Oblivious Decision Ensembles for Deep Learning on Tabular Datacited by 200
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 144
- 2022REPAIR: REnormalizing Permuted Activations for Interpolation Repaircited by 119
- 2021NODE-GAM: Neural Generalized Additive Model for Interpretable Deep Learningcited by 88
- 2022Re-basin via implicit Sinkhorn differentiationcited by 61
- 2020The Tree Ensemble Layer: Differentiability meets Conditional Computationcited by 57
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2021A Neural Tangent Kernel Perspective of Infinite Tree Ensemblescited by 4
- 2022Analyzing Tree Architectures in Ensembles via Neural Tangent Kernelcited by 2
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Deep Learning is Not So Mysterious or Differentcited by 55
- 2025Deep Learning is Not So Mysterious or Different3 Mar 2025