Counterfactual Graph Learning for Link Prediction

Tong Zhao, Gang Liu, Daheng Wang, Wenhao Yu, Meng Jiang

Keywords: link prediction, counterfactual inference, graph representation learning

Abstract: Learning to predict missing links is important for many graph-based applications. Existing methods were designed to learn the observed association between two sets of variables: (1) the observed graph structure and (2) the existence of link between a pair of nodes. However, the causal relationship between these variables was ignored and we visit the possibility of learning it by simply asking a counterfactual question: "would the link exist or not if the observed graph structure became different?" To answer this question by causal inference, we consider the information of the node pair as context, global graph structural properties as treatment, and link existence as outcome. In this work, we propose a novel link prediction method that enhances graph learning by the counterfactual inference. It creates counterfactual links from the observed ones, and our method learns representations from both of them. Experiments on a number of benchmark datasets show that our proposed method achieves the state-of-the-art performance on link prediction.

Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.

TL;DR: Design a novel method that uses counterfactual inference to improve link prediction on graphs.

Community Implementations: [ 8 code implementations](https://www.catalyzex.com/paper/arxiv:2106.02172/code)