Toward General Digraph Contrastive Learning: A Dual Spatial Perspective
Not on the map. Why?
Abstract (arXiv)
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% improvement in node classification and 4.34% in link prediction under both supervised and unsupervised settings.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 34 of its 55 references that are in the map. First posted on arXiv 18 Oct 2025.
Builds on
34 of 55 references.
References · 34
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2019A Comprehensive Survey on Graph Neural Networkscited by 2,919
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2018Representation Learning on Graphs with Jumping Knowledge Networkscited by 877
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
- 2019Multi-scale Attributed Node Embeddingcited by 548
22 more
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 494
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 335
- 2020Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networkscited by 260
- 2022Graph neural networks for materials science and chemistrycited by 182
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2021MagNet: A Neural Network for Directed Graphscited by 107
- 2020Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learningcited by 90
- 2023Edge Directionality Improves Learning on Heterophilic Graphscited by 90
- 2022Graph Attention Multi-Layer Perceptroncited by 83
- 2020Directed Graph Convolutional Networkcited by 73
- 2023Transformers Meet Directed Graphscited by 40
- 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
- 2022RAW-GNN: RAndom Walk Aggregation based Graph Neural Networkcited by 25
- 2023Breaking the Entanglement of Homophily and Heterophily in Semi-supervised Node Classificationcited by 19
- 2024LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learningcited by 11
- 2021D-HYPR: Harnessing Neighborhood Modeling and Asymmetry Preservation for Digraph Representation Learningcited by 8
- 2024Async Learned User Embeddings for Ads Delivery Optimizationcited by 7
- 2023Signed Directed Graph Contrastive Learning with Laplacian Augmentationcited by 4
- 2024DiRW: Path-Aware Digraph Learning for Heterophilycited by 3
- 2025Toward Effective Digraph Representation Learning: A Magnetic Adaptive Propagation based Approachcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.