FairSIN: Achieving Fairness in Graph Neural Networks through Sensitive Information Neutralization
Cheng Yang, Jixi Liu, Yunhe Yan, Chuan Shi
摘要
Despite the remarkable success of graph neural networks (GNNs) in modeling graph-structured data, like other machine learning models, GNNs are also susceptible to making biased predictions based on sensitive attributes, such as race and gender. For fairness consideration, recent state-of-the-art (SOTA) methods propose to filter out sensitive information from inputs or representations, e.g., edge dropping or feature masking. However, we argue that such filtering-based strategies may also filter out some non-sensitive feature information, leading to a sub-optimal trade-off between predictive performance and fairness. To address this issue, we unveil an innovative neutralization-based paradigm, where additional Fairness-facilitating Features (F3) are incorporated into node features or representations before message passing. The F3 are expected to statistically neutralize the sensitive bias in node representations and provide additional nonsensitive information. We also provide theoretical explanations for our rationale, concluding that F3 can be realized by emphasizing the features of each node’s heterogeneous neighbors (neighbors with different sensitive attributes). We name our method as FairSIN, and present three implementation variants from both data-centric and model-centric perspectives. Experimental results on five benchmark datasets with three different GNN backbones show that FairSIN significantly improves fairness metrics while maintaining high prediction accuracies. Codes and appendix can be found at https://github.com/BUPT-GAMMA/FariSIN.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了最后一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper8
- FairGP: A Scalable and Fair Graph Transformer Using Graph PartitioningRenqiang Luo, Huafei Huang, Ivan Lee, Chengpei Xu 等AAAI 2025 · 被引用 20 次
- DHG-Bench: A Comprehensive Benchmark for Deep Hypergraph LearningFan Li, Xiaoyang Wang, Wenjie Zhang, Ying Zhang 等ICLR 2026 · 被引用 9 次
- Disentangling, Amplifying, and Debiasing: Learning Disentangled Representations for Fair Graph Neural NetworksYeon-Chang Lee, Hojung Shin, Sang-Wook KimAAAI 2025 · 被引用 7 次
- Are Your Models Still Fair? Fairness Attacks on Graph Neural Networks via Node InjectionsZihan Luo, Hong Huang, Yongkang Zhou, Jiping Zhang 等NeurIPS 2024 · 被引用 4 次
- Towards Fair Graph Neural Networks via Graph Counterfactual Without Sensitive AttributesXuemin Wang, Tianlong Gu, Xuguang Bao, Liang ChangICDE 2025 · 被引用 3 次
它引用的顶会 Paper8
- EDITS: Modeling and Mitigating Data Bias for Graph Neural NetworksYushun Dong, Ninghao Liu, Brian Jalaian, Jundong LiWWW 2022 · 被引用 172 次
- On Dyadic Fairness: Exploring and Mitigating Bias in Graph ConnectionsPeizhao Li, Yifei Wang, Han Zhao, Pengyu Hong 等ICLR 2021 · 被引用 142 次
- Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute LeakageYu Wang, Yuying Zhao, Yushun Dong, Huiyuan Chen 等KDD 2022 · 被引用 82 次
- Structured Graph Convolutional Networks with Stochastic Masks for Recommender SystemsHuiyuan Chen, Lan Wang, Yusan Lin, Chin-Chia Michael Yeh 等SIGIR 2021 · 被引用 60 次
- RawlsGCN: Towards Rawlsian Difference Principle on Graph Convolutional NetworkJian Kang, Yan Zhu, Yinglong Xia, Jiebo Luo 等WWW 2022 · 被引用 57 次
相关 Paper
- One Fits All: Learning Fair Graph Neural Networks for Various Sensitive AttributesYuchang Zhu, Jintang Li, Yatao Bian, Zibin Zheng 等KDD 2024 · 被引用 5 次
- Towards Controllable Hybrid Fairness in Graph Neural NetworksZihan Luo, Hong Huang, Jianxun Lian, Xiran Song 等KDD 2025
- EqGNN: Equalized Node Opportunity in GraphsUriel Singer, Kira RadinskyAAAI 2022 · 被引用 9 次
- Fair Graph Representation Learning via Sensitive Attribute DisentanglementYuchang Zhu, Jintang Li, Zibin Zheng, Liang ChenWWW 2024 · 被引用 18 次
- Learning Fair Graph Representations via Probability of Necessity and SufficiencyChuxun Liu, Qingfeng Chen, Debo Cheng, Jiangzhang Gan 等AAAI 2026
