DAFT: Distilling Adversarially Fine-tuned Models for Better OOD Generalization
Not on the map. Why?
Abstract (arXiv)
We consider the problem of OOD generalization, where the goal is to train a model that performs well on test distributions that are different from the training distribution. Deep learning models are known to be fragile to such shifts and can suffer large accuracy drops even for slightly different test distributions. We propose a new method - DAFT - based on the intuition that adversarially robust combination of a large number of rich features should provide OOD robustness. Our method carefully distills the knowledge from a powerful teacher that learns several discriminative features using standard training while combining them using adversarial training. The standard adversarial training procedure is modified to produce teachers which can guide the student better. We evaluate DAFT on standard benchmarks in the DomainBed framework, and demonstrate that DAFT achieves significant improvements over the current state-of-the-art OOD generalization methods. DAFT consistently out-performs well-tuned ERM and distillation baselines by up to 6%, with more pronounced gains for smaller networks.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 44 of its 54 references that are in the map. First posted on arXiv 19 Aug 2022.
Builds on
44 of 54 references.
References · 44
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2015Distilling the Knowledge in a Neural Networkcited by 10,324
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2013Intriguing properties of neural networkscited by 5,155
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2015Domain-Adversarial Training of Neural Networkscited by 3,044
- 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,877
- 2019Searching for MobileNetV3cited by 1,994
- 2019Invariant Risk Minimizationcited by 1,854
- 2019Theoretically Principled Trade-off between Robustness and Accuracycited by 1,517
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
32 more
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
- 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,200
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
- 2020In Search of Lost Domain Generalizationcited by 1,054
- 2017Deeper, Broader and Artier Domain Generalizationcited by 986
- 2019Adversarial Examples Are Not Bugs, They Are Featurescited by 953
- 2019Contrastive Representation Distillationcited by 748
- 2022Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distributioncited by 739
- 2018Recognition in Terra Incognitacited by 658
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 436
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 381
- 2017Certifying Some Distributional Robustness with Principled Adversarial Trainingcited by 337
- 2018Learning Models with Uniform Performance via Distributionally Robust Optimizationcited by 335
- 2018Generalizing Across Domains via Cross-Gradient Trainingcited by 268
- 2021Accuracy on the Line: On the Strong Correlation Between Out-of-Distribution and In-Distribution Generalizationcited by 249
- 2018Adversarial Logit Pairingcited by 224
- 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
- 2020Large-Scale Methods for Distributionally Robust Optimizationcited by 179
- 2020Efficient Domain Generalization via Common-Specific Low-Rank Decompositioncited by 134
- 2022Domain Generalization by Mutual-Information Regularization with Pre-trained Modelscited by 133
- 2015Distributionally Robust Logistic Regressioncited by 126
- 2019Adversarially Robust Distillationcited by 125
- 2020Heterogeneous Domain Generalization via Domain Mixupcited by 103
- 2021Shifts: A Dataset of Real Distributional Shift Across Multiple Large-Scale Taskscited by 101
- 2021Revisiting Adversarial Robustness Distillation: Robust Soft Labels Make Student Bettercited by 79
- 2021Can Subnetwork Structure be the Key to Out-of-Distribution Generalization?cited by 75
- 2022Domain-Adjusted Regression or: ERM May Already Learn Features Sufficient for Out-of-Distribution Generalizationcited by 69
- 2021Improved OOD Generalization via Adversarial Training and Pre-trainingcited by 66
- 2021Reliable Adversarial Distillation with Unreliable Teacherscited by 56
- 2019Pseudo-Labeling Curriculum for Unsupervised Domain Adaptationcited by 46
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Simplicity Bias in 1-Hidden Layer Neural Networkscited by 26
- 2023Simplicity Bias in 1-Hidden Layer Neural Networks1 Feb 2023