Toward General Digraph Contrastive Learning: A Dual Spatial Perspective
Abstract
Graph Contrastive Learning (GCL) has emerged as a powerful tool for extracting consistent representations from graphs, independent of labeled information. However, existing methods predominantly focus on undirected graphs, disregarding the pivotal directional information that is fundamental and indispensable in real-world networks (e.g., social networks and recommendations). In this paper, we introduce S2-DiGCL, a novel framework that emphasizes spatial insights from complex and real domain perspectives for directed graph (digraph) contrastive learning. From the complex-domain perspective, S2-DiGCL introduces personalized perturbations into the magnetic Laplacian to adaptively modulate edge phases and directional semantics. From the real-domain perspective, it employs a path-based subgraph augmentation strategy to capture fine-grained local asymmetries and topological dependencies. By jointly leveraging these two complementary spatial views, S2-DiGCL constructs high-quality positive and negative samples, leading to more general and robust digraph contrastive learning. Extensive experiments on 7 real-world digraph datasets demonstrate the superiority of our approach, achieving SOTA performance with 4.41\
Benchmark Results
Tested on 2 datasets 9 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | 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 | |
| 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) |
| 107 | DiGCN | 0.7973
±0.0057 best reported | |
| 110 | MagNet | 0.7959
±0.0039 best reported | |
| 151 | DGI | 0.7865
±0.0690 best reported | best at pub: Quantizing Text-attributed Graphs for Semantic-Structural Integration (KDD 2025) Difference within reported uncertainty; not counted as underperformance. |
| 161 | S2-DiGCL | 0.7842
±0.0113 | This paper |
| 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) |
| 163 | GraphCL | 0.7837
±0.0077 | prev best: PyG-SSL: A Graph Self-Supervised Learning Toolkit (2024) Improvement within reported uncertainty; not highlighted. |
| 175 | RAW-GNN | 0.7801
±0.0058 best reported | best at pub: Beyond Message Passing: Neural Graph Pattern Machine (ICML 2025) |
| 226 | UGCL | 0.7543
±0.0315 | This paper |
| 235 | DiGCL | 0.7483
±0.0288 | This paper |
| 237 | MLP | 0.7469
±0.0085 |
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 | |
| 135 | GCN | 0.3690 best reported | best at pub: Beyond Low-frequency Information in Graph Convolutional Networks (AAAI 2021) |
| 182 | GAT | 0.3605
±0.0035 best reported | best at pub: Hierarchical Graph Transformer with Adaptive Node Sampling (NeurIPS 2022) |
| 198 | S2-DiGCL | 0.3571
±0.0084 | This paper |
| 234 | RAW-GNN | 0.3508
±0.0053 | This paper |
| 250 | DiGCL | 0.3453
±0.0042 | This paper |
| 251 | GRACE | 0.3450
±0.0110 best reported | best at pub: Graph Contrastive Learning under Heterophily via Graph Filters (2023) |
| 272 | DiGCN | 0.3391
±0.0102 | This paper |
| 278 | UGCL | 0.3363
±0.0070 | This paper |
| 310 | GraphCL | 0.3151
±0.0154 | |
| 318 | MagNet | 0.3126
±0.0067 | This paper |
| 335 | DGI | 0.3067
±0.0063 | prev best: Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating (AAAI 2022) Improvement within reported uncertainty; not highlighted. |
| 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. |
