Our new X account is live! Follow @wizwand_team for updates
WorkDL logo mark

From Coupled Oscillators to Graph Neural Networks: Reducing Over-smoothing via a Kuramoto Model-based Approach

About

We propose the Kuramoto Graph Neural Network (KuramotoGNN), a novel class of continuous-depth graph neural networks (GNNs) that employs the Kuramoto model to mitigate the over-smoothing phenomenon, in which node features in GNNs become indistinguishable as the number of layers increases. The Kuramoto model captures the synchronization behavior of non-linear coupled oscillators. Under the view of coupled oscillators, we first show the connection between Kuramoto model and basic GNN and then over-smoothing phenomenon in GNNs can be interpreted as phase synchronization in Kuramoto model. The KuramotoGNN replaces this phase synchronization with frequency synchronization to prevent the node features from converging into each other while allowing the system to reach a stable synchronized state. We experimentally verify the advantages of the KuramotoGNN over the baseline GNNs and existing methods in reducing over-smoothing on various graph deep learning benchmark tasks.

Tuan Nguyen, Hirotada Honda, Takashi Sano, Vinh Nguyen, Shugo Nakamura, Tan M. Nguyen• 2023

Related benchmarks

TaskDatasetResultRank
Graph ClassificationPROTEINS
Accuracy71.3
742
Graph ClassificationMUTAG
Accuracy71.58
697
Node ClassificationChameleon
Accuracy65.32
549
Node ClassificationSquirrel
Accuracy56.44
500
Node ClassificationCornell
Accuracy74.19
426
Node ClassificationWisconsin
Accuracy85.82
410
Node ClassificationTexas
Accuracy0.8173
410
Node Classificationamazon-ratings
Accuracy51.06
138
Graph RegressionOGBG-MOL FreeSolv (random)
L2 Loss2.13
12
Graph RegressionOGBG-MOL ESOL (random)
L2 Loss0.648
12
Showing 10 of 15 rows

Other info

Follow for update