Sufficient Invariant Learning for Distribution Shift
Not on the map. Why?
Abstract (arXiv)
Learning robust models under distribution shifts between training and test datasets is a fundamental challenge in machine learning. While learning invariant features across environments is a popular approach, it often assumes that these features are fully observed in both training and test sets, a condition frequently violated in practice. When models rely on invariant features absent in the test set, their robustness in new environments can deteriorate. To tackle this problem, we introduce a novel learning principle called the Sufficient Invariant Learning (SIL) framework, which focuses on learning a sufficient subset of invariant features rather than relying on a single feature. After demonstrating the limitation of existing invariant learning methods, we propose a new algorithm, Adaptive Sharpness-aware Group Distributionally Robust Optimization (ASGDRO), to learn diverse invariant features by seeking common flat minima across the environments. We theoretically demonstrate that finding a common flat minima enables robust predictions based on diverse invariant features. Empirical evaluations on multiple datasets, including our new benchmark, confirm ASGDRO's robustness against distribution shifts, highlighting the limitations of existing methods.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 42 of its 68 references that are in the map. First posted on arXiv 24 Oct 2022.
Builds on
42 of 68 references.
References · 42
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2016Grad-CAM: Visual Explanations from Deep Networks via Gradient-based Localizationcited by 6,690
- 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
- 2014Deep Learning Face Attributes in the Wildcited by 3,679
- 2017A Broad-Coverage Challenge Corpus for Sentence Understanding through Inferencecited by 2,665
- 2019Invariant Risk Minimizationcited by 1,832
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,327
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,181
30 more
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2017Deeper, Broader and Artier Domain Generalizationcited by 983
- 2021Robust fine-tuning of zero-shot modelscited by 785
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
- 2018Recognition in Terra Incognitacited by 655
- 2013Domain Generalization via Invariant Feature Representationcited by 622
- 2017Exploring Generalization in Deep Learningcited by 595
- 2021Just Train Twice: Improving Group Robustness without Training Group Informationcited by 522
- 2022Git Re-Basin: Merging Models modulo Permutation Symmetriescited by 460
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
- 2019Nuanced Metrics for Measuring Unintended Bias with Real Data for Text Classificationcited by 396
- 2022Last Layer Re-Training is Sufficient for Robustness to Spurious Correlationscited by 379
- 2020What is being transferred in transfer learning?cited by 365
- 2020Environment Inference for Invariant Learningcited by 306
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
- 2021Gradient Matching for Domain Generalizationcited by 258
- 2021Invariance Principle Meets Information Bottleneck for Out-of-Distribution Generalizationcited by 220
- 2022Improving Out-of-Distribution Robustness via Selective Augmentationcited by 202
- 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
- 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
- 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148
- 2019Distributionally Robust Language Modelingcited by 142
- 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
- 2022Penalizing Gradient Norm for Efficiently Improving Generalization in Deep Learningcited by 122
- 2022Sharpness-Aware Training for Freecited by 95
- 2022Pareto Invariant Risk Minimization: Towards Mitigating the Optimization Dilemma in Out-of-Distribution Generalizationcited by 38
- 2022Rich Feature Construction for the Optimization-Generalization Dilemmacited by 34
- 2022UMIX: Improving Importance Weighting for Subpopulation Shift via Uncertainty-Aware Mixupcited by 34
Built on by
Citing papers per year: 2024: 2; 2025: 0; 2026: 3.
5 papers.
- 2024FlatNAS: optimizing Flatness in Neural Architecture Search for Out-of-Distribution Robustnesscited by 5
- 2024Flat Posterior Does Matter For Bayesian Model Averagingcited by 1
- 2026Outsmarting the Chameleon: Counterfactual Decoupling for Tactical OOD Shifts in Live Streaming Risk Assessmentcited by 1
- 2026Autonomous Drift Learning in Data Streams: A Unified Perspectivecited by 0
- 2026Beyond Empirical Support: Structured Outlier Generation via Sinkhorn Optimal Transportcited by 0
- 2026Beyond Empirical Support: Structured Outlier Generation via Sinkhorn Optimal Transport25 Sep 2026
- 2026Outsmarting the Chameleon: Counterfactual Decoupling for Tactical OOD Shifts in Live Streaming Risk Assessment1 Jun 2026
- 2026Autonomous Drift Learning in Data Streams: A Unified Perspective2 May 2026
- 2024Flat Posterior Does Matter For Bayesian Model Averaging21 Jun 2024
- 2024FlatNAS: optimizing Flatness in Neural Architecture Search for Out-of-Distribution Robustness29 Feb 2024