Towards Graph Self-Supervised Learning with Contrastive Adjusted Zooming
Abstract
Graph representation learning (GRL) is critical for graph-structured data analysis. However, most of the existing graph neural networks (GNNs) heavily rely on labeling information, which is normally expensive to obtain in the real world. Although some existing works aim to effectively learn graph representations in an unsupervised manner, they suffer from certain limitations, such as the heavy reliance on monotone contrastiveness and limited scalability. To overcome the aforementioned problems, in light of the recent advancements in graph contrastive learning, we introduce a novel self-supervised graph representation learning algorithm via raph Contrastive Adjusted ing, namely G-Zoom, to learn node representations by leveraging the proposed adjusted zooming scheme. Specifically, this mechanism enables G-Zoom to explore and extract self-supervision signals from a graph from multiple scales: micro (i.e.,\ node-level), meso (i.e.,\ neighborhood-level), and macro (i.e.,\ subgraph-level). Firstly, we generate two augmented views of the input graph via two different graph augmentations. Then, we establish three different contrastiveness on the above three scales progressively, from node, neighboring, to subgraph level, where we maximize the agreement between graph representations across scales. While we can extract valuable clues from a given graph on the micro and macro perspectives, the neighboring-level contrastiveness offers G-Zoom the capability of a customizable option based on our adjusted zooming scheme to manually choose an optimal viewpoint that lies between the micro and macro perspectives to better understand the graph data. Additionally, to make our model scalable to large graphs, we employ a parallel graph diffusion approach to decouple model training from the graph size. We have conducted extensive experiments on real-world datasets, and the results demonstrate that our proposed model outperforms state-of-the-art methods consistently.
Benchmark Results
Tested on 2 datasets 3 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GrokFormer | 0.9831
±0.0018 | |
| 2 | PolyFormer | 0.9808
±0.0027 | |
| 3 | SGFormer | 0.9796
±0.0081 | |
| 6 | GAT | 0.9782
±0.0028 best reported | best at pub: SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling (WWW 2021) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 9 | GCN | 0.9774
±0.0035 best reported | best at pub: SelfGNN: Self-supervised Graph Neural Networks without explicit negative sampling (WWW 2021) best today: GrokFormer: Graph Fourier Kolmogorov-Arnold Transformers (ICML 2024) |
| 17 | SAGE | 0.9739
±0.0018 | |
| 41 | G-Zoom | 0.9660
±0.0030 | This paper |
| 50 | SubG-Con | 0.9620
±0.0040 | This paper |
| 58 | MLP | 0.9597
±0.0007 | |
| 70 | SGC | 0.9580
±0.0010 | prev best: Elastic Graph Neural Networks (ICML 2021) |
| 77 | GRACE | 0.9520
±0.0020 | prev best: Barlow Graph Auto-Encoder for Unsupervised Network Embedding (2021) best today: Learn Beneficial Noise as Graph Augmentation (ICML 2025) |
| 125 | MVGRL | 0.9544
±0.0027 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption (2023) Difference within reported uncertainty; not counted as underperformance. |
| 167 | DGI | 0.9489
±0.0009 best reported | best at pub: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition (WWW 2025) Difference within reported uncertainty; not counted as underperformance. |
| # | 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) |
| 14 | G-Zoom | 0.9490
±0.0030 | This paper |
| 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) |
| 26 | SubG-Con | 0.9400
±0.0060 | This paper |
| 43 | DGI | 0.9220
±0.0060 | prev best: Graph Contrastive Learning with Adaptive Augmentation (WWW 2020) best today: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Improvement within reported uncertainty; not highlighted. |
| 69 | GRACE | 0.9301
±0.0003 best reported | best today: A Fused Gromov-Wasserstein Approach to Subgraph Contrastive Learning (TMLR 2025) |
| 88 | MLP | 0.9280
±0.0020 | |
| 96 | SGC | 0.9270
±0.0010 | prev best: ROD: Reception-aware Online Distillation for Sparse Graphs (KDD 2021) |
| 109 | CG3 | 0.9230
±0.0020 | This paper |
| 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) Difference within reported uncertainty; not counted as underperformance. |
