Memory-Based Graph Networks
Abstract
Graph neural networks (GNNs) are a class of deep models that operate on data with arbitrary topology represented as graphs. We introduce an efficient memory layer for GNNs that can jointly learn node representations and coarsen the graph. We also introduce two new networks based on this layer: memory-based GNN (MemGNN) and graph memory network (GMN) that can learn hierarchical graph representations. The experimental results show that the proposed models achieve state-of-the-art results in eight out of nine graph classification and regression benchmarks. We also show that the learned representations could correspond to chemical features in the molecule data. Code and reference implementations are released at: https://github.com/amirkhas/GraphMemoryNet
Benchmark Results
Tested on 7 datasets 6 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
TU Dortmund
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | MSH-GNN | 0.9410
±0.0330 | |
| 2 | GRDL | 0.8260
±0.0120 | |
| 3 | GMN | 0.8225 | This paper |
| 7 | DiffPool | 0.7625 | prev best: Fast Graph Representation Learning with PyTorch Geometric (ICLR 2019) best today: Graph Structure Prompt Learning: A Novel Methodology to Improve Performance of Graph Neural Networks (2024) Improvement within reported uncertainty; not highlighted. |
| 8 | MemGNN | 0.8135 | This paper |
| 32 | GIN | 0.7880
±0.0410 | |
| 58 | TopKPool | 0.7768 | This paper |
| 113 | ShortestPath | 0.7643 | This paper |
| 149 | MLP | 0.7600
±0.0320 | |
| 152 | SortPool | 0.7554 | prev best: ASAP: Adaptive Structure Aware Pooling for Learning Hierarchical Graph Representations (AAAI 2019) |
| 154 | SAGPool | 0.7595
±0.0452 best reported | best today: Embedding Graphs on Grassmann Manifold (2022) Difference within reported uncertainty; not counted as underperformance. |
| 156 | PatchySan | 0.7590
±0.0280 best reported | best today: Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors (2025) Difference within reported uncertainty; not counted as underperformance. |
| 155 | GraphSAGE | 0.7590
±0.0320 best reported | best at pub: Graph Convolutional Networks with EigenPooling (KDD 2019) best today: Simplifying Graph Convolutional Networks with Redundancy-Free Neighbors (2025) |
| 190 | WL | 0.7560
±0.0040 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) |
| 196 | Sparse HGC | 0.7546 | This paper |
| 222 | WL Optimal | 0.7526 | This paper |
| 301 | Set2Set | 0.7429 | prev best: Fast Graph Representation Learning with PyTorch Geometric (ICLR 2019) Improvement within reported uncertainty; not highlighted. |
| 370 | Graphlet | 0.7291 | This paper |
| 380 | ECC | 0.7265 | This paper |
| 384 | CliquePool | 0.7259 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9792 | |
| 2 | MSH-GNN | 0.9640
±0.0070 | |
| 3 | CoCN | 0.8722
±0.0013 | |
| 23 | GCN | 0.8260
±0.0220 | |
| 57 | TopKPool | 0.7756 | prev best: Edge Contraction Pooling for Graph Neural Networks (2019) best today: Embedding Graphs on Grassmann Manifold (2022) |
| 92 | WL Optimal | 0.8074 | This paper |
| 117 | GMN | 0.8018 | This paper |
| 125 | SortPool | 0.8007 best reported | best at pub: Fast Graph Representation Learning with PyTorch Geometric (ICLR 2019) best today: CogDL: A Comprehensive Library for Graph Deep Learning (WWW 2021) |
| 136 | GraphSAGE | 0.7970
±0.0170 best reported | |
| 142 | Set2Set | 0.7960
±0.0230 best reported | best at pub: Fast Graph Representation Learning with PyTorch Geometric (ICLR 2019) |
| 151 | MLP | 0.7920
±0.0240 | |
| 153 | WL | 0.7910
±0.0010 best reported | best at pub: On Valid Optimal Assignment Kernels and Applications to Graph Classification (NeurIPS 2016) |
| 209 | MemGNN | 0.7700 | This paper |
| 242 | Sparse HGC | 0.7546 | This paper |
| 257 | CliquePool | 0.7450 | This paper |
| 280 | PatchySan | 0.7260 | This paper |
| 312 | ECC | 0.6779 | This paper |
| 322 | Graphlet | 0.6466 | This paper |
| 331 | ShortestPath | 0.5910 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GMN | 0.7866 | This paper |
| 2 | MemGNN | 0.7550 | This paper |
| 3 | TFGW SP | 0.7510
±0.0500 | |
| 17 | GatedGCN | 0.7000
±0.0494 | |
| 18 | WL | 0.6950
±0.0320 best reported | best at pub: Dynamic Edge-Conditioned Filters in Convolutional Neural Networks on Graphs (2017) best today: Template based Graph Neural Network with Optimal Transport Distances (NeurIPS 2022) |
| 26 | GraphSAGE | 0.6817
±0.0545 best reported | best at pub: Graph Neural Networks With Convolutional ARMA Filters (2019) best today: GNNBenchmark (JMLR 2023) |
| 32 | GIN | 0.6767
±0.0583 | |
| 58 | Sparse HGC | 0.6417 | This paper |
| 70 | DiffPool | 0.6053 | |
| 88 | CliquePool | 0.6071 | This paper |
| 93 | Set2Set | 0.6015 | prev best: Graph Convolutional Networks with EigenPooling (KDD 2019) |
| 94 | WL Optimal | 0.6013 | This paper |
| 120 | SortPool | 0.5712 | This paper |
| 124 | MLP | 0.5583
±0.0352 | |
| 128 | Graphlet | 0.4103 | prev best: The Multiscale Laplacian Graph Kernel (NeurIPS 2016) best today: Contrastive Graph Few-Shot Learning (2022) |
| 182 | ShortestPath | 0.4232 | This paper |
MoleculeNet
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | HIMP | 0.8740
±0.0050 | |
| 2 | GINE w/ VN | 0.8720
±0.0030 | |
| 3 | NaiveGINe+ K=3 w/ VN | 0.8700
±0.0040 | |
| 14 | GCN | 0.8290
±0.0060 | prev best: Adaptive Graph Convolutional Neural Networks (AAAI 2018) best today: Graph convolutions that can finally model local structure (2020) |
| 24 | GIN | 0.8290
±0.0069 | |
| 26 | MemGNN | 0.8280
±0.0040 | This paper |
| 32 | Kernel SVM | 0.8220
±0.0060 | This paper |
| 33 | Weave | 0.8200
±0.0100 | This paper |
| 41 | Bypass | 0.8100
±0.0130 | This paper |
| 50 | Multitask | 0.8030
±0.0120 | This paper |
| 63 | IRV | 0.7990
±0.0060 | This paper |
| 76 | Logistic Regression | 0.7940
±0.0150 | This paper |
| 77 | XGBoost | 0.7940
±0.0140 | This paper |
| 156 | Random Forest | 0.7690
±0.0150 | This paper |
| # | Model | ROC-AUC ↑ | Paper |
|---|---|---|---|
| 1 | ProtoMol | 0.9140
±0.0030 | |
| 2 | MMSG | 0.9080
±0.0050 | |
| 3 | MemGNN | 0.9070 | This paper |
| 38 | Random Forest | 0.8670
±0.0080 | This paper |
| 43 | GIN | 0.8646
±0.0081 | |
| 48 | Kernel SVM | 0.8620 | This paper |
| 64 | GCN | 0.8540
±0.0110 best reported | best today: Atom-Motif Contrastive Transformer for Molecular Property Prediction (2023) |
| 75 | XGBoost | 0.8500
±0.0080 | This paper |
| 93 | IRV | 0.8380 | This paper |
| 109 | Bypass | 0.8290
±0.0060 | This paper |
| 122 | Multitask | 0.8240
±0.0006 | This paper |
| 167 | Weave | 0.8060
±0.0020 | This paper |
| 215 | Logistic Regression | 0.7810
±0.0100 | This paper |
| # | Model | RMSE ↓ | Paper |
|---|---|---|---|
| 1 | Graphormer-SPIS | 0.4840
±0.0050 | |
| 2 | Graphormer-SPD | 0.4920
±0.0040 | |
| 3 | conan-FGW | 0.5140
±0.0190 | |
| 4 | MemGNN | 0.5400
±0.0100 | This paper |
| 7 | GCN | 0.5640
±0.0150 best reported | best today: On Structural Expressive Power of Graph Transformers (KDD 2023) |
| 18 | GraphSAGE | 0.6010
±0.0080 | |
| 94 | Random Forest | 1.0700
±0.1900 | This paper |
| 106 | Multitask | 1.1200
±0.1900 | This paper |
| # | Model | RMSE ↓ | Paper |
|---|---|---|---|
| 1 | MemGNN | 0.5560
±0.0230 | This paper |
| 2 | ProtoS-L2 | 0.5800
±0.0160 | |
| 3 | ProtoW-L2 | 0.6040
±0.0140 | |
| 7 | GCN | 0.6550
±0.0360 | This paper |
| 9 | GIN | 0.6580
±0.0190 | |
| 22 | MPNN | 0.7150
±0.0350 | prev best: MoleculeNet (2017) Improvement within reported uncertainty; not highlighted. |
| 74 | Random Forest | 0.8760
±0.0400 | This paper |
