Rethinking Graph Contrastive Learning through Relative Similarity Preservation
Abstract
Graph contrastive learning (GCL) has achieved remarkable success by following the computer vision paradigm of preserving absolute similarity between augmented views. However, this approach faces fundamental challenges in graphs due to their discrete, non-Euclidean nature---view generation often breaks semantic validity and similarity verification becomes unreliable. Through analyzing 11 real-world graphs, we discover a universal pattern transcending the homophily-heterophily dichotomy: label consistency systematically diminishes as structural distance increases, manifesting as smooth decay in homophily graphs and oscillatory decay in heterophily graphs. We establish theoretical guarantees for this pattern through random walk theory, proving label distribution convergence and characterizing the mechanisms behind different decay behaviors. This discovery reveals that graphs naturally encode relative similarity patterns, where structurally closer nodes exhibit collectively stronger semantic relationships. Leveraging this insight, we propose RelGCL, a novel GCL framework with complementary pairwise and listwise implementations that preserve these inherent patterns through collective similarity objectives. Extensive experiments demonstrate that our method consistently outperforms 20 existing approaches across both homophily and heterophily graphs, validating the effectiveness of leveraging natural relative similarity over artificial absolute similarity.
Benchmark Results
Tested on 10 datasets 69 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 best reported | best at pub: Understanding Heterophily for Graph Neural Networks (ICML 2024) |
| 39 | SAGE | 0.8911
±0.0012 | |
| 44 | GAT | 0.8897
±0.0014 best reported | best at pub: Learned Low Precision Graph Neural Networks (2020) |
| 98 | SUGRL | 0.8800
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 130 | BGRL | 0.8730
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 134 | GRACE | 0.8720
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 156 | MVGRL | 0.8680
±0.0050 best reported | best at pub: ENGAGE: Explanation Guided Data Augmentation for Graph Representation Learning (2023) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 177 | DGI | 0.8630
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 248 | CCA-SSG | 0.8460
±0.0070 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) Difference within reported uncertainty; not counted as underperformance. |
| 254 | RelGCL_List | 0.8450
±0.0040 | This paper |
| 253 | HomoGCL | 0.8450
±0.0050 | This paper |
| 264 | RelGCL_Pair | 0.8440
±0.0020 | This paper |
| 271 | COSTA | 0.8330
±0.0030 | prev best: HomoGCL: Rethinking Homophily in Graph Contrastive Learning (KDD 2023) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 280 | GraphMAE | 0.8420
±0.0040 | This paper |
| 286 | GraphACL | 0.8420
±0.0030 | This paper |
| 351 | G-BT | 0.8360 best reported | best at pub: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 406 | gCooL | 0.8320
±0.0050 | prev best: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Improvement within reported uncertainty; not highlighted. |
| 404 | AFGRL | 0.8320
±0.0040 | prev best: HomoGCL: Rethinking Homophily in Graph Contrastive Learning (KDD 2023) |
| 409 | SP-GCL | 0.8320
±0.0020 | This paper |
| 415 | GCA | 0.8310
±0.0030 best reported | best at pub: Graph Contrastive Learning with Implicit Augmentations (2022) |
| 419 | AutoSSL | 0.8310
±0.0040 | This paper |
| 630 | VGAE | 0.8059
±0.0035 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) |
| 654 | GAE | 0.8011
±0.0022 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: NTFormer: A Composite Node Tokenized Graph Transformer for Node Classification (2024) |
| 61 | GraphSAGE | 0.7923
±0.0053 | |
| 66 | DGI | 0.7890
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 87 | MVGRL | 0.7808
±0.0006 best reported | |
| 100 | SUGRL | 0.7760
±0.0040 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 136 | BGRL | 0.7600
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 165 | CCA-SSG | 0.7540
±0.0100 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 201 | GRACE | 0.7450
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 209 | GraphMAE | 0.7436 best reported | best at pub: Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights (NeurIPS 2024) |
| 257 | RelGCL_Pair | 0.7370
±0.0040 | This paper |
| 258 | GraphACL | 0.7363
±0.0022 best reported | best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 270 | RelGCL_List | 0.7360
±0.0050 | This paper |
| 347 | G-BT | 0.7290
±0.0040 best reported | best at pub: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 337 | COSTA | 0.7210
±0.0030 | prev best: HomoGCL: Rethinking Homophily in Graph Contrastive Learning (KDD 2023) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 350 | MLP | 0.7289
±0.0010 | |
| 369 | gCooL | 0.7270
±0.0040 | prev best: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 374 | AFGRL | 0.7260
±0.0030 | prev best: HomoGCL: Rethinking Homophily in Graph Contrastive Learning (KDD 2023) |
| 427 | HomoGCL | 0.7230
±0.0070 | This paper |
| 454 | AutoSSL | 0.7210
±0.0040 | This paper |
| 459 | SP-GCL | 0.7200
±0.0040 | This paper |
| 505 | GCA | 0.7150
±0.0030 best reported | best at pub: Topology Reorganized Graph Contrastive Learning with Mitigating Semantic Drift (2024) Difference within reported uncertainty; not counted as underperformance. |
| 625 | VGAE | 0.6990
±0.0057 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) |
| 739 | GAE | 0.6639
±0.0024 best reported | best at pub: Decoupled Self-supervised Learning for Non-Homophilou Graphs (2022) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 best reported | best at pub: Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning (ICLR 2024) |
| 20 | GAT | 0.9233
±0.0018 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 136 | CCA-SSG | 0.8840
±0.0060 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 144 | BGRL | 0.8830
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 154 | SUGRL | 0.8820
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 194 | GRACE | 0.8730
±0.0010 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 196 | MVGRL | 0.8725
±0.0012 best reported | |
| 204 | DGI | 0.8708
±0.0017 best reported | |
| 208 | COSTA | 0.8698
±0.0033 best reported | |
| 210 | MLP | 0.8690
±0.0074 | |
| 232 | GraphMAE | 0.8594
±0.0016 best reported | |
| 255 | GCA | 0.8512
±0.0023 best reported | best at pub: LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space (2024) |
| 299 | VGAE | 0.8307
±0.0029 best reported | best at pub: LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space (2024) |
| 304 | GAE | 0.8294
±0.0031 best reported | best at pub: LAC: Graph Contrastive Learning with Learnable Augmentation in Continuous Space (2024) |
| 313 | RelGCL_List | 0.8270
±0.0040 | This paper |
| 324 | RelGCL_Pair | 0.8220
±0.0030 | This paper |
| 330 | GraphACL | 0.8202
±0.0015 best reported | best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 365 | HomoGCL | 0.8110
±0.0030 | This paper |
| 380 | AutoSSL | 0.8090
±0.0060 | This paper |
| 384 | AFGRL | 0.8080
±0.0060 | prev best: HomoGCL: Rethinking Homophily in Graph Contrastive Learning (KDD 2023) Improvement within reported uncertainty; not highlighted. |
| 407 | gCooL | 0.8050
±0.0040 | prev best: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Improvement within reported uncertainty; not highlighted. |
| 414 | G-BT | 0.8040
±0.0060 | This paper |
| 559 | SP-GCL | 0.7920
±0.0070 best reported | best at pub: Graph Contrastive Learning under Heterophily via Graph Filters (2023) Difference within reported uncertainty; not counted as underperformance. |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 best reported | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | |
| 130 | AFGRL | 0.9361
±0.0020 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 153 | AutoSSL | 0.9350
±0.0070 best reported | best at pub: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 163 | RelGCL_Pair | 0.9342
±0.0044 | This paper |
| 164 | GraphMAE | 0.9341
±0.0010 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) |
| 171 | RelGCL_List | 0.9340
±0.0048 | This paper |
| 172 | BGRL | 0.9337
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 175 | GraphACL | 0.9331
±0.0019 | This paper |
| 186 | CCA-SSG | 0.9325
±0.0021 best reported | best at pub: Wiener Graph Deconvolutional Network Improves Graph Self-Supervised Learning (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 191 | GCA | 0.9320
±0.0060 best reported | best at pub: Unifying Graph Contrastive Learning with Flexible Contextual Scopes (2022) best today: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 194 | SUGRL | 0.9320
±0.0020 best reported | best at pub: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Difference within reported uncertainty; not counted as underperformance. |
| 198 | gCooL | 0.9318
±0.0012 | This paper |
| 203 | GRACE | 0.9313
±0.0017 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: Learn Beneficial Noise as Graph Augmentation (ICML 2025) |
| 206 | MVGRL | 0.9310
±0.0040 best reported | best at pub: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 213 | DGI | 0.9309
±0.0008 best reported | |
| 222 | HomoGCL | 0.9300
±0.0020 best reported | best at pub: Multiplex Graph Contrastive Learning with Soft Negatives (2024) Difference within reported uncertainty; not counted as underperformance. |
| 263 | COSTA | 0.9267
±0.0016 best reported | best at pub: Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation (2024) Difference within reported uncertainty; not counted as underperformance. |
| 267 | G-BT | 0.9263
±0.0044 | This paper |
| 287 | SP-GCL | 0.9249
±0.0031 | This paper |
| 317 | VGAE | 0.9224 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) Difference within reported uncertainty; not counted as underperformance. |
| 352 | GAE | 0.9185
±0.0006 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) |
| 390 | MLP | 0.9128
±0.0063 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9412
±0.0008 best reported | best at pub: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms (ICML 2024) |
| 3 | GAT | 0.9398
±0.0022 best reported | best at pub: Diss-l-ECT: Dissecting Graph Data with local Euler Characteristic Transforms (ICML 2024) |
| 8 | SAGE | 0.9351
±0.0006 | |
| 79 | BGRL | 0.9034
±0.0019 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 90 | RelGCL_Pair | 0.9014
±0.0035 | This paper |
| 100 | GraphMAE | 0.9002
±0.0024 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) |
| 104 | RelGCL_List | 0.8999
±0.0038 | This paper |
| 112 | AFGRL | 0.8988
±0.0033 | This paper |
| 118 | GraphACL | 0.8980
±0.0025 | This paper |
| 128 | SP-GCL | 0.8968
±0.0019 | This paper |
| 139 | GRACE | 0.8953
±0.0035 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 157 | HomoGCL | 0.8900
±0.0010 best reported | best at pub: Multiplex Graph Contrastive Learning with Soft Negatives (2024) |
| 159 | CCA-SSG | 0.8896
±0.0013 best reported | best at pub: Str-GCL: Structural Commonsense Driven Graph Contrastive Learning (WWW 2025) Difference within reported uncertainty; not counted as underperformance. |
| 160 | GCA | 0.8894
±0.0015 best reported | best at pub: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 162 | SUGRL | 0.8893
±0.0021 best reported | best at pub: Localized Graph Contrastive Learning (2022) Difference within reported uncertainty; not counted as underperformance. |
| 166 | gCooL | 0.8885
±0.0014 | This paper |
| 179 | MVGRL | 0.8861
±0.0064 best reported | |
| 188 | AutoSSL | 0.8840
±0.0030 best reported | best at pub: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 192 | COSTA | 0.8837
±0.0022 best reported | best at pub: HomoGCL: Rethinking Homophily in Graph Contrastive Learning (KDD 2023) Difference within reported uncertainty; not counted as underperformance. |
| 202 | G-BT | 0.8814
±0.0033 | This paper |
| 210 | DGI | 0.8798
±0.0081 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) |
| 246 | VGAE | 0.8721
±0.0026 best reported | best at pub: HC-GAE: The Hierarchical Cluster-based Graph Auto-Encoder for Graph Representation Learning (NeurIPS 2024) |
| 264 | GAE | 0.8666
±0.0007 best reported | best at pub: Graph Masked Autoencoders with Transformers (2022) |
| 320 | MLP | 0.8463 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GCN | 0.9302
±0.0011 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) |
| 2 | RSE + RGCN (70b) | 0.8852
±0.0019 | |
| 3 | LEMP+T | 0.8825 | |
| 9 | SAGE | 0.8771 | |
| 31 | GAT | 0.8533 best reported | best at pub: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 84 | GraphMAE | 0.8052
±0.0032 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) |
| 93 | RelGCL_List | 0.8016
±0.0058 | This paper |
| 96 | RelGCL_Pair | 0.8014
±0.0051 | This paper |
| 94 | GRACE | 0.8014
±0.0048 best reported | best at pub: Large-Scale Representation Learning on Graphs via Bootstrapping (ICLR 2021) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 100 | BGRL | 0.8000
±0.0010 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Difference within reported uncertainty; not counted as underperformance. |
| 108 | GraphACL | 0.7966
±0.0029 best reported | best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 129 | COSTA | 0.7912
±0.0002 | This paper |
| 130 | CCA-SSG | 0.7908
±0.0053 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) best today: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) Difference within reported uncertainty; not counted as underperformance. |
| 135 | SP-GCL | 0.7901
±0.0051 | This paper |
| 138 | SUGRL | 0.7897
±0.0022 | This paper |
| 143 | AFGRL | 0.7890
±0.0060 best reported | best at pub: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) |
| 145 | HomoGCL | 0.7884
±0.0047 | prev best: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Improvement within reported uncertainty; not highlighted. |
| 147 | gCooL | 0.7874
±0.0004 | This paper |
| 151 | DGI | 0.7865
±0.0690 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) best today: Quantizing Text-attributed Graphs for Semantic-Structural Integration (KDD 2025) |
| 162 | GCA | 0.7840
±0.0013 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) best today: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) Difference within reported uncertainty; not counted as underperformance. |
| 181 | GAE | 0.7787
±0.0053 best reported | best at pub: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 180 | VGAE | 0.7787
±0.0053 best reported | best at pub: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 190 | MVGRL | 0.7757
±0.0046 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) best today: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Difference within reported uncertainty; not counted as underperformance. |
| 211 | G-BT | 0.7683
±0.0073 best reported | best at pub: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) best today: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Difference within reported uncertainty; not counted as underperformance. |
| 212 | AutoSSL | 0.7680
±0.0013 | This paper |
| 237 | MLP | 0.7469
±0.0085 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DoG | 0.9690
±0.0030 | |
| 2 | GWN-fa | 0.9667
±0.0026 | |
| 3 | GWN-sym | 0.9666
±0.0026 | |
| 6 | GraphSAGE | 0.9593
±0.0025 | |
| 12 | GCN | 0.9514
±0.0025 best reported | best at pub: Graph Wave Networks (WWW 2025) |
| 21 | GAT | 0.9437
±0.0028 best reported | best at pub: Graph Wave Networks (WWW 2025) |
| 41 | RelGCL_Pair | 0.9353
±0.0012 | This paper |
| 44 | RelGCL_List | 0.9350
±0.0012 | This paper |
| 43 | DGI | 0.9350
±0.0030 best reported | best at pub: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) |
| 48 | CCA-SSG | 0.9337
±0.0020 best reported | best at pub: MA-GCL: Model Augmentation Tricks for Graph Contrastive Learning (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 50 | AutoSSL | 0.9335
±0.0009 | This paper |
| 51 | GCA | 0.9332
±0.0012 best reported | best at pub: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) |
| 52 | gCooL | 0.9332
±0.0002 | prev best: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 53 | BGRL | 0.9331
±0.0013 best reported | best at pub: Spectral Augmentation for Self-Supervised Learning on Graphs (ICLR 2022) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 56 | AFGRL | 0.9330
±0.0020 best reported | best at pub: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Difference within reported uncertainty; not counted as underperformance. |
| 63 | GraphMAE | 0.9313
±0.0015 | prev best: Diffusion on Graph: Augmentation of Graph Structure for Node Classification (TMLR 2025) Improvement within reported uncertainty; not highlighted. |
| 69 | GRACE | 0.9301
±0.0003 best reported | best at pub: A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning (TMLR 2025) |
| 77 | G-BT | 0.9295
±0.0017 | This paper |
| 76 | COSTA | 0.9295
±0.0012 best reported | best at pub: Rethinking and Simplifying Bootstrapped Graph Latents (2023) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) Difference within reported uncertainty; not counted as underperformance. |
| 83 | SUGRL | 0.9290
±0.0010 best reported | best at pub: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Difference within reported uncertainty; not counted as underperformance. |
| 88 | MLP | 0.9280
±0.0020 | |
| 93 | GraphACL | 0.9277
±0.0014 | This paper |
| 94 | HomoGCL | 0.9274
±0.0022 | prev best: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) |
| 117 | VGAE | 0.9211
±0.0009 | This paper |
| 116 | MVGRL | 0.9211
±0.0012 | This paper |
| 127 | SP-GCL | 0.9192
±0.0010 | This paper |
| 163 | GAE | 0.9005
±0.0035 best reported | best at pub: HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption (2023) Difference within reported uncertainty; not counted as underperformance. |
Heterophilic Graphs
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | DiGGR | 0.4535
±0.0353 | |
| 2 | TRIGON | 0.4402
±0.0028 | |
| 3 | DoG | 0.4320
±0.0120 | |
| 42 | MLP | 0.4026
±0.0108 | |
| 68 | GraphSAGE | 0.3899
±0.0085 | |
| 251 | GRACE | 0.3450
±0.0110 best reported | best at pub: Graph Contrastive Learning under Heterophily via Graph Filters (2023) |
| 335 | DGI | 0.3067
±0.0063 best reported | best at pub: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) best today: Toward General Digraph Contrastive Learning: A Dual Spatial Perspective (2025) |
| 342 | RelGCL_Pair | 0.3032
±0.0091 | This paper |
| 345 | RelGCL_List | 0.3023
±0.0088 | This paper |
| 351 | GraphACL | 0.3003
±0.0013 | This paper |
| 356 | BGRL | 0.2986 best reported | best at pub: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) |
| 361 | GCA | 0.2965 best reported | best at pub: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) Difference within reported uncertainty; not counted as underperformance. |
| 376 | SP-GCL | 0.2894
±0.0069 | prev best: Graph Contrastive Learning under Heterophily via Graph Filters (2023) |
| 407 | AFGRL | 0.2743
±0.0131 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Hetero-S (GAT 8-layer) | 0.8693 | |
| 2 | Dir-GNN+CNA | 0.8586
±0.0180 | |
| 3 | GAT | 0.8560 | |
| 52 | GCN | 0.7033 | |
| 58 | RelGCL_Pair | 0.6925
±0.0089 | This paper |
| 62 | RelGCL_List | 0.6906
±0.0086 | This paper |
| 90 | SP-GCL | 0.6528
±0.0053 | This paper |
| 169 | MLP | 0.5429 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | IBG-NN | 0.7763
±0.0179 | |
| 2 | Dir-GNN+CNA | 0.7747
±0.0128 | |
| 3 | DHGNN | 0.7684
±0.0161 | |
| 46 | GCN | 0.6067 | |
| 57 | RelGCL_Pair | 0.5767
±0.0096 | This paper |
| 58 | RelGCL_List | 0.5753
±0.0092 | This paper |
| 77 | GraphACL | 0.5405
±0.0013 | This paper |
| 84 | SP-GCL | 0.5210
±0.0067 | This paper |
| 98 | GCA | 0.4809
±0.0021 best reported | best at pub: Spectral-Aware Augmentation for Enhanced Graph Representation Learning (2023) best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) |
| 108 | BGRL | 0.4624
±0.0070 | This paper |
| 142 | AFGRL | 0.4236
±0.0040 | This paper |
| 144 | DGI | 0.4222
±0.0063 | This paper |
| 154 | GRACE | 0.4109
±0.0085 | This paper |
| 172 | MLP | 0.3930
±0.0079 |
