Graph Rationalization with Environment-based Augmentations
Abstract
Rationale is defined as a subset of input features that best explains or supports the prediction by machine learning models. Rationale identification has improved the generalizability and interpretability of neural networks on vision and language data. In graph applications such as molecule and polymer property prediction, identifying representative subgraph structures named as graph rationales plays an essential role in the performance of graph neural networks. Existing graph pooling and/or distribution intervention methods suffer from the lack of examples to learn to identify optimal graph rationales. In this work, we introduce a new augmentation operation called environment replacement that automatically creates virtual data examples to improve rationale identification. We propose an efficient framework that performs rationale-environment separation and representation learning on the real and augmented examples in latent spaces to avoid the high complexity of explicit graph decoding and encoding. Comparing against recent techniques, experiments on seven molecular and four polymer datasets demonstrate the effectiveness and efficiency of the proposed augmentation-based graph rationalization framework. Data and the implementation of the proposed framework are publicly available.
Benchmark Results
Tested on 1 dataset 1 baseline value reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
OGB
ogbg-molhiv
Global leaderboard →Default metric is ROC-AUC. The paper reports 8 values on ROC-AUC and 8 values on AUC .
| # | Model | ROC-AUC ↑ default | AUC ↑ | Paper |
|---|---|---|---|---|
| 1 | Multi-RF Fusion with Multi-GNN Blending | 0.8476
±
0.0002 | — | |
| 2 | HyperFusion | 0.8475
±
0.0003 | — | |
| 3 | PAS+FPs | 0.8420
±
0.0015 | — | |
| 9 | GatedGCN | 0.8090
±
0.0160 | — | |
| 50 | GREA | 0.7932
±
0.0092 | 0.7932
±
0.0092 | AUC
0.7932
±
0.0092 |
| 109 | GIN | 0.7780
±
0.0182 | — | |
| 133 | SelfAttnPool | 0.7733
±
0.0187 | 0.7733
±
0.0187 | AUC
0.7733
±
0.0187 |
| 152 | DIR | 0.7705 best reported | 0.7533
±
0.0117 | AUC
0.7533
±
0.0117 best at pub: Discovering Invariant Rationales for Graph Neural Networks (ICLR 2022) best today: Generative Risk Minimization for Out-of-Distribution Generalization on Graphs (TMLR 2025) |
| 155 | IRM | 0.7702
±0.0107 | 0.7817
±
0.0120 | AUC
0.7817
±
0.0120 prev best: Discovering Invariant Rationales for Graph Neural Networks (ICLR 2022) Improvement within reported uncertainty; not highlighted. |
| 211 | OOD-GNN | 0.7580
±
0.0176 | 0.7799
±
0.0078 | AUC
0.7799
±
0.0078 |
| 231 | U-NetsPool | 0.7527
±
0.0104 | 0.7527
±
0.0104 | AUC
0.7527
±
0.0104 |
| 242 | DIR+RepAug | 0.7494
±
0.0225 | 0.7494
±
0.0225 | AUC
0.7494
±
0.0225 |
| 282 | StableGNN | 0.7218
±
0.0099 | 0.7218
±
0.0099 | AUC
0.7218
±
0.0099 |
