Learning Fair Representations with High-Confidence Guarantees

Yuhong Luo, Austin Hoag, Philip S. Thomas
10/23/2023
cs.LGcs.CYstat.ML

Official code: JamesLuoyh/FRG (0 stars, BSD-3-Clause, last commit 2025-01-28).

Abstract

Representation learning is increasingly employed to generate representations that are predictive across multiple downstream tasks. The development of representation learning algorithms that provide strong fairness guarantees is thus important because it can prevent unfairness towards disadvantaged groups for all downstream prediction tasks. To prevent unfairness towards disadvantaged groups in all downstream tasks, it is crucial to provide representation learning algorithms that provide fairness guarantees. In this paper, we formally define the problem of learning representations that are fair with high confidence. We then introduce the Fair Representation learning with high-confidence Guarantees (FRG) framework, which provides high-confidence guarantees for limiting unfairness across all downstream models and tasks, with user-defined upper bounds. After proving that FRG ensures fairness for all downstream models and tasks with high probability, we present empirical evaluations that demonstrate FRG's effectiveness at upper bounding unfairness for multiple downstream models and tasks.

View on arXivView PDF

Code Implementations(1)

BSD-3-Clause

Fair Representation learning with high-confidence Guarantees

00Shell, PythonSep 27, 20231 years agoBSD-3-Clause

Similar Papers

Cite this paper

@article{luo2023learning,
  title  = {Learning Fair Representations with High-Confidence Guarantees},
  author = {Yuhong Luo and Austin Hoag and Philip S. Thomas},
  year   = {2023},
  eprint = {2310.15358},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2310.15358v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2310.15358.svg)](https://codeofpaper.com/paper/2310.15358)

Discussion