RoSA: A Robust Self-Aligned Framework for Node-Node Graph Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Graph contrastive learning has gained significant progress recently. However, existing works have rarely explored non-aligned node-node contrasting. In this paper, we propose a novel graph contrastive learning method named RoSA that focuses on utilizing non-aligned augmented views for node-level representation learning. First, we leverage the earth mover's distance to model the minimum effort to transform the distribution of one view to the other as our contrastive objective, which does not require alignment between views. Then we introduce adversarial training as an auxiliary method to increase sampling diversity and enhance the robustness of our model. Experimental results show that RoSA outperforms a series of graph contrastive learning frameworks on homophilous, non-homophilous and dynamic graphs, which validates the effectiveness of our work. To the best of our awareness, RoSA is the first work focuses on the non-aligned node-node graph contrastive learning problem. Our codes are available at: hrefhttps://github.com/ZhuYun97/RoSAtexttthttps://github.com/ZhuYun97/RoSA
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 27 of its 45 references that are in the map. First posted on arXiv 29 Apr 2022.
Builds on
27 of 45 references.
References · 27
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,662
- 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
- 2014Explaining and Harnessing Adversarial Examplescited by 7,287
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,326
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
- 2019Fast Graph Representation Learning with PyTorch Geometriccited by 2,414
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,168
15 more
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,265
- 2020Graph Contrastive Learning with Augmentationscited by 1,203
- 2018Deep Graph Infomaxcited by 1,101
- 2018Pitfalls of Graph Neural Network Evaluationcited by 994
- 2020Geom-GCN: Geometric Graph Convolutional Networkscited by 821
- 2019Adversarial Training for Free!cited by 638
- 2020Deep Graph Contrastive Representation Learningcited by 535
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2019FreeLB: Enhanced Adversarial Training for Natural Language Understandingcited by 261
- 2020Graph Representation Learning via Graphical Mutual Information Maximizationcited by 217
- 2021An Empirical Study of Graph Contrastive Learningcited by 113
- 2020Sub-graph Contrast for Scalable Self-Supervised Graph Representation Learningcited by 90
- 2020Self-EMD: Self-Supervised Object Detection without ImageNetcited by 70
- 2015Homophily and missing links in citation networkscited by 21
Built on by
Citing papers per year: 2022: 1; 2023: 6; 2024: 4; 2025: 1.
12 papers.
- 2024GraphCLIP: Enhancing Transferability in Graph Foundation Models for Text-Attributed Graphscited by 58
- 2022Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented Viewcited by 54
- 2024Efficient Tuning and Inference for Large Language Models on Textual Graphscited by 54
- 2023SGL-PT: A Strong Graph Learner with Graph Prompt Tuningcited by 35
- 2023GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learningcited by 32
- 2025Generative Multimodal Pretraining with Discrete Diffusion Timestep Tokenscited by 27
- 2024Towards Unified Multimodal Editing with Enhanced Knowledge Collaborationcited by 18
- 2023SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT Inferencecited by 9
- 2023CSGCL: Community-Strength-Enhanced Graph Contrastive Learningcited by 7
- 2023MARIO: Model Agnostic Recipe for Improving OOD Generalization of Graph Contrastive Learningcited by 7
- 2024Meta-Reflection: A Feedback-Free Reflection Learning Frameworkcited by 2
- 2023Structure-Aware Group Discrimination with Adaptive-View Graph Encoder: A Fast Graph Contrastive Learning Frameworkcited by 1
- 2025Generative Multimodal Pretraining with Discrete Diffusion Timestep Tokens20 Apr 2025
- 2024Meta-Reflection: A Feedback-Free Reflection Learning Framework18 Dec 2024
- 2024GraphCLIP: Enhancing Transferability in Graph Foundation Models for Text-Attributed Graphs14 Oct 2024
- 2024Towards Unified Multimodal Editing with Enhanced Knowledge Collaboration30 Sep 2024
- 2024Efficient Tuning and Inference for Large Language Models on Textual Graphs28 Jan 2024
- 2023GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learning11 Oct 2023
- 2023MARIO: Model Agnostic Recipe for Improving OOD Generalization of Graph Contrastive Learning24 Jul 2023
- 2023CSGCL: Community-Strength-Enhanced Graph Contrastive Learning8 May 2023
- 2023SmartBERT: A Promotion of Dynamic Early Exiting Mechanism for Accelerating BERT Inference16 Mar 2023
- 2023Structure-Aware Group Discrimination with Adaptive-View Graph Encoder: A Fast Graph Contrastive Learning Framework9 Mar 2023
- 2023SGL-PT: A Strong Graph Learner with Graph Prompt Tuning24 Feb 2023
- 2022Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented View1 Dec 2022