Beyond Oversquashing: Understanding Signal Propagation in GNNs Via Observables
About
Graph Neural Networks (GNNs) perform computations on graphs by routing the signal between graph regions using a graph shift operator or a message passing scheme. Often, the propagation of the signal leads to a loss of information, where the signal tends to diffuse across the graph instead of being deliberately routed between regions of interest. Two notions that depict this phenomenon are oversmoothing and oversquashing. In this paper, we propose an alternative approach for modeling signal propagation, inspired by quantum mechanics, using the notion of observables. Specifically, we model the place in the graph where the signal lies, how much the signal is concentrated there, and how much of the signal is propagated towards a location of interest when applying a GNN. Using these new concepts, we prove that standard spectral GNNs have poor signal propagation capabilities. We then propose a new type of spectral GNN, termed Schr\"odinger GNN, which we show has a superior capacity to route the signal across the graph.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| Graph Regression | Peptides struct (test) | MAE0.2439 | 97 | |
| Graph Classification | Peptides-func (test) | AP72.07 | 95 | |
| Image Classification | MNIST standard (test) | Accuracy99.13 | 69 | |
| Node Classification | PascalVOC-SP (test) | F1 Score35.07 | 18 | |
| Node Classification | COCO-SP (test) | F1 Score0.4259 | 16 | |
| Node Classification | Tolokers heterophilic (test) | AUC0.8509 | 11 | |
| Heterophilous Node Classification | Roman-empire (test) | AP88.56 | 7 | |
| Heterophilous Node Classification | Minesweeper (test) | ROC AUC96.31 | 7 | |
| Heterophilous Node Classification | Questions (test) | ROC AUC80.14 | 7 | |
| Heterophilous Node Classification | Amazon-Rating (test) | AP54.26 | 7 |