CI-GNN: A Granger Causality-Inspired Graph Neural Network for Interpretable Brain Network-Based Psychiatric Diagnosis
Abstract
There is a recent trend to leverage the power of graph neural networks (GNNs) for brain-network based psychiatric diagnosis, which, in turn, also motivates an urgent need for psychiatrists to fully understand the decision behavior of the used GNNs. However, most of the existing GNN explainers are either post-hoc in which another interpretive model needs to be created to explain a well-trained GNN, or do not consider the causal relationship between the extracted explanation and the decision, such that the explanation itself contains spurious correlations and suffers from weak faithfulness. In this work, we propose a granger causality-inspired graph neural network (CI-GNN), a built-in interpretable model that is able to identify the most influential subgraph (i.e., functional connectivity within brain regions) that is causally related to the decision (e.g., major depressive disorder patients or healthy controls), without the training of an auxillary interpretive network. CI-GNN learns disentangled subgraph-level representations $ $ and $ $ that encode, respectively, the causal and non-causal aspects of original graph under a graph variational autoencoder framework, regularized by a conditional mutual information (CMI) constraint. We theoretically justify the validity of the CMI regulation in capturing the causal relationship. We also empirically evaluate the performance of CI-GNN against three baseline GNNs and four state-of-the-art GNN explainers on synthetic data and three large-scale brain disease datasets. We observe that CI-GNN achieves the best performance in a wide range of metrics and provides more reliable and concise explanations which have clinical evidence. The source code and implementation details of CI-GNN are freely available at GitHub repository (https://github.com/ZKZ-Brain/CI-GNN/).
Benchmark Results
Tested on 3 datasets 4 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 39 | GIN | 0.9330
±0.0290 best reported | best at pub: ProtGNN: Towards Self-Explaining Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 45 | CI-GNN | 0.9300
±0.0300 | This paper |
| 63 | GCN | 0.9220
±0.0440 best reported | best at pub: Breaking the Limits of Message Passing Graph Neural Networks (ICML 2021) best today: Depth-Adaptive Graph Neural Networks via Learnable Bakry-Émery Curvature (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 158 | GraphSAGE | 0.9040
±0.0780 | |
| 183 | GAT | 0.9010
±0.0580 best reported | best at pub: Breaking the Limits of Message Passing Graph Neural Networks (ICML 2021) best today: The Expressive Power of Graph Neural Networks: A Survey (2023) Difference within reported uncertainty; not counted as underperformance. |
| 331 | GNNExplainer | 0.8800
±0.0300 | prev best: Generative Causal Explanations for Graph Neural Networks (ICML 2021) |
| 392 | Dir-GNN | 0.8700
±0.0800 | This paper |
| 393 | PGExplainer | 0.8700
±0.0300 | prev best: GraphSVX: Shapley Value Explanations for Graph Neural Networks (2021) |
| 403 | MLP | 0.8660
±0.0495 | |
| 564 | RC-Explainer | 0.8200
±0.0600 | This paper |
| 714 | SIB | 0.7500
±0.0500 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 3 | GCN | 0.9727 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 4 | GAT | 0.9623 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 74 | CI-GNN | 0.8300
±0.0200 | This paper |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 460 | GNNExplainer | 0.7200 best reported | best at pub: Generative Causal Explanations for Graph Neural Networks (ICML 2021) |
| 471 | Dir-GNN | 0.7100
±0.0100 | This paper |
| 525 | SIB | 0.6500
±0.0100 | This paper |
| 526 | PGExplainer | 0.6500
±0.0200 | This paper |
| 527 | RC-Explainer | 0.6500
±0.0300 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | |
| 5 | CI-GNN | 0.8200
±0.0200 | This paper |
| 16 | GNNExplainer | 0.8000
±0.0100 | This paper |
| 17 | PGExplainer | 0.8000
±0.0200 | This paper |
| 27 | SIB | 0.7900
±0.0100 | This paper |
| 32 | GIN | 0.7700
±0.0300 | prev best: Breaking the Limits of Message Passing Graph Neural Networks (ICML 2021) Improvement within reported uncertainty; not highlighted. |
| 49 | GAT | 0.7800
±0.0300 | prev best: GNNBenchmark (JMLR 2023) Improvement within reported uncertainty; not highlighted. |
| 67 | SAGE | 0.7726
±0.0228 | |
| 84 | Dir-GNN | 0.7700
±0.0100 | This paper |
| 148 | GCN | 0.7600
±0.0300 | prev best: GraphiT: Encoding Graph Structure in Transformers (2021) Improvement within reported uncertainty; not highlighted. |
| 149 | MLP | 0.7600
±0.0320 | |
| 475 | RC-Explainer | 0.6700
±0.0600 | This paper |
