mlsanityData to 14 Oct 2026

A Generative Graph Contrastive Learning Model with Global Signal

arXiv 2504.18148 ↗First posted 25 Apr 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph contrastive learning (GCL) has garnered significant attention recently since it learns complex structural information from graphs through self-supervised learning manner. However, prevalent GCL models may suffer from performance degradation due to inappropriate contrastive signals. Concretely, they commonly generate augmented views based on random perturbation, which leads to biased essential structures due to the introduction of noise. In addition, they assign equal weight to both hard and easy sample pairs, thereby ignoring the difference in importance of the sample pairs. To address these issues, this study proposes a novel Contrastive Signal Generative Framework for Accurate Graph Learning (CSG2L) with the following two-fold ideas: a) building a singular value decomposition (SVD)-directed augmented module (SVD-aug) to obtain the global interactions as well as avoiding the random noise perturbation; b) designing a local-global dependency learning module (LGDL) with an adaptive reweighting strategy which can differentiate the effects of hard and easy sample pairs. Extensive experiments on benchmark datasets demonstrate that the proposed CSG2L outperforms the state-of-art baselines. Moreover, CSG2L is compatible with a variety of GNNs.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 24 of its 83 references that are in the map. First posted on arXiv 25 Apr 2025.

Builds on

24 of 83 references.

References · 24

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Graph Attention Networkscited by 8,923
  3. 2017Inductive Representation Learning on Large Graphscited by 6,320
  4. 2018How Powerful are Graph Neural Networks?cited by 4,393
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  6. 2019Simplifying Graph Convolutional Networkscited by 1,477
  7. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  8. 2018Predict then Propagate: Graph Neural Networks meet Personalized PageRankcited by 993
  9. 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 826
  10. 2020Adaptive Universal Generalized PageRank Graph Neural Networkcited by 595
  11. 2019Multi-scale Attributed Node Embeddingcited by 548
  12. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
12 more
  1. 2019MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixingcited by 443
  2. 2019Diffusion Improves Graph Learningcited by 414
  3. 2020SIGN: Scalable Inception Graph Neural Networkscited by 284
  4. 2022Finding Global Homophily in Graph Neural Networks When Meeting Heterophilycited by 179
  5. 2021SUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanismcited by 75
  6. 2021ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learningcited by 72
  7. 2023Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothingcited by 67
  8. 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
  9. 2023Learning Strong Graph Neural Networks with Weak Informationcited by 25
  10. 2023Finding the Missing-half: Graph Complementary Learning for Homophily-prone and Heterophily-prone Graphscited by 25
  11. 2022ES-GNN: Generalizing Graph Neural Networks Beyond Homophily with Edge Splittingcited by 13
  12. 2023Efficient Link Prediction via GNN Layers Induced by Negative Samplingcited by 6

Built on by

Not cited yet.