arXiv:2409.01367cs.LGcs.CY2024-09被引 4

提出无需对抗训练的图表示学习公平性框架,稳定提升模型公正性。

Debiasing Graph Representation Learning based on Information Bottleneck

  • 基于信息瓶颈设计条件公平性约束,平衡表示效用与敏感信息泄露。
  • 在多个真实数据集上实现更高公平性与稳定性,性能优于对抗方法。
  • 适合关注算法公平性的图学习研究者与应用开发者。

图表示学习在金融、社交网络等实际场景中表现优异,但现有方法常因忽视决策过程中的公平性而产生歧视性预测。为此,本文提出基于变分图自编码器(VGAE)的GRAFair框架,核心是条件公平性瓶颈,旨在权衡表示的实用性与敏感信息的保留程度。通过变分近似,使优化目标可解。该方法无需对抗训练即可生成任务相关性强且敏感信息极少的表示。在多个真实数据集上的实验表明,GRAFair在公平性、实用性、鲁棒性和稳定性方面均表现出色。

原文摘要 · Abstract (English)

Graph representation learning has shown superior performance in numerous real-world applications, such as finance and social networks. Nevertheless, most existing works might make discriminatory predictions due to insufficient attention to fairness in their decision-making processes. This oversight has prompted a growing focus on fair representation learning. Among recent explorations on fair representation learning, prior works based on adversarial learning usually induce unstable or counterproductive performance. To achieve fairness in a stable manner, we present the design and implementation of GRAFair, a new framework based on a variational graph auto-encoder. The crux of GRAFair is the Conditional Fairness Bottleneck, where the objective is to capture the trade-off between the utility of representations and sensitive information of interest. By applying variational approximation, we can make the optimization objective tractable. Particularly, GRAFair can be trained to produce informative representations of tasks while containing little sensitive information without adversarial training. Experiments on various real-world datasets demonstrate the effectiveness of our proposed method in terms of fairness, utility, robustness, and stability.

图学习公平性信息瓶颈无对抗

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。