Adversarially Robust Models may not Transfer Better: Sufficient Conditions for Domain Transferability from the View of Regularization
Not on the map. Why?
Abstract (arXiv)
Machine learning (ML) robustness and domain generalization are fundamentally correlated: they essentially concern data distribution shifts under adversarial and natural settings, respectively. On one hand, recent studies show that more robust (adversarially trained) models are more generalizable. On the other hand, there is a lack of theoretical understanding of their fundamental connections. In this paper, we explore the relationship between regularization and domain transferability considering different factors such as norm regularization and data augmentations (DA). We propose a general theoretical framework proving that factors involving the model function class regularization are sufficient conditions for relative domain transferability. Our analysis implies that ``robustness" is neither necessary nor sufficient for transferability; rather, regularization is a more fundamental perspective for understanding domain transferability. We then discuss popular DA protocols (including adversarial training) and show when they can be viewed as the function class regularization under certain conditions and therefore improve generalization. We conduct extensive experiments to verify our theoretical findings and show several counterexamples where robustness and generalization are negatively correlated on different datasets.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 33 of its 56 references that are in the map. First posted on arXiv 3 Feb 2022.
Builds on
33 of 56 references.
References · 33
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2013Intriguing properties of neural networkscited by 5,114
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,976
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,510
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,324
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 950
- 2017Virtual Adversarial Training: A Regularization Method for Supervised and Semi-Supervised Learningcited by 918
- 2013Domain Generalization via Invariant Feature Representationcited by 622
- 2015Optimal Transport for Domain Adaptationcited by 457
- 2017The Effectiveness of Data Augmentation in Image Classification using Deep Learningcited by 368
- 2019HopSkipJumpAttack: A Query-Efficient Decision-Based Attackcited by 328
21 more
- 2020Do Adversarially Robust ImageNet Models Transfer Better?cited by 315
- 2018Characterizing Adversarial Subspaces Using Local Intrinsic Dimensionalitycited by 280
- 2020How Does Mixup Help With Robustness and Generalization?cited by 193
- 2018AutoZOOM: Autoencoder-based Zeroth Order Optimization Method for Attacking Black-box Neural Networkscited by 137
- 2019Robust Learning with Jacobian Regularizationcited by 127
- 2017Dataset Augmentation in Feature Spacecited by 124
- 2018A Kernel Theory of Modern Data Augmentationcited by 106
- 2020On Mixup Regularizationcited by 82
- 2016Understanding data augmentation for classification: when to warp?cited by 74
- 2018Data augmentation instead of explicit regularizationcited by 62
- 2018Learning Invariances using the Marginal Likelihoodcited by 51
- 2020TSS: Transformation-Specific Smoothing for Robustness Certificationcited by 49
- 2021f-Domain-Adversarial Learning: Theory and Algorithmscited by 47
- 2018Characterizing Adversarial Examples Based on Spatial Consistency Information for Semantic Segmentationcited by 40
- 2021TRS: Transferability Reduced Ensemble via Encouraging Gradient Diversity and Model Smoothnesscited by 37
- 2021Adversarial Training Helps Transfer Learning via Better Representationscited by 36
- 2020Controllable Orthogonalization in Training DNNscited by 30
- 2021An Online Learning Approach to Interpolation and Extrapolation in Domain Generalizationcited by 30
- 2020Uncovering the Connections Between Adversarial Transferability and Knowledge Transferabilitycited by 20
- 2019Further advantages of data augmentation on convolutional neural networkscited by 19
- 2021k-Mixup Regularization for Deep Learning via Optimal Transportcited by 14
Built on by
Citing papers per year: 2023: 4; 2024: 2; 2025: 2.
8 papers.
- 2023A Survey on Transferability of Adversarial Examples across Deep Neural Networkscited by 43
- 2023Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferabilitycited by 32
- 2023Efficient Adversarial Contrastive Learning via Robustness-Aware Coreset Selectioncited by 14
- 2023Reliable Evaluation of Adversarial Transferabilitycited by 12
- 2024As Firm As Their Foundations: Can open-sourced foundation models be used to create adversarial examples for downstream tasks?cited by 11
- 2025Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimizationcited by 3
- 2024FedGTST: Boosting Global Transferability of Federated Models via Statistics Tuningcited by 0
- 2025Meta-reinforcement learning with minimum attentioncited by 0
- 2025Meta-reinforcement learning with minimum attention22 May 2025
- 2025Improving Generalization of Universal Adversarial Perturbation via Dynamic Maximin Optimization17 Mar 2025
- 2024FedGTST: Boosting Global Transferability of Federated Models via Statistics Tuning16 Oct 2024
- 2024As Firm As Their Foundations: Can open-sourced foundation models be used to create adversarial examples for downstream tasks?19 Mar 2024
- 2023A Survey on Transferability of Adversarial Examples across Deep Neural Networks26 Oct 2023
- 2023Why Does Little Robustness Help? A Further Step Towards Understanding Adversarial Transferability15 Jul 2023
- 2023Reliable Evaluation of Adversarial Transferability14 Jun 2023
- 2023Efficient Adversarial Contrastive Learning via Robustness-Aware Coreset Selection8 Feb 2023