M-Loss: Quantifying Model Merging Compatibility with Limited Unlabeled Data
Not on the map. Why?
Abstract (arXiv)
Training of large-scale models is both computationally intensive and often constrained by the availability of labeled data. Model merging offers a compelling alternative by directly integrating the weights of multiple source models without requiring additional data or extensive training. However, conventional model merging techniques, such as parameter averaging, often suffer from the unintended combination of non-generalizable features, especially when source models exhibit significant weight disparities. Comparatively, model ensembling generally provides more stable and superior performance that aggregates multiple models by averaging outputs. However, it incurs higher inference costs and increased storage requirements. While previous studies experimentally showed the similarities between model merging and ensembling, theoretical evidence and evaluation metrics remain lacking. To address this gap, we introduce Merging-ensembling loss (M-Loss), a novel evaluation metric that quantifies the compatibility of merging source models using very limited unlabeled data. By measuring the discrepancy between parameter averaging and model ensembling at layer and node levels, M-Loss facilitates more effective merging strategies. Specifically, M-Loss serves both as a quantitative criterion of the theoretical feasibility of model merging, and a guide for parameter significance in model pruning. Our theoretical analysis and empirical evaluations demonstrate that incorporating M-Loss into the merging process significantly improves the alignment between merged models and model ensembling, providing a scalable and efficient framework for accurate model consolidation.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 46 references that are in the map. First posted on arXiv 9 Feb 2026.
Builds on
23 of 46 references.
References · 23
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2016Gaussian Error Linear Units (GELUs)cited by 3,431
- 2013Describing Textures in the Wildcited by 2,110
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,366
- 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 795
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 791
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 679
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2021FedBN: Federated Learning on Non-IID Features via Local Batch Normalizationcited by 565
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 384
- 2020BatchEnsemble: An Alternative Approach to Efficient Ensemble and Lifelong Learningcited by 368
11 more
- 2018Essentially No Barriers in Neural Network Energy Landscapecited by 328
- 2016Topology and Geometry of Half-Rectified Network Optimizationcited by 102
- 2024The rising costs of training frontier AI modelscited by 91
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2023vTrain: A Simulation Framework for Evaluating Cost-effective and Compute-optimal Large Language Model Trainingcited by 22
- 2024Training-Free Model Merging for Multi-target Domain Adaptationcited by 15
- 2022Generalizability of Machine Learning Models: Quantitative Evaluation of Three Methodological Pitfallscited by 12
- 2021Deep Time Series Models for Scarce Datacited by 8
- 2025Leveraging Submodule Linearity Enhances Task Arithmetic Performance in LLMscited by 4
- 2024Reducing the Barriers to Entry for Foundation Model Trainingcited by 3
- 2024More Compute Is What You Needcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.