Promoting Fairness in GNNs: A Characterization of Stability
Yaning Jia, Chunhui Zhang

TL;DR
This paper introduces a Lipschitz bound for GNNs to analyze and improve fairness by limiting output sensitivity to biased input factors, with theoretical and experimental validation.
Contribution
It formulates a Lipschitz bound specific to GNNs for fairness, providing theoretical insights and practical validation for bias mitigation.
Findings
Lipschitz bounds effectively limit bias in GNN outputs.
The bounds guide training to balance accuracy and fairness.
Experimental results confirm the theoretical analysis.
Abstract
The Lipschitz bound, a technique from robust statistics, can limit the maximum changes in the output concerning the input, taking into account associated irrelevant biased factors. It is an efficient and provable method for examining the output stability of machine learning models without incurring additional computation costs. Recently, Graph Neural Networks (GNNs), which operate on non-Euclidean data, have gained significant attention. However, no previous research has investigated the GNN Lipschitz bounds to shed light on stabilizing model outputs, especially when working on non-Euclidean data with inherent biases. Given the inherent biases in common graph data used for GNN training, it poses a serious challenge to constraining the GNN output perturbations induced by input biases, thereby safeguarding fairness during training. Recently, despite the Lipschitz constant's use in…
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
