Table of Contents
Fetching ...

Fair Representation Learning with Controllable High Confidence Guarantees via Adversarial Inference

Yuhong Luo, Austin Hoag, Xintong Wang, Philip S. Thomas, Przemyslaw A. Grabowicz

TL;DR

This work tackles the problem of ensuring fair representations in downstream tasks by providing high-confidence guarantees for demographic parity. It introduces FRG, a framework that combines candidate selection, adversarial inference, and a fairness test to produce representations whose worst-case downstream DP disparity $\Delta_{\text{DP}}(\tau,\phi)$ remains below a user-specified threshold $\varepsilon$ with probability at least $1-\delta$. The method formalizes $g_{\varepsilon}(\phi) = \sup_{\tau} \Delta_{\text{DP}}(\tau,\phi) - \varepsilon$ and uses a 1-$(\delta)$ confidence upper bound $U_{\varepsilon}(\phi, D_f)$ derived from an optimal adversary to certify fairness, returning NSF when certification is not possible. Empirically, FRG demonstrates strong fairness guarantees across three real-world datasets while maintaining competitive predictive performance, outperforming six SOTA fair representation learning methods in consistently bounding DP disparity under adversarial evaluation. The work provides a practical, principled pathway for producing fair representations with explicit, tunable guarantees, highlighting limitations such as i.i.d. assumptions and reliance on approximate adversaries while outlining future extensions to other fairness notions and distributional shifts.

Abstract

Representation learning is increasingly applied to generate representations that generalize well across multiple downstream tasks. Ensuring fairness guarantees in representation learning is crucial to prevent unfairness toward specific demographic groups in downstream tasks. In this work, we formally introduce the task of learning representations that achieve high-confidence fairness. We aim to guarantee that demographic disparity in every downstream prediction remains bounded by a *user-defined* error threshold $ε$, with *controllable* high probability. To this end, we propose the ***F**air **R**epresentation learning with high-confidence **G**uarantees (FRG)* framework, which provides these high-confidence fairness guarantees by leveraging an optimized adversarial model. We empirically evaluate FRG on three real-world datasets, comparing its performance to six state-of-the-art fair representation learning methods. Our results demonstrate that FRG consistently bounds unfairness across a range of downstream models and tasks.

Fair Representation Learning with Controllable High Confidence Guarantees via Adversarial Inference

TL;DR

This work tackles the problem of ensuring fair representations in downstream tasks by providing high-confidence guarantees for demographic parity. It introduces FRG, a framework that combines candidate selection, adversarial inference, and a fairness test to produce representations whose worst-case downstream DP disparity remains below a user-specified threshold with probability at least . The method formalizes and uses a 1- confidence upper bound derived from an optimal adversary to certify fairness, returning NSF when certification is not possible. Empirically, FRG demonstrates strong fairness guarantees across three real-world datasets while maintaining competitive predictive performance, outperforming six SOTA fair representation learning methods in consistently bounding DP disparity under adversarial evaluation. The work provides a practical, principled pathway for producing fair representations with explicit, tunable guarantees, highlighting limitations such as i.i.d. assumptions and reliance on approximate adversaries while outlining future extensions to other fairness notions and distributional shifts.

Abstract

Representation learning is increasingly applied to generate representations that generalize well across multiple downstream tasks. Ensuring fairness guarantees in representation learning is crucial to prevent unfairness toward specific demographic groups in downstream tasks. In this work, we formally introduce the task of learning representations that achieve high-confidence fairness. We aim to guarantee that demographic disparity in every downstream prediction remains bounded by a *user-defined* error threshold , with *controllable* high probability. To this end, we propose the ***F**air **R**epresentation learning with high-confidence **G**uarantees (FRG)* framework, which provides these high-confidence fairness guarantees by leveraging an optimized adversarial model. We empirically evaluate FRG on three real-world datasets, comparing its performance to six state-of-the-art fair representation learning methods. Our results demonstrate that FRG consistently bounds unfairness across a range of downstream models and tasks.
Paper Structure (43 sections, 10 theorems, 26 equations, 13 figures, 2 tables)

This paper contains 43 sections, 10 theorems, 26 equations, 13 figures, 2 tables.

Key Result

Theorem 5.2

Suppose $S,\hat{Y} \in \{0,1\}$ are Bernoulli random variables. We have $\Delta_{\text{DP}}(\tau, \phi) = \frac{|\mathrm{Cov}(\hat{Y},S)|}{\text{Var}(S)}$. Proof. See Appendix apd:dp_cov.

Figures (13)

  • Figure 1: An overview of the FRG framework. Given a dataset $D$, with probability $1-\delta$, FRG generates an "$\varepsilon$-fair" representation model, or returns NSF if such a model cannot be found. See Section \ref{['sec:method']} for discussion.
  • Figure 2: The evaluation on the Adult dataset. The target label is income and the sensitive attribute is gender. We vary $\varepsilon\in \{0.04, 0.08, 0.12, 0.16\}$. $\delta$ is fixed at 0.1. The four plots on the left are: (1) the average AUC; (2) the average $\Delta_\text{DP}$; (3) the fraction of trials that returns a solution excluding NSF; (4) the fraction of trials that violates $\Delta_{\text{DP}}(\tau, \phi) \le \varepsilon$ on the ground truth dataset. The AUC and $\Delta_\text{DP}$ on the adversarial task are on the right.
  • Figure 3: The evaluation on the Health dataset with sensitive attribute gender. The original target task predicting Charlson Index is in Appendix Figure \ref{['fig:health_more_downstream']}. Here, we show the transfer learning capabilities on predicting age.
  • Figure 4: The evaluation on the Income dataset. The target label is income and the sensitive attribute is marital status which has 5 classes. We vary $\varepsilon\in \{0.16, 0.24, 0.32, 0.40, 0.48\}$.
  • Figure 5: The evaluation on the Health dataset. The target label is Charlson Index. We vary $\varepsilon\in \{0.04, 0.08, 0.12, 0.16\}$. $\delta$ is fixed at 0.1.
  • ...and 8 more figures

Theorems & Definitions (19)

  • Definition 3.1: Demographic disparity measure
  • Definition 4.1: "$\varepsilon$-fair" representation model
  • Definition 4.2: A representation learning algorithm with high-confidence fairness guarantees
  • Definition 5.1: Optimal adversary
  • Theorem 5.2
  • Theorem 5.3
  • Definition A.1: $\Delta_{\text{DP}}$ for multiclass $S$
  • Lemma B.1
  • Theorem B.2: Theorem \ref{['thm:dp_cov']} restated
  • Definition C.1: Equal Opportunity Difference
  • ...and 9 more