Localized Contrastive Learning on Graphs
Not on the map. Why?
Abstract (arXiv)
Contrastive learning methods based on InfoNCE loss are popular in node representation learning tasks on graph-structured data. However, its reliance on data augmentation and its quadratic computational complexity might lead to inconsistency and inefficiency problems. To mitigate these limitations, in this paper, we introduce a simple yet effective contrastive model named Localized Graph Contrastive Learning (Local-GCL in short). Local-GCL consists of two key designs: 1) We fabricate the positive examples for each node directly using its first-order neighbors, which frees our method from the reliance on carefully-designed graph augmentations; 2) To improve the efficiency of contrastive learning on graphs, we devise a kernelized contrastive loss, which could be approximately computed in linear time and space complexity with respect to the graph size. We provide theoretical analysis to justify the effectiveness and rationality of the proposed methods. Experiments on various datasets with different scales and properties demonstrate that in spite of its simplicity, Local-GCL achieves quite competitive performance in self-supervised node representation learning tasks on graphs with various scales and properties.
Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 46 of its 60 references that are in the map. First posted on arXiv 8 Dec 2022.
Builds on
46 of 60 references.
References · 46
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2020Rethinking Attention with Performerscited by 1,584
- 2016Variational Graph Auto-Encoderscited by 1,373
- 2019Contrastive Multiview Codingcited by 1,297
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
34 more
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Deep Graph Infomaxcited by 1,101
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2015Image-based Recommendations on Styles and Substitutescited by 702
- 2020Contrastive Multi-View Representation Learning on Graphscited by 651
- 2020Contrastive Learning with Hard Negative Samplescited by 619
- 2019On Variational Bounds of Mutual Informationcited by 550
- 2019Multi-scale Attributed Node Embeddingcited by 543
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2020GCC: Graph Contrastive Coding for Graph Neural Network Pre-Trainingcited by 461
- 2020Hard Negative Mixing for Contrastive Learningcited by 399
- 2021Beyond Low-frequency Information in Graph Convolutional Networkscited by 361
- 2021Random Feature Attentioncited by 350
- 2021With a Little Help from My Friends: Nearest-Neighbor Contrastive Learning of Visual Representationscited by 324
- 2021Provable Guarantees for Self-Supervised Deep Learning with Spectral Contrastive Losscited by 311
- 2019Deep Graph Library: A Graph-Centric, Highly-Performant Package for Graph Neural Networkscited by 241
- 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
- 2021Is Homophily a Necessity for Graph Neural Networks?cited by 182
- 2022Contrastive and Non-Contrastive Self-Supervised Learning Recover Global and Local Spectral Embedding Methodscited by 146
- 2021From Canonical Correlation Analysis to Self-supervised Graph Neural Networkscited by 138
- 2020Uncovering the structure of clinical EEG signals with self-supervised learningcited by 109
- 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 107
- 2021Augmentation-Free Self-Supervised Learning on Graphscited by 94
- 2016Orthogonal Random Featurescited by 89
- 2021Self-Supervised Learning with Kernel Dependence Maximizationcited by 77
- 2014Fastfood: Approximate Kernel Expansions in Loglinear Timecited by 72
- 2021ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learningcited by 72
- 2018Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guaranteescited by 71
- 2021Mean Shift for Self-Supervised Learningcited by 65
- 2022Revisiting Graph Contrastive Learning from the Perspective of Graph Spectrumcited by 43
- 2019Dual Graph Attention Networks for Deep Latent Representation of Multifaceted Social Effects in Recommender Systemscited by 41
- 2016Large-Scale Kernel Methods for Independence Testingcited by 32
- 2015Homophily and missing links in citation networkscited by 21
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 6; 2026: 2.
10 papers.
- 2023Simple and Asymmetric Graph Contrastive Learning without Augmentationscited by 37
- 2025One Prompt Fits All: Universal Graph Adaptation for Pretrained Modelscited by 11
- 2023Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networkscited by 8
- 2025Node Embeddings via Neighbor Embeddingscited by 1
- 2026Why Does Graph Learning Fail to Fully Benefit from a Text Teacher?cited by 1
- 2025Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networkscited by 0
- 2025Negative Metric Learning for Graphscited by 0
- 2025Fractal Graph Contrastive Learningcited by 0
- 2025Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networkscited by 0
- 2026Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passingcited by 0
- 2026Why Does Graph Learning Fail to Fully Benefit from a Text Teacher?26 Aug 2026
- 2026Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing9 Jun 2026
- 2025Adaptive Multi-view Graph Contrastive Learning via Fractional-order Neural Diffusion Networks9 Nov 2025
- 2025One Prompt Fits All: Universal Graph Adaptation for Pretrained Models26 Sep 2025
- 2025Fractal Graph Contrastive Learning16 May 2025
- 2025Negative Metric Learning for Graphs15 May 2025
- 2025Simple Graph Contrastive Learning via Fractional-order Neural Diffusion Networks23 Apr 2025
- 2025Node Embeddings via Neighbor Embeddings31 Mar 2025
- 2023Simple and Asymmetric Graph Contrastive Learning without Augmentations29 Oct 2023
- 2023Self-Pro: A Self-Prompt and Tuning Framework for Graph Neural Networks16 Oct 2023