TL;DR
This paper introduces a causal inference approach to determine whether GCNs should trust local graph structures during testing, improving prediction accuracy by assessing the causal effect of local structure discrepancies.
Contribution
It proposes a novel causal inference method to evaluate and mitigate the impact of local structure discrepancies on GCN testing performance.
Findings
Effective in enhancing GCN inference accuracy
Reduces impact of local structure discrepancies
Validated on seven node classification datasets
Abstract
Graph Convolutional Network (GCN) is an emerging technique for information retrieval (IR) applications. While GCN assumes the homophily property of a graph, real-world graphs are never perfect: the local structure of a node may contain discrepancy, e.g., the labels of a node's neighbors could vary. This pushes us to consider the discrepancy of local structure in GCN modeling. Existing work approaches this issue by introducing an additional module such as graph attention, which is expected to learn the contribution of each neighbor. However, such module may not work reliably as expected, especially when there lacks supervision signal, e.g., when the labeled data is small. Moreover, existing methods focus on modeling the nodes in the training data, and never consider the local structure discrepancy of testing nodes. This work focuses on the local structure discrepancy issue for testing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Convolutional Networks · Graph Convolutional Network · Dropout
