Model Merging is Secretly Certifiable: Non-Vacuous Generalisation Bounds for Low-Shot Learning
Not on the map. Why?
Abstract (arXiv)
Certifying the IID generalisation ability of deep networks is the first of many requirements for trusting AI in high-stakes applications from medicine to security. However, when instantiating generalisation bounds for deep networks it remains challenging to obtain non-vacuous guarantees, especially when applying contemporary large models on the small scale data prevalent in such high-stakes fields. In this paper, we draw a novel connection between a family of learning methods based on model fusion and generalisation certificates, and surprisingly show that with minor adjustment several existing learning strategies already provide non-trivial generalisation guarantees. Essentially, by focusing on data-driven learning of downstream tasks by fusion rather than fine-tuning, the certified generalisation gap becomes tiny and independent of the base network size, facilitating its certification. Our results show for the first time non-trivial generalisation guarantees for learning with as low as 100 examples, while using vision models such as VIT-B and language models such as mistral-7B. This observation is significant as it has immediate implications for facilitating the certification of existing systems as trustworthy, and opens up new directions for research at the intersection of practice and theory.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 27 of its 48 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
27 of 48 references.
References · 27
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
- 2023Mistral 7Bcited by 3,164
- 2013Describing Textures in the Wildcited by 2,125
- 2022Challenging BIG-Bench Tasks and Whether Chain-of-Thought Can Solve Themcited by 1,807
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
15 more
- 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
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 364
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2021User-friendly introduction to PAC-Bayes boundscited by 239
- 2024Evolutionary Optimization of Model Merging Recipescited by 208
- 2024Arcee's MergeKit: A Toolkit for Merging Large Language Modelscited by 194
- 2022A Comprehensive Survey of Few-shot Learning: Evolution, Applications, Challenges, and Opportunitiescited by 163
- 2023Model Breadcrumbs: Scaling Multi-Task Model Merging with Sparse Maskscited by 133
- 2020Tighter risk certificates for neural networkscited by 112
- 2023Deep Model Fusion: A Surveycited by 91
- 2023Non-Vacuous Generalization Bounds for Large Language Modelscited by 53
- 2020Distance-Based Regularisation of Deep Networks for Fine-Tuningcited by 48
- 2021How Tight Can PAC-Bayes be in the Small Data Regime?cited by 24
Built on by
Citing papers per year: 2026: 2.
2 papers.