TL;DR
This paper introduces FairVGNN, a novel method for improving fairness in graph neural networks by mitigating sensitive attribute leakage through feature masking and adaptive weight clamping, leading to better fairness-utility trade-offs.
Contribution
It proposes a new approach that considers feature propagation effects to identify and mask sensitive-correlated features, enhancing fairness in GNN predictions.
Findings
FairVGNN outperforms existing methods in fairness metrics.
The approach maintains high utility while reducing bias.
Experimental results validate the effectiveness of feature masking strategies.
Abstract
Graph Neural Networks (GNNs) have shown great power in learning node representations on graphs. However, they may inherit historical prejudices from training data, leading to discriminatory bias in predictions. Although some work has developed fair GNNs, most of them directly borrow fair representation learning techniques from non-graph domains without considering the potential problem of sensitive attribute leakage caused by feature propagation in GNNs. However, we empirically observe that feature propagation could vary the correlation of previously innocuous non-sensitive features to the sensitive ones. This can be viewed as a leakage of sensitive information which could further exacerbate discrimination in predictions. Thus, we design two feature masking strategies according to feature correlations to highlight the importance of considering feature propagation and correlation…
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
MethodsGraph Neural Network
