Stable Fair Graph Representation Learning with Lipschitz Constraint

Group fairness based on adversarial training has gained significant attention on graph data, which was implemented by masking sensitive attributes to generate fair feature views. However, existing models suffer from training instability due to uncertainty of the generated masks and the trade-off between fairness and utility. In this work, we propose a stable fair Graph Neural Network (SFG) to maintain training stability while preserving accuracy and fairness performance. Specifically, we first theoretically derive a tight upper Lipschitz bound to control the stability of existing adversarial-based models and employ a stochastic projected subgradient algorithm to constrain the bound, which operates in a block-coordinate manner. Additionally, we construct the uncertainty set to train the model, which can prevent unstable training by dropping some overfitting nodes caused by chasing fairness. Extensive experiments conducted on three real-world datasets demonstrate that SFG is stable and outperforms other state-of-the-art adversarial-based methods in terms of both fairness and utility performance. Codes are available at https: //github. com/sh-qiangchen/SFG.

Authors

• Qiang Chen 0016
• Zhongze Wu
• Xiu Su
• Xi Lin 0003
• Zhe Qu
• Shan You
• Shuo Yang 0006
• Chang Xu 0002

Keywords

• graph neural network
• fairness
• stability