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

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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Pattern Analysis and Machine Intelligence
Published
2025-02-05
DOI
https://doi.org/10.1109/tpami.2025.3538915
Citations
1
Primary Topic
Bayesian Modeling and Causal Inference
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

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

Yongdai Kim, Insung Kong, Kunwoong Kim
1 citations
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bayesian Modeling and Causal Inference
2.48
article

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

Yongdai Kim, Insung Kong, Kunwoong Kim
article en
1 citations

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.

IEEE Transactions on Pattern Analysis and Machine IntelligenceVol. 47(5)
Seoul National University (KR), University of Twente (NL)
Reduced inequalities
Openalex Percentile: Top 12%
Bayesian Modeling and Causal Inference
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Fair Representation Learning for Continuous Sensitive Attributes Using Expectation of Integral Probability Metrics — Yongdai Kim, Insung Kong, et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence (2025) | TGRS Research Map | TGRS