Pith

open record

sign in
Browse

arxiv: 2505.06435 · v1 · pith:IZMT2KRM · submitted 2025-05-09 · stat.ML · cs.LG

Fair Representation Learning for Continuous Sensitive Attributes using Expectation of Integral Probability Metrics

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:IZMT2KRMrecord.jsonopen to challenge →

classification stat.ML cs.LG
keywords representationattributessensitivecontinuouseipmfairalgorithmsfairness
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.