通过增强图结构同质性提升图神经网络公平性
Homophily-aware Supervised Contrastive Counterfactual Augmented Fair Graph Neural Network

- 分两阶段优化:先调整图结构提升标签同质性,降低敏感属性同质性
- 引入改进的监督对比损失与环境损失,兼顾准确率与公平性
- 在五个真实数据集上优于现有方法,适合需要公平性的图学习场景
近年来,图神经网络(GNN)在节点分类、链接预测和图表示学习等任务中取得了显著成果。然而,它们仍易受节点属性和图结构本身带来的偏差影响。因此,如何提升GNN的公平性已成为关键研究挑战。本文提出一种新型模型,基于反事实增强公平图神经网络框架(CAF),通过两阶段训练策略提升公平性:第一阶段编辑图结构,使类别标签的同质性提高,而敏感属性标签的同质性降低;第二阶段将改进的监督对比损失与环境损失融入优化过程,实现预测性能与公平性的联合提升。在五个真实世界数据集上的实验表明,该模型在分类准确率和公平性指标上均优于CAF及多个先进图学习方法。
原文摘要 · Abstract (English)
In recent years, Graph Neural Networks (GNNs) have achieved remarkable success in tasks such as node classification, link prediction, and graph representation learning. However, they remain susceptible to biases that can arise not only from node attributes but also from the graph structure itself. Addressing fairness in GNNs has therefore emerged as a critical research challenge. In this work, we propose a novel model for training fairness-aware GNNs by improving the counterfactual augmented fair graph neural network framework (CAF). Specifically, our approach introduces a two-phase training strategy: in the first phase, we edit the graph to increase homophily ratio with respect to class labels while reducing homophily ratio with respect to sensitive attribute labels; in the second phase, we integrate a modified supervised contrastive loss and environmental loss into the optimization process, enabling the model to jointly improve predictive performance and fairness. Experiments on five real-world datasets demonstrate that our model outperforms CAF and several state-of-the-art graph-based learning methods in both classification accuracy and fairness metrics.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。