Model Merging on Loss Landscape: A Geometry Perspective
Not on the map. Why?
Abstract (arXiv)
Model merging offers a promising avenue for knowledge integration and parallel development without retraining. Yet, existing methods either ignore the geometry of the loss landscape or rely on intractable full-space Hessian approximations. We propose EpiMer, a framework that casts model merging as solving the Fr'echet mean on a Riemannian manifold and restricts the computation to a low-rank subspace spanned by the task vectors. With the expected Hessian as the metric, we reveal a connection between local curvature and epistemic uncertainty of the parameters. Our theoretical analysis decomposes the merging error bound into the subspace Fr'echet variance and the residual energy, and provides a closed-form characterization of when curvature-aware merging provably outperforms flat-geometry methods. In addition, our framework unifies both curvature-aware methods and recent spectral methods as special cases of the subspace Fr'echet mean with different geometric metrics. Merging fine-tuned CLIP-ViT models on eight image classification tasks, Epistemic Merging strictly outperforms the baselines on all three CLIP-ViT backbones at matched rank, improving the across-task average accuracy and worst-task accuracy on every backbone.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 20 of its 36 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
20 of 36 references.
References · 20
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2015Trust Region Policy Optimizationcited by 2,503
- 2013Describing Textures in the Wildcited by 2,110
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,488
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
- 2021Robust fine-tuning of zero-shot modelscited by 785
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
8 more
- 2021Merging Models with Fisher-Weighted Averagingcited by 613
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2018Online Structured Laplace Approximations For Overcoming Catastrophic Forgettingcited by 197
- 2024Task Singular Vectors: Reducing Task Interference in Model Mergingcited by 143
- 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 90
- 2021When Does Contrastive Learning Preserve Adversarial Robustness from Pretraining to Finetuning?cited by 76
- 2017Geometry of Optimization and Implicit Regularization in Deep Learningcited by 39
Built on by
Citing papers per year: 2026: 1.
1 paper.