TasksSotADatasetsPapersMethodsSubmitAbout
Papers With Code 2

A community resource for machine learning research: papers, code, benchmarks, and state-of-the-art results.

Explore

Notable BenchmarksAll SotADatasetsPapersMethods

Community

Submit ResultsAbout

Data sourced from the PWC Archive (CC-BY-SA 4.0). Built by the community, for the community.

Papers/GREAD: Graph Neural Reaction-Diffusion Networks

GREAD: Graph Neural Reaction-Diffusion Networks

Jeongwhan Choi, Seoyoung Hong, Noseong Park, Sung-Bae Cho

2022-11-25Node Classification
PaperPDFCode(official)

Abstract

Graph neural networks (GNNs) are one of the most popular research topics for deep learning. GNN methods typically have been designed on top of the graph signal processing theory. In particular, diffusion equations have been widely used for designing the core processing layer of GNNs, and therefore they are inevitably vulnerable to the notorious oversmoothing problem. Recently, a couple of papers paid attention to reaction equations in conjunctions with diffusion equations. However, they all consider limited forms of reaction equations. To this end, we present a reaction-diffusion equation-based GNN method that considers all popular types of reaction equations in addition to one special reaction equation designed by us. To our knowledge, our paper is one of the most comprehensive studies on reaction-diffusion equation-based GNNs. In our experiments with 9 datasets and 28 baselines, our method, called GREAD, outperforms them in a majority of cases. Further synthetic data experiments show that it mitigates the oversmoothing problem and works well for various homophily rates.

Results

TaskDatasetMetricValueModel
Node ClassificationSquirrel (48%/32%/20% fixed splits)Accuracy51.01GREAD-BS
Node ClassificationTexas (48%/32%/20% fixed splits)Accuracy88.11GREAD-F
Node ClassificationTexas (48%/32%/20% fixed splits)Accuracy87.57GREAD-BS
Node ClassificationFilm(48%/32%/20% fixed splits)Accuracy37.49GREAD-BS
Node ClassificationWisconsin (48%/32%/20% fixed splits)Accuracy88.04GREAD-BS
Node ClassificationWisconsin (48%/32%/20% fixed splits)Accuracy86.47GREAD-F
Node ClassificationChameleon (48%/32%/20% fixed splits)Accuracy67.98GREAD-BS
Node ClassificationCora (48%/32%/20% fixed splits)Accuracy88.39GREAD-BS
Node ClassificationPubMed (48%/32%/20% fixed splits)Accuracy90.21GREAD-BS
Node ClassificationCornell (48%/32%/20% fixed splits)Accuracy87.03GREAD-AC
Node ClassificationCornell (48%/32%/20% fixed splits)Accuracy86.22GREAD-BS
Node ClassificationCornell (48%/32%/20% fixed splits)Accuracy85.41GREAD-F
Node ClassificationCiteseer (48%/32%/20% fixed splits)Accuracy77.53GREAD-BS

Related Papers

Demystifying Distributed Training of Graph Neural Networks for Link Prediction2025-06-25Equivariance Everywhere All At Once: A Recipe for Graph Foundation Models2025-06-17Delving into Instance-Dependent Label Noise in Graph Data: A Comprehensive Study and Benchmark2025-06-14Graph Semi-Supervised Learning for Point Classification on Data Manifolds2025-06-13Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols2025-06-11Wasserstein Hypergraph Neural Network2025-06-11Mitigating Degree Bias Adaptively with Hard-to-Learn Nodes in Graph Contrastive Learning2025-06-05iN2V: Bringing Transductive Node Embeddings to Inductive Graphs2025-06-05