arXiv:2508.15499cs.LG2025-08

通过添加新边引导图结构,提升GNN下游任务的公平性。

Let's Grow an Unbiased Community: Guiding the Fairness of Graphs via New Links

  • 引入可微社区检测作为伪下游任务,指导图结构公平性优化。
  • 利用元梯度识别关键新边,显著提升结构公平性。
  • 在多种图任务中验证了方法的有效性和泛化能力。

图神经网络(GNN)在各类应用中取得了显著成功,但图结构中的偏见导致其在公平性方面面临挑战。尽管原始用户图结构通常存在偏见,但通过引入新边来引导现有结构向无偏方向发展具有潜力。本文提出一种名为FairGuide的新框架,通过引入可微社区检测作为伪下游任务,确保在下游任务中实现公平性。理论分析表明,优化该伪任务能有效增强结构公平性,促进跨多种下游应用的公平性泛化。此外,FairGuide采用基于公平性引导目标的元梯度策略,精准识别能显著提升结构公平性的新边。大量实验结果表明,该方法在多种图基公平性任务中均表现出优异的性能和泛化能力。

原文摘要 · Abstract (English)

Graph Neural Networks (GNNs) have achieved remarkable success across diverse applications. However, due to the biases in the graph structures, graph neural networks face significant challenges in fairness. Although the original user graph structure is generally biased, it is promising to guide these existing structures toward unbiased ones by introducing new links. The fairness guidance via new links could foster unbiased communities, thereby enhancing fairness in downstream applications. To address this issue, we propose a novel framework named FairGuide. Specifically, to ensure fairness in downstream tasks trained on fairness-guided graphs, we introduce a differentiable community detection task as a pseudo downstream task. Our theoretical analysis further demonstrates that optimizing fairness within this pseudo task effectively enhances structural fairness, promoting fairness generalization across diverse downstream applications. Moreover, FairGuide employs an effective strategy which leverages meta-gradients derived from the fairness-guidance objective to identify new links that significantly enhance structural fairness. Extensive experimental results demonstrate the effectiveness and generalizability of our proposed method across a variety of graph-based fairness tasks.

图神经网络公平性社区发现

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