ICML 2024

Dirac-Bianconi Graph Neural Networks - Enabling Non-Diffusive Long-Range Graph Predictions

Christian Nauck, R. Gorantla, M. Lindner, Konstantin Schurholt, A. Mey, Frank Hellmann

Main figure for Dirac-Bianconi Graph Neural Networks - Enabling Non-Diffusive Long-Range Graph Predictions

Abstract

The geometry of a graph is encoded in dynamical processes on the graph. Many graph neural network (GNN) architectures are inspired by such dynamical systems, typically based on the graph Laplacian. Here, we introduce Dirac--Bianconi GNNs (DBGNNs), which are based on the topological Dirac equation recently proposed by Bianconi. Based on the graph Laplacian, we demonstrate that DBGNNs explore the geometry of the graph in a fundamentally different way than conventional message passing neural networks (MPNNs). While regular MPNNs propagate features diffusively, analogous to the heat equation, DBGNNs allow for coherent long-range propagation. Experimental results showcase the superior performance of DBGNNs over existing conventional MPNNs for long-range predictions of power grid stability and peptide properties. This study highlights the effectiveness of DBGNNs in capturing intricate graph dynamics, providing notable advancements in GNN architectures.

Proposed method: DBGNN

Benchmark Results

Tested on 1 dataset 1 baseline value reported too low

Tables show presented results in global context (best 3 papers + GCN + MLP).

LRGB

#ModelMAE ↓Paper
1
GCN
actual #1 vs paper #183 182 places worse
0.2421 ±0.0016
best reported
actual #1 vs paper #183 182 places worse
paper 0.3496 ±0.0013
paper 0.3496 ±0.0013 Δ at pub 0.1036 Δ today 0.1075
2
IPR-MPNN
0.2422 ±0.0007
3
TANGO-GPS
0.2422 ±0.0014
5
GIN
0.2429 ±0.0019
169
DBGNN
0.2864 ±0.0046
This paper
201
MLP
0.4351 ±0.0008
SOTA performance (not significantly different from the best) Proposed method (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green)