Range-aware Positional Encoding via High-order Pretraining: Theory and Practice
Abstract
Unsupervised pre-training on vast amounts of graph data is critical in real-world applications wherein labeled data is limited, such as molecule properties prediction or materials science. Existing approaches pre-train models for specific graph domains, neglecting the inherent connections within networks. This limits their ability to transfer knowledge to various supervised tasks. In this work, we propose a novel pre-training strategy on graphs that focuses on modeling their multi-resolution structural information, allowing us to capture global information of the whole graph while preserving local structures around its nodes. We extend the work of Wave}let Positional Encoding (WavePE) from (Ngo et al., 2023) by pretraining a High-Order Permutation-Equivariant Autoencoder (HOPE-WavePE) to reconstruct node connectivities from their multi-resolution wavelet signals. Unlike existing positional encodings, our method is designed to become sensitivity to the input graph size in downstream tasks, which efficiently capture global structure on graphs. Since our approach relies solely on the graph structure, it is also domain-agnostic and adaptable to datasets from various domains, therefore paving the wave for developing general graph structure encoders and graph foundation models. We theoretically demonstrate that there exists a parametrization of such architecture that it can predict the output adjacency up to arbitrarily low error. We also evaluate HOPE-WavePE on graph-level prediction tasks of different areas and show its superiority compared to other methods.
Benchmark Results
Tested on 4 datasets 7 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.9910
±0.0030 | |
| 2 | ID-GNN+BEC | 0.9830
±0.0360 | |
| 3 | SupCosine | 0.9830
±0.0250 | |
| 26 | CIN | 0.9440
±0.0370 best reported | best at pub: CIN++: Enhancing Topological Message Passing (2023) Difference within reported uncertainty; not counted as underperformance. |
| 36 | GIN + HOPE-WavePE | 0.9360
±0.0580 | This paper |
| 39 | GIN | 0.9330
±0.0290 best reported | best at pub: ProtGNN: Towards Self-Explaining Graph Neural Networks (AAAI 2021) Difference within reported uncertainty; not counted as underperformance. |
| 64 | GSN | 0.9220
±0.0750 | This paper |
| 63 | GCN | 0.9220
±0.0440 | |
| 139 | PPGNs | 0.9060
±0.0870 | This paper |
| 164 | WL kernel | 0.9040
±0.0570 | This paper |
| 244 | Natural GN | 0.8940
±0.0160 | This paper |
| 403 | MLP | 0.8660
±0.0495 | |
| 425 | DGCNN | 0.8583
±0.0116 best reported | best at pub: Deep Learning on Attributed Graphs: A Journey from Graphs to Their Embeddings and Back (2018) best today: Graph Structure Refinement with Energy-based Contrastive Learning (AAAI 2024) Difference within reported uncertainty; not counted as underperformance. |
| 467 | PK | 0.8450
±0.0060 best reported | best at pub: Propagation Kernels (2014) |
| 492 | IGN | 0.8390
±0.1300 | This paper |
| 584 | GK (k=3) | 0.8140
±0.0170 | This paper |
| 643 | RWK | 0.7920
±0.0210 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | WL-MLP | 0.9954 | |
| 2 | GIN | 0.9934 best reported | best at pub: 1-WL Expressiveness Is (Almost) All You Need (2022) |
| 3 | GCN | 0.9727 | |
| 10 | WL kernel | 0.8600
±0.0180 | This paper |
| 19 | CIN | 0.8530
±0.0120 best reported | best at pub: CIN++: Enhancing Topological Message Passing (2023) best today: Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes (AAAI 2023) Difference within reported uncertainty; not counted as underperformance. |
| 30 | GIN + HOPE-WavePE | 0.8450
±0.0200 | This paper |
| 50 | GSN | 0.8350
±0.0200 | This paper |
| 64 | PPGNs | 0.8320
±0.0110 | This paper |
| 82 | SIN | 0.8280
±0.0220 best reported | best at pub: Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks (ICML 2021) Difference within reported uncertainty; not counted as underperformance. |
| 109 | Natural GN | 0.8240
±0.0130 | This paper |
| 131 | GraphSAGE | 0.8200
±0.0100 | |
| 373 | DGCNN | 0.7650
±0.0190 best reported | best at pub: GraphCrop: Subgraph Cropping for Graph Classification (2020) Difference within reported uncertainty; not counted as underperformance. |
| 428 | IGN | 0.7433
±0.0271 best reported | best at pub: Towards Better Graph Representation Learning with Parameterized Decomposition & Filtering (ICML 2023) Difference within reported uncertainty; not counted as underperformance. |
| 540 | DCNN | 0.6261 best reported |
GNNBenchmark
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Schrödinger | 0.9913
±0.0004 | |
| 2 | CNN | 0.9907
±0.0007 | |
| 3 | MPNN | 0.9895
±0.0006 | |
| 11 | GatedGCN | 0.9855
±0.0002 best reported | best at pub: RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks (2024) |
| 30 | Graph MLP-Mixer | 0.9835
±0.0010 | prev best: Recurrent Distance Filtering for Graph Representation Learning (ICML 2023) Improvement within reported uncertainty; not highlighted. |
| 32 | GIN | 0.9833
±0.0011 best reported | best at pub: Graph-Coupled Oscillator Networks (ICML 2022) |
| 49 | GPS + HOPE-WavePE | 0.9815
±0.0011 | This paper |
| 63 | GPS + none | 0.9805 | This paper |
| 64 | GPS + (RWSE/LapPE) | 0.9805
±0.0013 | This paper |
| 86 | GAT | 0.9755
±0.0003 best reported | best at pub: RandAlign: A Parameter-Free Method for Regularizing Graph Convolutional Networks (2024) |
| 95 | GraphSAGE | 0.9731
±0.0010 | |
| 126 | MLP | 0.9534
±0.0014 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | RandAlign | 0.7942
±0.0007 | |
| 2 | differential encoding | 0.7907
±0.0027 | |
| 3 | PPGT | 0.7856
±0.0070 | |
| 30 | Graph MLP-Mixer | 0.7396
±0.0033 best reported | best at pub: Recurrent Distance Filtering for Graph Representation Learning (ICML 2023) |
| 39 | GPS + HOPE-WavePE | 0.7301
±0.0081 | This paper |
| 49 | GPS + (RWSE/LapPE) | 0.7230
±0.0036 | This paper |
| 59 | GPS + none | 0.7176
±0.0001 | This paper |
| 62 | GatedGCN | 0.7133
±0.0039 best reported | best at pub: Formatting Instructions for ICLR 2021 Conference Submissions (2020) |
| 92 | GraphSAGE | 0.6690
±0.0020 | |
| 101 | GAT | 0.6611
±0.0098 best reported | best at pub: Formatting Instructions for ICLR 2021 Conference Submissions (2020) |
| 109 | GIN | 0.6510
±0.0050 best reported | best at pub: Beyond Low-pass Filtering: Graph Convolutional Networks with Automatic Filtering (2021) |
| 126 | MLP | 0.5634
±0.0018 |
