Diversity Boosted Learning for Domain Generalization with Large Number of Domains
Not on the map. Why?
Abstract (arXiv)
Machine learning algorithms minimizing the average training loss usually suffer from poor generalization performance due to the greedy exploitation of correlations among the training data, which are not stable under distributional shifts. It inspires various works for domain generalization (DG), where a series of methods, such as Causal Matching and FISH, work by pairwise domain operations. They would need O(n2) pairwise domain operations with n domains, where each one is often highly expensive. Moreover, while a common objective in the DG literature is to learn invariant representations against domain-induced spurious correlations, we highlight the importance of mitigating spurious correlations caused by objects. Based on the observation that diversity helps mitigate spurious correlations, we propose a Diversity boosted twO-level saMplIng framework (DOMI) utilizing Determinantal Point Processes (DPPs) to efficiently sample the most informative ones among large number of domains. We show that DOMI helps train robust models against spurious correlations from both domain-side and object-side, substantially enhancing the performance of the backbone DG algorithms on rotated MNIST, rotated Fashion MNIST, and iwildcam datasets.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 29 of its 35 references that are in the map. First posted on arXiv 28 Jul 2022.
Builds on
29 of 35 references.
References · 29
- 2015Domain-Adversarial Training of Neural Networkscited by 3,023
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2019Invariant Risk Minimizationcited by 1,832
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2015Learning Transferable Features with Deep Adaptation Networkscited by 1,323
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2017CyCADA: Cycle-Consistent Adversarial Domain Adaptationcited by 1,079
- 2021Generalizing to Unseen Domains: A Survey on Domain Generalizationcited by 762
- 2021Domain Generalization: A Surveycited by 760
- 2020Out-of-Distribution Generalization via Risk Extrapolation (REx)cited by 737
- 2013Domain Generalization via Invariant Feature Representationcited by 622
- 2021Towards Out-Of-Distribution Generalization: A Surveycited by 431
17 more
- 2020The Risks of Invariant Risk Minimizationcited by 262
- 2021Gradient Matching for Domain Generalizationcited by 258
- 2020Domain Generalization using Causal Matchingcited by 224
- 2020Invariant Risk Minimization Gamescited by 188
- 2016Statistics of Robust Optimization: A Generalized Empirical Likelihood Approachcited by 182
- 2018Domain Generalization via Conditional Invariant Representationcited by 146
- 2020Efficient Domain Generalization via Common-Specific Low-Rank Decompositioncited by 134
- 2021Does Invariant Risk Minimization Capture Invariance?cited by 116
- 2015Scatter Component Analysis: A Unified Framework for Domain Adaptation and Domain Generalizationcited by 96
- 2021Heterogeneous Risk Minimizationcited by 90
- 2019Domain Generalization via Multidomain Discriminant Analysiscited by 69
- 2020Empirical or Invariant Risk Minimization? A Sample Complexity Perspectivecited by 62
- 2021DORO: Distributional and Outlier Robust Optimizationcited by 54
- 2022DrugOOD: Out-of-Distribution (OOD) Dataset Curator and Benchmark for AI-aided Drug Discovery -- A Focus on Affinity Prediction Problems with Noise Annotationscited by 54
- 2020Invariant Representation Learning for Treatment Effect Estimationcited by 25
- 2020Learning Causal Models Onlinecited by 18
- 2015Efficient Sampling for k-Determinantal Point Processescited by 11
Built on by
Not cited yet.