Eliciting Structural and Semantic Global Knowledge in Unsupervised Graph Contrastive Learning
Abstract
Graph Contrastive Learning (GCL) has recently drawn much research interest for learning generalizable node representations in a self-supervised manner. In general, the contrastive learning process in GCL is performed on top of the representations learned by a graph neural network (GNN) backbone, which transforms and propagates the node contextual information based on its local neighborhoods. However, nodes sharing similar characteristics may not always be geographically close, which poses a great challenge for unsupervised GCL efforts due to their inherent limitations in capturing such global graph knowledge. In this work, we address their inherent limitations by proposing a simple yet effective framework -- imple Neural Networks with tructural and emantic ontrastive earning (S$^3$-CL). Notably, by virtue of the proposed structural and semantic contrastive learning algorithms, even a simple neural network can learn expressive node representations that preserve valuable global structural and semantic patterns. Our experiments demonstrate that the node representations learned by S$^3$-CL achieve superior performance on different downstream tasks compared with the state-of-the-art unsupervised GCL methods. Implementation and more experimental details are publicly available at
Benchmark Results
Tested on 2 datasets 12 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 best reported | best at pub: Learning Graph Augmentations to Learn Graph Representations (2022) |
| 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) |
| 50 | SGC | 0.9511
±0.0009 best reported | best at pub: ROD: Reception-aware Online Distillation for Sparse Graphs (KDD 2021) |
| 194 | SUGRL | 0.9320
±0.0020 best reported | best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) |
| 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: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Decoupling Weighing and Selecting for Integrating Multiple Graph Pre-training Tasks (ICLR 2024) |
| 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 best reported | best today: Clarify Confused Nodes via Separated Learning (2023) |
| 408 | GMI | 0.9081
±0.0015 best reported | |
| 477 | S^3-CL | 0.8900
±0.0050 | This paper |
| 479 | MERIT | 0.8880
±0.0040 | prev best: Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning (IJCAI 2021) |
| 548 | LP | 0.7540 | This paper |
| # | 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: Unifying Graph Convolutional Neural Networks and Label Propagation (2020) best today: Graph Wave Networks (WWW 2025) |
| 21 | GAT | 0.9437
±0.0028 best reported | best at pub: Unifying Graph Convolutional Neural Networks and Label Propagation (2020) best today: Graph Wave Networks (WWW 2025) |
| 43 | DGI | 0.9350
±0.0030 best reported | best at pub: Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming (2021) best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) |
| 65 | S^3-CL | 0.9310
±0.0040 | This paper |
| 69 | GRACE | 0.9301
±0.0003 best reported | best at pub: Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming (2021) best today: A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning (TMLR 2025) |
| 83 | SUGRL | 0.9290
±0.0010 best reported | best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) |
| 88 | MLP | 0.9280
±0.0020 best reported | best at pub: Unifying Graph Convolutional Neural Networks and Label Propagation (2020) best today: Revisiting the Necessity of Graph Learning and Common Graph Benchmarks (2024) |
| 96 | SGC | 0.9270
±0.0010 best reported | best at pub: Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming (2021) |
| 102 | MERIT | 0.9251
±0.0014 best reported | best today: Negative-Free Self-Supervised Gaussian Embedding of Graphs (2024) Difference within reported uncertainty; not counted as underperformance. |
| 116 | MVGRL | 0.9211
±0.0012 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Adaptive Negative Scheduling for Graph Contrastive Learning (2026) |
| 152 | GMI | 0.9108
±0.0056 best reported | Difference within reported uncertainty; not counted as underperformance. |
| 199 | LP | 0.7430 | This paper |
