The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentation
Open accessAbstract
Graph contrastive learning (GCL) has emerged as a dominant technique for graph representation learning which maximizes the mutual information between paired graph augmentations that share the same semantics. Unfortunately, it is difficult to preserve semantics well during augmentations in view of the diverse nature of graph data. Currently, data augmentations in GCL broadly fall into three unsatisfactory ways. First, the augmentations can be manually picked per dataset by trial-and-errors. Second, the augmentations can be selected via cumbersome search. Third, the augmentations can be obtained with expensive domain knowledge as guidance. All of these limit the efficiency and more general applicability of existing GCL methods. To circumvent these crucial issues, we propose a Simple framework for GRAph Contrastive lEarning, SimGRACE for brevity, which does not require data augmentations. Specifically, we take original graph as input and GNN model with its perturbed version as two encoders to obtain two correlated views for contrast. SimGRACE is inspired by the observation that graph data can preserve their semantics well during encoder perturbations while not requiring manual trial-and-errors, cumbersome search or expensive domain knowledge for augmentations selection. Also, we explain why SimGRACE can succeed. Furthermore, we devise adversarial training scheme, dubbed AT-SimGRACE, to enhance the robustness of graph contrastive learning and theoretically explain the reasons. Albeit simple, we show that SimGRACE can yield competitive or better performance compared with state-of-the-art methods in terms of generalizability, transferability and robustness, while enjoying unprecedented degree of flexibility and efficiency. The code is available at: https://github.com/junxia97/SimGRACE.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
Momentum Contrast for Unsupervised Visual Representation Learning
He, K., Fan, H., Wu, Y., Xie, S., & Girshick, R. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00975 · Cited by 13,347
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
A simple framework for contrastive learning of visual representations
Chen, T., Kornblith, S., Norouzi, M., & Hinton, G. (2020) · arXiv · doi:10.48550/arxiv.2002.05709 · Cited by 10,857
Towards Deep Learning Models Resistant to Adversarial Attacks
Madry, A., Makelov, A., Schmidt, L., Tsipras, D., & Vladu, A. (2017) · arXiv · doi:10.48550/arxiv.1706.06083 · Cited by 6,602
Representation Learning with Contrastive Predictive Coding
Oord, A. V. D., Li, Y., & Vinyals, O. (2018) · arXiv · doi:10.48550/arxiv.1807.03748 · Cited by 6,242
On Assessing ML Model Robustness: A Methodological Framework (Academic Track)
Awadid, A., & Robert, B. (2025) · OASIcs : OpenAccess Series in Informatics · doi:10.4230/oasics.saia.2024.1 · Cited by 4,702
ALBERT: A Lite BERT for Self-supervised Learning of Language Representations
Lan, Z., Chen, M., Goodman, S., Gimpel, K., Sharma, P., & Soricut, R. (2019) · arXiv · doi:10.48550/arxiv.1909.11942 · Cited by 4,308 · cited 1×
“Inspired by the success of self-supervised learning in computer vision [20, 42] and natural language processing [8, 23], tremendous”
MethodUnsupervised Feature Learning via Non-parametric Instance Discrimination
Wu, Z., Xiong, Y., Yu, S. X., & Lin, D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00393 · Cited by 3,664
Formal Semantics for Kolmogorov-Arnold Network Representations of Operational Games
Zhukov, G. A. (2025) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.15206559 · Cited by 3,212
Weisfeiler-Lehman Graph Kernels
Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2010) · Max Planck Digital Library · Cited by 1,644
(2016) · neural information processing systems · Cited by 1,572
Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach
Wagner, C., Dodge, S., & Alizadeh, D. (2025) · Leibniz international proceedings in informatics · doi:10.4230/lipics.giscience.2025.9 · Cited by 1,543
Graph Contrastive Learning with Adaptive Augmentation
Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., & Wang, L. (2021) · Proceedings of the Web Conference 2021 · doi:10.1145/3442381.3449802 · Cited by 1,066
Yanardag, P., & Vishwanathan, S. V. N. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783417 · Cited by 1,021
Graph Contrastive Learning with Augmentations
You, Y., Chen, T., Sui, Y., Chen, T., Wang, Z., & Shen, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.13902 · Cited by 824
Graph Contrastive Learning AutomatedPreprint
You, Y., Chen, T., Shen, Y., & Wang, Z. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.07594 · Cited by 671
Distinguishing Enzyme Structures from Non-enzymes Without Alignments
Dobson, P. D., & Doig, A. J. (2003) · Journal of Molecular Biology · doi:10.1016/s0022-2836(03)00628-4 · Cited by 579
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
Riesen, K., & Bunke, H. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-89689-0_33 · Cited by 498
graph2vec: Learning Distributed Representations of Graphs
Narayanan, A. S., Chandramohan, M., Venkatesan, R., Chen, L., Liu, Y., & Jaiswal, S. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.05005 · Cited by 494
McAllester, D. A. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279989 · Cited by 464
Discriminative Embeddings of Latent Variable Models for Structured Data
Dai, H., Dai, B., & Song, L. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05629 · Cited by 454
GPT-GNN: Generative Pre-Training of Graph Neural Networks
Hu, Z., Dong, Y., Wang, K., Chang, K.-W., & Sun, Y. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403237 · Cited by 446
Contrastive Multi-View Representation Learning on Graphs
Hassani, K., & Khasahmadi, A. H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.05582 · Cited by 423
Deep Graph Contrastive Representation Learning
Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., & Wang, L. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.04131 · Cited by 389
Self-Supervised Graph Transformer on Large-Scale Molecular Data
Rong, Y., Bian, Y., Xu, T., Xie, W., Wei, Y., Huang, W., & Huang, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.02835 · Cited by 388
McAllester, D. A. (1999) · Proceedings of the twelfth annual conference on Computational learning theory · doi:10.1145/307400.307435 · Cited by 354
Exploring Generalization in Deep Learning
Neyshabur, B., Bhojanapalli, S., McAllester, D., & Srebro, N. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.08947 · Cited by 284
TUDataset: A collection of benchmark datasets for learning with graphs
Morris, C., Kriege, N. M., Bause, F., Kersting, K., Mutzel, P., & Neumann, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.08663 · Cited by 281
Multi-Scale Contrastive Siamese Networks for Self-Supervised Graph Representation Learning
Jin, M., Zheng, Y., Li, Y.-F., Gong, C., Zhou, C. D., & Pan, S. (2021) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2021/204 · Cited by 219
Sub2Vec: Feature Learning for Subgraphs
Adhikari, B., Zhang, Y., Ramakrishnan, N., & Prakash, B. A. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-93037-4_14 · Cited by 213
On Sampling Strategies for Neural Network-based Collaborative Filtering
Chen, T., Sun, Y., Shi, Y., & Hong, L. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098202 · Cited by 209
Co-learning: Learning from Noisy Labels with Self-supervision
Tan, C., Xia, J., Wu, L., & Li, S. Z. (2021) · ACM International Conference on Multimedia (ACM MM) · doi:10.1145/3474085.3475622 · Cited by 203
Self-citationContrastive Learning with Adversarial ExamplesPreprint
Ho, C.-H., & Vasconcelos, N. M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.12050 · Cited by 163
Bootstrapped Representation Learning on GraphsPreprint
Thakoor, S., Tallec, C., Azar, M. G., Munos, R., Veličković, P., & Valko, M. (2021) · arXiv (Cornell University) · Cited by 118
On the Loss Landscape of Adversarial Training: Identifying Challenges and How to Overcome ThemPreprint
Liu, C., Salzmann, M., Lin, T., Tomioka, R., & Susstrunk, S. E. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.08403 · Cited by 99
Are Powerful Graph Neural Nets Necessary? A Dissection on Graph ClassificationPreprint
Chen, T., Bian, S., & Sun, Y. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.04579 · Cited by 92
GPT-GNN: Generative Pre-Training of Graph Neural NetworksPreprint
Hu, Z., Dong, Y., Wang, K., Chang, K.-W., & Sun, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.15437 · Cited by 84
A Survey of Pretraining on Graphs: Taxonomy, Methods, and ApplicationsPreprint
Xia, J., Zhu, Y., Du, Y., & Li, S. Z. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2202.07893 · Cited by 72
Self-citationTowards Robust Graph Contrastive LearningPreprint
Jovanović, N., Zhao, M., Faber, L., & Wattenhofer, R. P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2102.13085 · Cited by 52
An API Oriented Open-source Python Framework for Unsupervised Learning on GraphsPreprint
Rózemberczki, B., Kiss, O., & Sarkar, R. (2020) · arXiv (Cornell University) · Cited by 27
Towards Effective and Generalizable Fine-tuning for Pre-trained Molecular Graph ModelsPreprint
Xia, J., Zheng, J., Tan, C., Wang, G., & Li, S. Z. (2022) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2022.02.03.479055 · Cited by 21
Self-citationUnderstanding Adversarial Robustness Through Loss Landscape GeometriesPreprint
Prabhu, V. U., Yap, D. A., Xu, J., & Whaley, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.09061 · Cited by 18
Debiased Graph Contrastive Learning.Preprint
Xia, J., Wu, L., Chen, J., et al. (2021) · arXiv (Cornell University) · Cited by 7
Self-citationChen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
A Comprehensive Survey on Deep Graph Representation Learning
Ju, W., Fang, Z., Gu, Y., Liu, Z., Long, Q., Qiao, Z., Qin, Y., Shen, J., Sun, F., Xiao, Z., et al. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106207 · Cited by 341
Metadata
- Authors
- Xia, J., Wu, L., Chen, J., Hu, B., & Li, S. Z.
- Venue
- Proceedings of the ACM Web Conference 2022
- Publisher
- ACM
- Published
- 2022-04-25
- Pages
- 1070-1079
- OpenAlex
- W4221023051
- Cited by
- 289
- References
- 45
- FWCI
- 37.14
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.