Towards Fair Graph Representation Learning in Social Networks
Guixian Zhang, Guan Yuan, Debo Cheng, Lin Liu, Jiuyong Li, Shichao, Zhang

TL;DR
This paper introduces EAGNN, a novel fairness-aware GNN method that mitigates social homophily effects to produce fairer node representations in social networks, achieving state-of-the-art fairness performance.
Contribution
It identifies social homophily as a key cause of unfairness in GNNs and proposes EAGNN with constraints based on sufficiency, independence, and separation for fair graph learning.
Findings
EAGNN outperforms existing methods on fairness metrics.
EAGNN maintains competitive prediction accuracy.
Theoretical proof of group fairness for EAGNN.
Abstract
With the widespread use of Graph Neural Networks (GNNs) for representation learning from network data, the fairness of GNN models has raised great attention lately. Fair GNNs aim to ensure that node representations can be accurately classified, but not easily associated with a specific group. Existing advanced approaches essentially enhance the generalisation of node representation in combination with data augmentation strategy, and do not directly impose constraints on the fairness of GNNs. In this work, we identify that a fundamental reason for the unfairness of GNNs in social network learning is the phenomenon of social homophily, i.e., users in the same group are more inclined to congregate. The message-passing mechanism of GNNs can cause users in the same group to have similar representations due to social homophily, leading model predictions to establish spurious correlations with…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Ethics and Social Impacts of AI
MethodsSoftmax · Attention Is All You Need
