提出新方法让算法公平处理年龄收入等连续敏感信息
Fair Representation Learning for Continuous Sensitive Attributes using Expectation of Integral Probability Metrics
- 用期望积分概率度量评估连续敏感属性的公平性
- 理论证明低度量值可确保任意预测头都公平
- 新算法FREM在多个数据集上超越现有方法
人工智能公平性旨在避免算法对个体或群体产生偏见。近年来,公平表征学习(FRL)受到广泛关注,但现有方法主要针对分类敏感属性,难以处理年龄、收入等连续敏感属性。本文提出一种面向连续敏感属性的FRL算法。首先引入期望积分概率度量(EIPM)来评估表征空间的公平性;理论证明:若表征分布的EIPM值较低,则无论选择何种预测头,其输出均保持公平。此外,EIPM可通过有限样本的估计器准确计算。基于此,提出新的公平表征算法FREM。实验表明,FREM在多个基准数据集上优于现有方法。
原文摘要 · Abstract (English)
AI fairness, also known as algorithmic fairness, aims to ensure that algorithms operate without bias or discrimination towards any individual or group. Among various AI algorithms, the Fair Representation Learning (FRL) approach has gained significant interest in recent years. However, existing FRL algorithms have a limitation: they are primarily designed for categorical sensitive attributes and thus cannot be applied to continuous sensitive attributes, such as age or income. In this paper, we propose an FRL algorithm for continuous sensitive attributes. First, we introduce a measure called the Expectation of Integral Probability Metrics (EIPM) to assess the fairness level of representation space for continuous sensitive attributes. We demonstrate that if the distribution of the representation has a low EIPM value, then any prediction head constructed on the top of the representation become fair, regardless of the selection of the prediction head. Furthermore, EIPM possesses a distinguished advantage in that it can be accurately estimated using our proposed estimator with finite samples. Based on these properties, we propose a new FRL algorithm called Fair Representation using EIPM with MMD (FREM). Experimental evidences show that FREM outperforms other baseline methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。