Calibrating and Improving Graph Contrastive Learning
Abstract
Graph contrastive learning algorithms have demonstrated remarkable success in various applications such as node classification, link prediction, and graph clustering.
Benchmark Results
Tested on 5 datasets 10 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | 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: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) |
| 116 | SAGE | 0.8881
±0.0015 | |
| 195 | GMI | 0.8726
±0.0016 best reported | best at pub: SAIL: Self-Augmented Graph Contrastive Learning (AAAI 2020) |
| 204 | DGI | 0.8708
±0.0017 best reported | |
| 210 | MLP | 0.8690
±0.0074 | |
| 251 | Node2Vec | 0.8520
±0.0002 best reported |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 8 | GCN | 0.9632
±0.0008 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) |
| 164 | GraphMAE | 0.9341
±0.0010 best reported | best today: Rethinking and Simplifying Bootstrapped Graph Latents (2023) |
| 191 | GCA | 0.9320
±0.0060 best reported | best today: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) Difference within reported uncertainty; not counted as underperformance. |
| 213 | DGI | 0.9309
±0.0008 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) |
| 390 | MLP | 0.9128
±0.0063 | |
| 408 | GMI | 0.9081
±0.0015 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) |
| 457 | Node2Vec | 0.8970
±0.0010 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Multiplex Graph Contrastive Learning with Soft Negatives (2024) |
| 494 | LC | 0.8759
±0.0150 | This paper |
| 499 | ML | 0.8678
±0.0170 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9412
±0.0008 best reported | best at pub: Learning on Attribute-Missing Graphs (2020) |
| 3 | GAT | 0.9398
±0.0022 | |
| 8 | SAGE | 0.9351
±0.0006 | |
| 100 | GraphMAE | 0.9002
±0.0024 best reported | best today: Discrepancy-Aware Graph Mask Auto-Encoder (KDD 2025) |
| 160 | GCA | 0.8894
±0.0015 best reported | best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 210 | DGI | 0.8798
±0.0081 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning (2024) |
| 320 | MLP | 0.8463 | |
| 330 | Node2Vec | 0.8440
±0.0010 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Multiplex Graph Contrastive Learning with Soft Negatives (2024) |
| 342 | GMI | 0.8422
±0.0052 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Localized Graph Contrastive Learning (2022) |
| 400 | ML | 0.8211
±0.0147 | This paper |
| 407 | LC | 0.8198
±0.0152 | This paper |
Default metric is F1. The paper reports 4 values on F1 and 2 values on Accuracy .
| # | Model | F1 ↑ default | Accuracy ↑ | Paper |
|---|---|---|---|---|
| 1 | EnGCN | 0.9714
±
0.0003 | — | |
| 2 | SAGN+SLE | 0.9710
±
0.0000 | — | |
| 3 | GAMLP(JK) | 0.9704
±
0.0001 | — | Accuracy
— |
| 14 | GraphSAGE | 0.9660 | — | |
| 58 | GCN | 0.9648 best reported | 0.9402
±
0.0005 | Accuracy
0.9402
±
0.0005 best at pub: DropEdge: Towards Deep Graph Convolutional Networks on Node Classification (ICLR 2019) |
| 70 | GMI | 0.9500 best reported | — | Accuracy
— best at pub: Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learning (2020) |
| 77 | LC | 0.9443
±
0.0003 | — | Accuracy
— |
| 78 | ML | 0.9438
±
0.0004 | — | Accuracy
— |
| 82 | DGI | 0.9414
±0.0003 | — | Accuracy
— prev best: Deep Learning on Graphs: A Survey (2018) Improvement within reported uncertainty; not highlighted. |
| 145 | Node2Vec | 0.9326
±0.0004 | 0.9326
±
0.0004 | Accuracy
0.9326
±
0.0004 prev best: Graph Few-shot Learning via Knowledge Transfer (AAAI 2019) |
OGB
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | Jacobi | 0.8968 | |
| 2 | GPR | 0.8953 | |
| 3 | LEMP4HG | 0.8939 | |
| 4 | SAGE | 0.8933 | |
| 6 | GCN | 0.8868 best reported | |
| 23 | LC | 0.8645
±0.0013 | This paper |
| 26 | DGI | 0.8637
±0.0019 | This paper |
| 30 | GraphMAE | 0.8630
±0.0007 best reported | best today: Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees (ICML 2024) |
| 31 | ML | 0.8628
±0.0020 | This paper |
| 33 | GMI | 0.8614
±0.0016 | This paper |
| 48 | No pretraining | 0.8469
±0.0079 | This paper |
| 313 | Node2Vec | 0.7249
±0.0010 | This paper |
| 351 | MLP | 0.6605
±0.0020 |
SOTA performance (not significantly different from the best)
Baseline / comparison (this paper)
Global context (other papers)
Best at pub — reported result worse than the best known when published (best reported in green)
Best at pub — reported value improved over the best known when published
Best today — OK at publication; today's leaderboard best is elsewhere
