AAAI 2022

Interpreting Unfairness in Graph Neural Networks via Training Node Attribution

Yushun Dong, Song Wang, Jing Ma, Ninghao Liu, Jundong Li

Main figure for Interpreting Unfairness in Graph Neural Networks via Training Node Attribution

Abstract

Graph Neural Networks (GNNs) have emerged as the leading paradigm for solving graph analytical problems in various real-world applications. Nevertheless, GNNs could potentially render biased predictions towards certain demographic subgroups. Understanding how the bias in predictions arises is critical, as it guides the design of GNN debiasing mechanisms. However, most existing works overwhelmingly focus on GNN debiasing, but fall short on explaining how such bias is induced. In this paper, we study a novel problem of interpreting GNN unfairness through attributing it to the influence of training nodes. Specifically, we propose a novel strategy named Probabilistic Distribution Disparity (PDD) to measure the bias exhibited in GNNs, and develop an algorithm to efficiently estimate the influence of each training node on such bias. We verify the validity of PDD and the effectiveness of influence estimation through experiments on real-world datasets. Finally, we also demonstrate how the proposed framework could be used for debiasing GNNs. Open-source code can be found at https://github.com/yushundong/BIND.

Benchmark Results

Tested on 1 dataset

Tables show presented results in global context (best 3 papers + GCN + MLP).

LINKX Benchmarks

#ModelAccuracy ↑Paper
1
SAGE
0.8597 ±0.0021
2
Polynormer
0.8595 ±0.0007
3
NID_SAGE
0.8563 ±0.0031
23
GCN
0.7601 ±0.0049
31
MLP
0.7048 ±0.0077
35
NIFTY
0.6530 ±0.0020
This paper
36
FairGNN
0.6400 ±0.0070
This paper
37
BIND 1%
0.6350 ±0.0040
This paper
38
Van. GCN
0.6320 ±0.0070
This paper
39
BIND 10%
0.6290 ±0.0040
This paper
40
EDITS
0.6160 ±0.0090
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers)