FEED: Fairness-Enhanced Meta-Learning for Domain Generalization
Not on the map. Why?
Abstract (arXiv)
Generalizing to out-of-distribution data while being aware of model fairness is a significant and challenging problem in meta-learning. The goal of this problem is to find a set of fairness-aware invariant parameters of classifier that is trained using data drawn from a family of related training domains with distribution shift on non-sensitive features as well as different levels of dependence between model predictions and sensitive features so that the classifier can achieve good generalization performance on unknown but distinct test domains. To tackle this challenge, existing state-of-the-art methods either address the domain generalization problem but completely ignore learning with fairness or solely specify shifted domains with various fairness levels. This paper introduces an approach to fairness-aware meta-learning that significantly enhances domain generalization capabilities. Our framework, Fairness-Enhanced Meta-Learning for Domain Generalization (FEED), disentangles latent data representations into content, style, and sensitive vectors. This disentanglement facilitates the robust generalization of machine learning models across diverse domains while adhering to fairness constraints. Unlike traditional methods that focus primarily on domain invariance or sensitivity to shifts, our model integrates a fairness-aware invariance criterion directly into the meta-learning process. This integration ensures that the learned parameters uphold fairness consistently, even when domain characteristics vary widely. We validate our approach through extensive experiments across multiple benchmarks, demonstrating not only superior performance in maintaining high accuracy and fairness but also significant improvements over existing state-of-the-art methods in domain generalization tasks.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 25 of its 32 references that are in the map. First posted on arXiv 2 Nov 2024.
Builds on
25 of 32 references.
References · 25
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2022Generative Adversarial Networkscited by 5,603
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 2019Invariant Risk Minimizationcited by 1,832
- 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
- 2019Distributionally Robust Neural Networks for Group Shifts: On the Importance of Regularization for Worst-Case Generalizationcited by 1,232
- 2017High-Resolution Image Synthesis and Semantic Manipulation with Conditional GANscited by 1,176
- 2020In Search of Lost Domain Generalizationcited by 1,042
- 2018Multimodal Unsupervised Image-to-Image Translationcited by 795
- 2017Learning to Generalize: Meta-Learning for Domain Generalizationcited by 762
- 2018Fairness Without Demographics in Repeated Loss Minimizationcited by 363
- 2020Environment Inference for Invariant Learningcited by 306
13 more
- 2020Learning to Generate Novel Domains for Domain Generalizationcited by 296
- 2015YFCC100M: The New Data in Multimedia Researchcited by 234
- 2020Improve Unsupervised Domain Adaptation with Mixup Trainingcited by 185
- 2021Model-Based Domain Generalizationcited by 103
- 2020Continual Adaptation of Visual Representations via Domain Randomization and Meta-learningcited by 54
- 2022Learning Fair Representation via Distributional Contrastive Disentanglementcited by 31
- 2024Supervised Algorithmic Fairness in Distribution Shifts: A Surveycited by 23
- 2020Rank-Based Multi-task Learning for Fair Regressioncited by 19
- 2021Fairness-Aware Online Meta-learningcited by 19
- 2022Adaptive Fairness-Aware Online Meta-Learning for Changing Environmentscited by 17
- 2023Towards Fair Disentangled Online Learning for Changing Environmentscited by 11
- 2023Algorithmic Fairness Generalization under Covariate and Dependence Shifts Simultaneouslycited by 7
- 2024Fairness-Aware Meta-Learning via Nash Bargainingcited by 6
Built on by
Citing papers per year: 2024: 2; 2025: 1.
3 papers.