Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvature
About
Graph Neural Networks (GNNs) had been demonstrated to be inherently susceptible to the problems of over-smoothing and over-squashing. These issues prohibit the ability of GNNs to model complex graph interactions by limiting their effectiveness in taking into account distant information. Our study reveals the key connection between the local graph geometry and the occurrence of both of these issues, thereby providing a unified framework for studying them at a local scale using the Ollivier-Ricci curvature. Specifically, we demonstrate that over-smoothing is linked to positive graph curvature while over-squashing is linked to negative graph curvature. Based on our theory, we propose the Batch Ollivier-Ricci Flow, a novel rewiring algorithm capable of simultaneously addressing both over-smoothing and over-squashing.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Graph Classification | PROTEINS | Accuracy68.41 | 1252 | |
| Graph Classification | MUTAG | Accuracy64 | 1103 | |
| Node Classification | Cora (test) | Mean Accuracy83.19 | 951 | |
| Node Classification | Citeseer (test) | Accuracy0.6892 | 945 | |
| Node Classification | Cora | Accuracy81.7 | 583 | |
| Graph Classification | IMDB-B | Accuracy60.82 | 425 | |
| Graph Classification | IMDB-M | Accuracy38.2 | 425 | |
| Node Classification | Chameleon (test) | Mean Accuracy68.46 | 335 | |
| Node Classification | Cornell (test) | Mean Accuracy47.78 | 313 | |
| Node Classification | Texas (test) | Mean Accuracy40 | 312 |