mlsanityData to 14 Oct 2026

Winning Prize Comes from Losing Tickets: Improve Invariant Learning by Exploring Variant Parameters for Out-of-Distribution Generalization

arXiv 2310.16391 ↗First posted 25 Oct 2023cs.LG cs.CVcited by 12

Not on the map. Why?

Abstract (arXiv)

Out-of-Distribution (OOD) Generalization aims to learn robust models that generalize well to various environments without fitting to distribution-specific features. Recent studies based on Lottery Ticket Hypothesis (LTH) address this problem by minimizing the learning target to find some of the parameters that are critical to the task. However, in OOD problems, such solutions are suboptimal as the learning task contains severe distribution noises, which can mislead the optimization process. Therefore, apart from finding the task-related parameters (i.e., invariant parameters), we propose Exploring Variant parameters for Invariant Learning (EVIL) which also leverages the distribution knowledge to find the parameters that are sensitive to distribution shift (i.e., variant parameters). Once the variant parameters are left out of invariant learning, a robust subnetwork that is resistant to distribution shift can be found. Additionally, the parameters that are relatively stable across distributions can be considered invariant ones to improve invariant learning. By fully exploring both variant and invariant parameters, our EVIL can effectively identify a robust subnetwork to improve OOD generalization. In extensive experiments on integrated testbed: DomainBed, EVIL can effectively and efficiently enhance many popular methods, such as ERM, IRM, SAM, etc.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 81 of its 118 references that are in the map. First posted on arXiv 25 Oct 2023.

Builds on

81 of 118 references.

References · 81

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,744
  4. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  5. 2016Wide Residual Networkscited by 3,070
  6. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  7. 2014Unsupervised Domain Adaptation by Backpropagationcited by 1,917
  8. 2019Invariant Risk Minimizationcited by 1,854
  9. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,850
  10. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,515
  11. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
  12. 2019Natural Adversarial Examplescited by 1,408
38 more
  1. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
  2. 2018Moment Matching for Multi-Source Domain Adaptationcited by 1,331
  3. 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,247
  4. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  5. 2016Deep CORAL: Correlation Alignment for Deep Domain Adaptationcited by 1,200
  6. 2017Deep Hashing Network for Unsupervised Domain Adaptationcited by 1,188
  7. 2020In Search of Lost Domain Generalizationcited by 1,054
  8. 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,013
  9. 2017Deeper, Broader and Artier Domain Generalizationcited by 986
  10. 2018Robustness May Be at Odds with Accuracycited by 880
  11. 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 812
  12. 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 763
  13. 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 742
  14. 2018Recognition in Terra Incognitacited by 658
  15. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  16. 2013Domain Generalization via Invariant Feature Representationcited by 623
  17. 2017Learning Sparse Neural Networks through L0 Regularizationcited by 583
  18. 2021Domain Generalization with MixStylecited by 566
  19. 2019Rigging the Lottery: Making All Tickets Winnerscited by 495
  20. 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 434
  21. 2020Self-Challenging Improves Cross-Domain Generalizationcited by 426
  22. 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 328
  23. 2021Self-Supervised Learning with Data Augmentations Provably Isolates Content from Stylecited by 312
  24. 2020Environment Inference for Invariant Learningcited by 306
  25. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  26. 2019An Investigation into Neural Net Optimization via Hessian Eigenvalue Densitycited by 292
  27. 2021Exploring the Limits of Out-of-Distribution Detectioncited by 283
  28. 2020The Risks of Invariant Risk Minimizationcited by 262
  29. 2015Domain Generalization for Object Recognition with Multi-task Autoencoderscited by 253
  30. 2019Adversarial Domain Adaptation with Domain Mixupcited by 250
  31. 2021Training Neural Networks with Fixed Sparse Maskscited by 214
  32. 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 213
  33. 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 201
  34. 2020Representation Learning via Invariant Causal Mechanismscited by 199
  35. 2021Fishr: Invariant Gradient Variances for Out-of-Distribution Generalizationcited by 186
  36. 2017Domain Generalization by Marginal Transfer Learningcited by 180
  37. 2019Causal Discovery from Heterogeneous/Nonstationary Data with Independent Changescited by 166
  38. 2022Diverse Weight Averaging for Out-of-Distribution Generalizationcited by 148

50 most cited of 81 All 81 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 5; 2026: 2.

12 papers.