Model Merging via Multi-Teacher Knowledge Distillation
On the map: Knowledge distillation → General knowledge distillation methods
Abstract (arXiv)
Model merging has emerged as a lightweight alternative to joint multi-task learning (MTL), yet the generalization properties of merged models remain largely unexplored. Establishing such theoretical guarantees is non-trivial, as the merging process typically forbids access to the original training data and involves combining fine-tuned models trained on fundamentally heterogeneous data distributions. Without a principled understanding of these dynamics, current methods often rely on heuristics to approximate the optimal combination of parameters. This dependence is most critical in coefficient scaling, the weighting factors that modulate the magnitude of each fine-tuned model's contribution to the shared parameter. However, without a principled objective to guide their selection, these methods lead to brittle performance and are highly sensitive to scaling initialization. We address this gap by (i) establishing a novel flatness-aware PAC-Bayes generalization bound specifically for the model merging setting. This analysis introduces a "cross-task heterogeneity" term that formally captures the mismatch between diverse fine-tuned model priors and the target multi-task distributions. Guided by this theoretical insight, (ii) we frame model merging as multi-teacher knowledge distillation on scarce, unlabeled data. We formally demonstrate that minimizing the student-teacher Kullback-Leibler divergence directly tightens the upper bound on the merged model's excess risk. Guided by the flatness-aware bound derived, (iii) we operationalize this objective via SAMerging, a method that employs Sharpness-Aware Minimization (SAM) to find flat minima. Empirically, SAMerging establishes a new state of the art across vision and NLP benchmarks, achieving remarkable performance. The code is available at https://github.com/arshandalili/SAMerging.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Placed in General knowledge distillation methods, one of 12 directions in Knowledge distillation. Builds on 64 of its 89 references that are in the map. First posted on arXiv 24 Dec 2025.
Builds on
64 of 89 references.
References · 64
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,899
- 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,148
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,682
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2013Describing Textures in the Wildcited by 2,125
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2017Multi-Task Learning Using Uncertainty to Weigh Losses for Scene Geometry and Semanticscited by 1,358
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2022Editing Models with Task Arithmeticcited by 1,120
38 more
- 2018Neural Network Acceptability Judgmentscited by 958
- 2017A Survey on Multi-Task Learningcited by 840
- 2017GradNorm: Gradient Normalization for Adaptive Loss Balancing in Deep Multitask Networkscited by 834
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2023Language Models are Super Mario: Absorbing Abilities from Homologous Models as a Free Lunchcited by 694
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2017Exploring Generalization in Deep Learningcited by 600
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 471
- 2016Cross-stitch Networks for Multi-task Learningcited by 467
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2021Conflict-Averse Gradient Descent for Multi-task Learningcited by 459
- 2018Rotation Equivariant CNNs for Digital Pathologycited by 422
- 2018Deep Learning for Classical Japanese Literaturecited by 422
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2013Challenges in Representation Learning: A report on three machine learning contestscited by 302
- 2021Ensemble deep learning: A reviewcited by 284
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2019Pareto Multi-Task Learningcited by 224
- 2023Task Arithmetic in the Tangent Space: Improved Editing of Pre-Trained Modelscited by 221
- 2015The Benefit of Multitask Representation Learningcited by 195
- 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 160
- 2024Localizing Task Information for Improved Model Merging and Compressioncited by 131
- 2021DSelect-k: Differentiable Selection in the Mixture of Experts with Applications to Multi-Task Learningcited by 115
- 2024Representation Surgery for Multi-Task Model Mergingcited by 96
- 2025No Task Left Behind: Isotropic Model Merging with Common and Task-Specific Subspacescited by 96
- 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 92
- 2020Relative Flatness and Generalizationcited by 88
- 2024Parameter Competition Balancing for Model Mergingcited by 72
- 2023π-Tuning: Transferring Multimodal Foundation Models with Optimal Multi-task Interpolationcited by 40
- 2025When is Task Vector Provably Effective for Model Editing? A Generalization Analysis of Nonlinear Transformerscited by 38
- 2024On the Emergence of Cross-Task Linearity in the Pretraining-Finetuning Paradigmcited by 26
- 2023FedLPA: One-shot Federated Learning with Layer-Wise Posterior Aggregationcited by 22
- 2024Closed-form merging of parameter-efficient modules for Federated Continual Learningcited by 22
- 2024Why is SAM Robust to Label Noise?cited by 21
- 2022Train Flat, Then Compress: Sharpness-Aware Minimization Learns More Compressible Modelscited by 20
50 most cited of 64 All 64 (JSON)
Built on by
Citing papers per year: 2026: 2.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2024MergeNet: Knowledge Migration across Heterogeneous Models, Tasks, and Modalities
- 2025DisTaC: Conditioning Task Vectors via Distillation for Robust Model Merging
- 2024Efficient and Effective Weight-Ensembling Mixture of Experts for Multi-Task Model Merging
- 2025StatsMerging: Statistics-Guided Model Merging via Task-Specific Teacher Distillation
- 2025Fine, I'll Merge It Myself: A Multi-Fidelity Framework for Automated Model Merging
- 2026Model Merging in the Era of Large Language Models: Methods, Applications, and Future Directions
- 2026Rethinking Heterogeneous LLM Merging: A Weighted Model Averaging Perspective
- 2026Escaping Low-Dimensional Overlap: Multi-Task Model Merging via High-Dimensional Sparse Disentanglement