Chasing Fairness in Graphs: A GNN Architecture Perspective
Zhimeng Jiang, Xiaotian Han, Chao Fan, Zirui Liu, Na Zou, Ali, Mostafavi, Xia Hu

TL;DR
This paper introduces FMP, a novel GNN architecture that explicitly incorporates fairness considerations into the message passing process, improving fairness and accuracy in node classification without data pre-processing.
Contribution
The paper proposes FMP, a new GNN architecture that explicitly embeds fairness into the model's forward pass, addressing bias amplification issues inherent in traditional neighbor aggregation methods.
Findings
FMP outperforms baselines in fairness and accuracy on real datasets.
FMP explicitly uses sensitive attributes during forward propagation.
The approach avoids data pre-processing for fairness enhancement.
Abstract
There has been significant progress in improving the performance of graph neural networks (GNNs) through enhancements in graph data, model architecture design, and training strategies. For fairness in graphs, recent studies achieve fair representations and predictions through either graph data pre-processing (e.g., node feature masking, and topology rewiring) or fair training strategies (e.g., regularization, adversarial debiasing, and fair contrastive learning). How to achieve fairness in graphs from the model architecture perspective is less explored. More importantly, GNNs exhibit worse fairness performance compared to multilayer perception since their model architecture (i.e., neighbor aggregation) amplifies biases. To this end, we aim to achieve fairness via a new GNN architecture. We propose \textsf{F}air \textsf{M}essage \textsf{P}assing (FMP) designed within a unified…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsAdvanced Graph Neural Networks
