Topological Relational Learning on Graphs

Graph neural networks (GNNs) have emerged as a powerful tool for graph classification and representation learning. However, GNNs tend to suffer from oversmoothing problems and are vulnerable to graph perturbations. To address these challenges, we propose a novel topological neural framework of topological relational inference (TRI) which allows for integrating higher-order graph information to GNNs and for systematically learning a local graph structure. The key idea is to rewire the original graph by using the persistent homology of the small neighborhoods of nodes and then to incorporate the extracted topological summaries as the side information into the local algorithm. As a result, the new framework enables us to harness both the conventional information on the graph structure and information on the graph higher order topological properties. We derive theoretical stability guarantees for the new local topological representation and discuss their implications on the graph algebraic connectivity. The experimental results on node classification tasks demonstrate that the new TRI-GNN outperforms all 14 state-ofthe-art baselines on 6 out 7 graphs and exhibit higher robustness to perturbations, yielding up to 10% better performance under noisy scenarios. IEEE 118-Bus * 82.20 (1.68) * 82.38 (2.00) * 82.21 (1.88) ACTIVSg200 * * * 82.75 (2.09) * * 84.56 (1.75) * * * 82.80 (2.73) ACTIVSg500 * 97.85 (0.56) * 97.69 (0.63) * 97.54 (0.72) ACTIVSg2000 * 88.59 (0.60) * 88.82 (0.56) * 88.63 (0.65) Cora-ML * * * 84.33 (0.63) * * * 84.63 (0.61) * * * 84.42 (0.70) CiteSeer 73.25 (0.70) * 73.10 (0.70) * 73.10 (0.63) PubMed 79.77 (0.51) 79.71 (0.50) 79.68 (0.63)