BeMap: Balanced Message Passing for Fair Graph Neural Network

Xiao Lin, Jian Kang, Weilin Cong, Hanghang Tong
6/7/2023
cs.LGcs.AIcs.SI

Official code: xiaolin-cs/BeMap (3 stars, MIT, PyTorch, last commit 2024-04-11).

Abstract

Fairness in graph neural networks has been actively studied recently. However, existing works often do not explicitly consider the role of message passing in introducing or amplifying the bias. In this paper, we first investigate the problem of bias amplification in message passing. We empirically and theoretically demonstrate that message passing could amplify the bias when the 1-hop neighbors from different demographic groups are unbalanced. Guided by such analyses, we propose BeMap, a fair message passing method, that leverages a balance-aware sampling strategy to balance the number of the 1-hop neighbors of each node among different demographic groups. Extensive experiments on node classification demonstrate the efficacy of BeMap in mitigating bias while maintaining classification accuracy. The code is available at https://github.com/xiaolin-cs/BeMap.

View on arXivView PDF

Code Implementations(1)

xiaolin-cs/BeMapOfficial100%
PyTorchMIT

Balanced Message Passing for Fair Graph Neural Network

30Python2 years agoMIT
deep-learningfairnessgraph-neural-networksmachine-learningpytorch

Similar Papers

Cite this paper

@article{lin2023bemap,
  title  = {BeMap: Balanced Message Passing for Fair Graph Neural Network},
  author = {Xiao Lin and Jian Kang and Weilin Cong and Hanghang Tong},
  year   = {2023},
  eprint = {2306.04107},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.04107v2}
}

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

Discussion