Merge Now, Regret Later: The Hidden Cost of Model Merging Is Adversarial Transferability
Not on the map. Why?
Abstract (arXiv)
Model Merging (MM) has proven to be an effective alternative to multi-task learning, where several fine-tuned models are merged, without access to the tasks' training data, into one model that retains performance across different tasks. Recent works have explored the security of MM, showing how MM can confer robustness against various adversarial attacks. However, none of them has sufficiently explored its impact on transfer attacks using transferable adversarial examples. In this work, we study the effect of MM on the transferability of adversarial examples. We perform comprehensive evaluations and statistical analysis consisting of eight MM methods, seven datasets, and six attack methods, sweeping over 336 distinct attack settings. Through it, we first challenge the prevailing notion of MM conferring free adversarial robustness, and show that MM cannot reliably defend against transfer attacks, with over 80% transfer rate. Moreover, we reveal two key insights for machine-learning practitioners regarding MM and transferability for a robust system design: (1) stronger MM methods increase vulnerability to transfer attacks and (2) mitigating representation bias increases vulnerability to transfer attacks. We also find weight averaging as an exception to (1), i.e., it is found to be the most vulnerable method to transfer attacks, despite being the weakest MM method. Finally, we analyze the underlying reasons for these findings, show how an adversary with limited information could launch an attack, and provide potential solutions. These findings offer actionable insights for deploying MM in security-sensitive machine-learning systems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 65 of its 92 references that are in the map. First posted on arXiv 28 Sep 2025.
Builds on
65 of 92 references.
References · 65
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 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
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2021Scaling Up Visual and Vision-Language Representation Learning With Noisy Text Supervisioncited by 3,864
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2013Describing Textures in the Wildcited by 2,125
38 more
- 2016Adversarial examples in the physical worldcited by 1,769
- 2017EuroSAT: A Novel Dataset and Deep Learning Benchmark for Land Use and Land Cover Classificationcited by 1,496
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2018Obfuscated Gradients Give a False Sense of Security: Circumventing Defenses to Adversarial Examplescited by 1,268
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2022Editing Models with Task Arithmeticcited by 1,120
- 2016Practical Black-Box Attacks against Machine Learningcited by 903
- 2023TIES-Merging: Resolving Interference When Merging Modelscited by 818
- 2017Remote Sensing Image Scene Classification: Benchmark and State of the Artcited by 797
- 2016Universal adversarial perturbationscited by 784
- 2019Square Attack: a query-efficient black-box adversarial attack via random searchcited by 685
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2021Merging Models with Fisher-Weighted Averagingcited by 621
- 2016Delving into Transferable Adversarial Examples and Black-box Attackscited by 536
- 2017Countering Adversarial Images using Input Transformationscited by 520
- 2019On Evaluating Adversarial Robustnesscited by 447
- 2016Transferability in Machine Learning: from Phenomena to Black-Box Attacks using Adversarial Samplescited by 446
- 2019Evading Defenses to Transferable Adversarial Examples by Translation-Invariant Attackscited by 442
- 2022Dataless Knowledge Fusion by Merging Weights of Language Modelscited by 387
- 2020What is being transferred in transfer learning?cited by 368
- 2023LoraHub: Efficient Cross-Task Generalization via Dynamic LoRA Compositioncited by 364
- 2017Measuring Catastrophic Forgetting in Neural Networkscited by 360
- 2019Nesterov Accelerated Gradient and Scale Invariance for Adversarial Attackscited by 355
- 2024Model Merging in LLMs, MLLMs, and Beyond: Methods, Theories, Applications and Opportunitiescited by 254
- 2023AdaMerging: Adaptive Model Merging for Multi-Task Learningcited by 252
- 2023Rewarded soups: towards Pareto-optimal alignment by interpolating weights fine-tuned on diverse rewardscited by 243
- 2022Patching open-vocabulary models by interpolating weightscited by 190
- 2017The Space of Transferable Adversarial Examplescited by 158
- 2023Composing Parameter-Efficient Modules with Arithmetic Operationscited by 156
- 2020Randomized Smoothing of All Shapes and Sizescited by 147
- 2020(De)Randomized Smoothing for Certifiable Defense against Patch Attackscited by 98
- 2024Representation Surgery for Multi-Task Model Mergingcited by 96
- 2019Improving Adversarial Robustness of Ensembles with Diversity Trainingcited by 69
- 2020Curse of Dimensionality on Randomized Smoothing for Certifiable Robustnesscited by 56
- 2023Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivitycited by 50
- 2023A Survey on Transferability of Adversarial Examples across Deep Neural Networkscited by 44
- 2021TRS: Transferability Reduced Ensemble via Encouraging Gradient Diversity and Model Smoothnesscited by 38
50 most cited of 65 All 65 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.