让模型在跨域泛化时自动保持公平性,避免歧视。
FEED: Fairness-Enhanced Meta-Learning for Domain Generalization
- 将数据特征拆解为内容、风格和敏感信息三部分,分别处理。
- 在多个测试集上同时实现高准确率与强公平性,优于现有方法。
- 适合关注模型公平性的跨域学习研究者或应用开发者。
在元学习中实现对分布外数据的泛化能力并兼顾模型公平性,是一个重要且具有挑战性的问题。目标是找到一组公平感知的分类器不变参数,这些参数基于来自相关训练域的数据进行训练,其非敏感特征存在分布偏移,且模型预测与敏感特征之间的依赖程度各异,从而使分类器在未知但不同的测试域上获得良好泛化性能。现有最先进方法要么仅解决领域泛化问题而忽略公平性,要么仅设定不同公平水平下的分布偏移域。本文提出一种公平感知元学习框架——FEED,将潜在数据表示解耦为内容、风格和敏感向量。该解耦机制有助于模型在多样化领域间实现稳健泛化,并满足公平性约束。不同于传统方法主要关注领域不变性或对偏移的敏感性,本模型将公平感知不变性准则直接融入元学习过程,确保所学参数在领域特性广泛变化时仍保持一致性公平性。通过在多个基准上的大量实验验证,本方法不仅在维持高准确率与公平性方面表现优异,且在领域泛化任务中显著优于现有最先进方法。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。