BeMap: Balanced Message Passing for Fair Graph Neural Network
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Graph Semi-Supervised Learning for Point Classification on Data Manifolds
HGOT: Self-supervised Heterogeneous Graph Neural Network with Optimal Transport
Directed Homophily-Aware Graph Neural Network
LEX-GNN: Label-Exploring Graph Neural Network for Accurate Fraud Detection
SplitGNN: Spectral Graph Neural Network for Fraud Detection against Heterophily
Prototype-based Interpretable Graph Neural Networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.