Fair Graph Representation Learning via Sensitive Attribute Disentanglement
Yuchang Zhu, Jintang Li, Zibin Zheng, Liang Chen

TL;DR
This paper introduces FairSAD, a novel GNN framework that improves fairness by disentangling sensitive attribute information, preserving task-related data, and outperforming existing methods in fairness and utility on real-world datasets.
Contribution
FairSAD is the first approach to enhance GNN fairness through sensitive attribute disentanglement without eliminating sensitive information entirely.
Findings
Outperforms state-of-the-art fairness methods
Maintains higher task utility while improving fairness
Effective on multiple real-world datasets
Abstract
Group fairness for Graph Neural Networks (GNNs), which emphasizes algorithmic decisions neither favoring nor harming certain groups defined by sensitive attributes (e.g., race and gender), has gained considerable attention. In particular, the objective of group fairness is to ensure that the decisions made by GNNs are independent of the sensitive attribute. To achieve this objective, most existing approaches involve eliminating sensitive attribute information in node representations or algorithmic decisions. However, such ways may also eliminate task-related information due to its inherent correlation with the sensitive attribute, leading to a sacrifice in utility. In this work, we focus on improving the fairness of GNNs while preserving task-related information and propose a fair GNN framework named FairSAD. Instead of eliminating sensitive attribute information, FairSAD enhances the…
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
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsImbalanced Data Classification Techniques · Ethics and Social Impacts of AI · Advanced Graph Neural Networks
MethodsFocus
