GFLC: Graph-based Fairness-aware Label Correction for Fair Classification

Modar Sulaiman, Kallol Roy
6/18/2025
cs.LGcs.AI

No official code found. Best implementation: Modar7/GFLC (0 stars, MIT, last commit 2025-07-25).

Abstract

Fairness in machine learning (ML) has a critical importance for building trustworthy machine learning system as artificial intelligence (AI) systems increasingly impact various aspects of society, including healthcare decisions and legal judgments. Moreover, numerous studies demonstrate evidence of unfair outcomes in ML and the need for more robust fairness-aware methods. However, the data we use to train and develop debiasing techniques often contains biased and noisy labels. As a result, the label bias in the training data affects model performance and misrepresents the fairness of classifiers during testing. To tackle this problem, our paper presents Graph-based Fairness-aware Label Correction (GFLC), an efficient method for correcting label noise while preserving demographic parity in datasets. In particular, our approach combines three key components: prediction confidence measure, graph-based regularization through Ricci-flow-optimized graph Laplacians, and explicit demographic parity incentives. Our experimental findings show the effectiveness of our proposed approach and show significant improvements in the trade-off between performance and fairness metrics compared to the baseline.

View on arXivView PDF

Code Implementations(1)

Modar7/GFLCCommunity75%
MIT

GFLC: Graph-based Fairness-aware Label Correction for Fair Classification

00PythonJul 24, 20251 years agoMIT

Similar Papers

Cite this paper

@article{sulaiman2025gflc,
  title  = {GFLC: Graph-based Fairness-aware Label Correction for Fair Classification},
  author = {Modar Sulaiman and Kallol Roy},
  year   = {2025},
  eprint = {2506.15620},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2506.15620v1}
}

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/2506.15620.svg)](https://codeofpaper.com/paper/2506.15620)

Discussion