Trade less Accuracy for Fairness and Trade-off Explanation for GNN
Trade less Accuracy for Fairness and Trade-off Explanation for GNN
复制标题
DOI:
10.1109/bigdata55660.2022.10020318
复制
发表时间:
2022-12
期刊:
影响因子:
--
通讯作者:
Yazheng Liu;Xi Zhang;Sihong Xie
中科院分区:
文献类型:
--
作者:
Yazheng Liu;Xi Zhang;Sihong Xie
Graphs are widely found in social network analysis and e-commerce, where Graph Neural Networks (GNNs) are the state-of the-art model. GNNs can be biased due to sensitive attributes and network topology. With existing work that learns a fair node representation or adjacency matrix, achieving a strong guarantee of group fairness while preserving prediction accuracy is still challenging, with the fairness-accuracy trade-off remaining obscure to human decision-makers. We first define and analyze a novel upper bound of group fairness to optimize the adjacency matrix for fairness without significantly h arming prediction accuracy. To understand the nuance of fairness-accuracy tradeoff, we further propose macroscopic and microscopic explanation methods to reveal the trade-offs and the space that one can exploit. The macroscopic explanation method is based on stratified sampling and linear programming to deterministically explain the dynamics of the group fairness and prediction accuracy. Driving down to the microscopic level, we propose a path-based explanation that reveals how network topology leads to the tradeoff. On seven graph datasets, we demonstrate the novel upper bound can achieve more efficient fairness-accuracy trade-offs and the intuitiveness of the explanation methods can clearly pinpoint where the trade-off is improved.