The DOI matches its Crossref record; 63 of the 63 references it cites were found in a registry or an index.
Graph Contrastive Learning with Adaptive Augmentation
Open accessAbstract
Recently, contrastive learning (CL) has emerged as a successful method for unsupervised graph representation learning. Most graph CL methods first perform stochastic augmentation on the input graph to obtain two graph views and maximize the agreement of representations in the two views. Despite the prosperous development of graph CL methods, the design of graph augmentation schemes—a crucial component in CL—remains rarely explored. We argue that the data augmentation schemes should preserve intrinsic structures and attributes of graphs, which will force the model to learn representations that are insensitive to perturbation on unimportant nodes and edges. However, most existing methods adopt uniform data augmentation schemes, like uniformly dropping edges and uniformly shuffling features, leading to suboptimal performance. In this paper, we propose a novel graph contrastive representation learning method with adaptive augmentation that incorporates various priors for topological and semantic aspects of the graph. Specifically, on the topology level, we design augmentation schemes based on node centrality measures to highlight important connective structures. On the node attribute level, we corrupt node features by adding more noise to unimportant node features, to enforce the model to recognize underlying semantic information. We perform extensive experiments of node classification on a variety of real-world datasets. Experimental results demonstrate that our proposed method consistently outperforms existing state-of-the-art baselines and even surpasses some supervised counterparts, which validates the effectiveness of the proposed contrastive framework with adaptive augmentation.
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
(2014) · Cited by 33,419
PyTorch: An Imperative Style, High-Performance Deep Learning Library
Paszke, A., Gross, S., Massa, F., Lerer, A., Bradbury, J., Chanan, G., Killeen, T., Lin, Z., Gimelshein, N., Antiga, L., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.01703 · Cited by 31,473
FaceNet: A unified embedding for face recognition and clustering
Schroff, F., Kalenichenko, D., & Philbin, J. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298682 · Cited by 15,267
(2010) · Cited by 14,134
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
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
(1999) · Cited by 12,854
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
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
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Veličković, P., Casanova, A., Liò, P., Cucurull, G., Romero, A., & Bengio, Y. (2017) · arXiv (Cornell University) · doi:10.17863/cam.48429 · Cited by 8,657
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477 · cited 1×
“5 [13].”
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
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Power and Centrality: A Family of Measures
Bonacich, P. (1987) · American Journal of Sociology · doi:10.1086/228631 · Cited by 5,165
A unified architecture for natural language processing: deep neural networks with multitask learning
Collobert, R., & Weston, J. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390177 · Cited by 5,058
An Information Flow Model for Conflict and Fission in Small Groups
Zachary, W. W. (1977) · Journal of Anthropological Research · doi:10.1086/jar.33.4.3629752 · Cited by 4,704
Unsupervised 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
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3328 · Cited by 2,736
Unsupervised Representation Learning by Predicting Image Rotations
Gidaris, S., Singh, P., & Komodakis, N. (2018) · arXiv · doi:10.48550/arxiv.1803.07728 · Cited by 2,477
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Tian, Y., Krishnan, D., & Isola, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58621-8_45 · Cited by 1,997
Learning deep representations by mutual information estimation and maximization
Hjelm, R. D., Fedorov, A., Lavoie-Marchildon, S., Grewal, K., Bachman, P., Trischler, A., & Bengio, Y. (2018) · arXiv · doi:10.48550/arxiv.1808.06670 · Cited by 1,991
Proceedings for the 5th International Conference on Learning Representations
Srivastava, A., & Sutton, C. A. (2017) · Cited by 1,837
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
Self-organization in a perceptual network
Linsker, R. (1988) · Computer · doi:10.1109/2.36 · Cited by 1,469
Simplifying Graph Convolutional Networks
Wu, F., Zhang, T., Junior, A. H. D. S., Fifty, C., Yu, T., & Weinberger, K. Q. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.07153 · Cited by 1,165
Fast Graph Representation Learning with PyTorch Geometric
Fey, M., & Lenssen, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.02428 · Cited by 1,132
Cooperative Game Theory Approaches for Network Partitioning
Avrachenkov, K. E., Kondratev, A. Y., & Mazalov, V. V. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-62389-4_49 · Cited by 1,073
Data-Efficient Image Recognition with Contrastive Predictive Coding
Hénaff, O. J., Srinivas, A., De Fauw, J., Razavi, A., Doersch, C., Eslami, S. M. A., & Oord, A. V. D. (2019) · arXiv · doi:10.48550/arxiv.1905.09272 · Cited by 1,014
A simple framework for contrastive learning of visual representations
Chen, T. (2024) · TIB Data Manager · doi:10.57702/iuuvgtaz · Cited by 973
RhizoDB: A Bounded Activation-Flow Architecture for Graph-Based Memory Systems
Guberte, J. A. (2026) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.20695702 · Cited by 866
GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training
Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., & Tang, J. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403168 · Cited by 777
What makes for good views for contrastive learning
Tian, Y., Sun, C., Poole, B., Krishnan, D., Schmid, C., & Isola, P. (2020) · arXiv · doi:10.48550/arxiv.2005.10243 · Cited by 773
Variational Graph Auto-Encoders
Kipf, T., & Welling, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.07308 · Cited by 772
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Qiu, J., Dong, Y., Ma, H., Li, J., Wang, K., & Tang, J. (2018) · Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining · doi:10.1145/3159652.3159706 · Cited by 717
Diffusion Improves Graph LearningPreprint
Klicpera, J., Weißenberger, S., & Günnemann, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1911.05485 · Cited by 603
Unsupervised Embedding Learning via Invariant and Spreading Instance Feature
Ye, M., Zhang, X., Yuen, P. C., & Chang, S.-F. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00637 · Cited by 601
Shchur, O., Mumme, M., Bojchevski, A., & Günnemann, S. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.05868 · Cited by 588
Gutmann, M. U., & Hyvärinen, A. (2012) · Edinburgh Research Explorer (University of Edinburgh) · doi:10.5555/2503308.2188396 · Cited by 581
Graph Representation Learning via Graphical Mutual Information Maximization
Peng, Z., Huang, W., Luo, M., Zheng, Q., Rong, Y., Xu, T., & Huang, J. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380112 · Cited by 536
On Variational Bounds of Mutual Information
Poole, B., Ozair, S., Oord, A. V. D., Alemi, A. A., & Tucker, G. (2019) · arXiv · doi:10.48550/arxiv.1905.06922 · Cited by 480
Colorization as a Proxy Task for Visual Understanding
Larsson, G., Maire, M., & Shakhnarovich, G. (2017) · 2017 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2017.96 · Cited by 458
Learning word embeddings efficiently with noise-contrastive estimation
Mnih, A., & Kavukcuoglu, K. (2013) · neural information processing systems · 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
Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural NetworksPreprint
Mernyei, P., & Cangea, C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.02901 · Cited by 411
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-citation(2019) · neural information processing systems · Cited by 350
Representation Learning on Graphs: Methods and Applications
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.05584 · Cited by 290
Proceedings of the 7th Python in Science Conference
(2008) · Proceedings of the Python in Science Conference · doi:10.25080/pfvc8793 · Cited by 285
Veličković, P., Fedus, W., Hamilton, W. L., Lió, P., Bengio, Y., & Hjelm, R. D. (2018) · Apollo (University of Cambridge) · doi:10.17863/cam.40744 · Cited by 279
(2012) · InTech eBooks · doi:10.5772/1796 · Cited by 269
On Mutual Information Maximization for Representation Learning
Tschannen, M., Djolonga, J., Rubenstein, P. K., Gelly, S., & Lučić, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.13625 · Cited by 253
What Should Not Be Contrastive in Contrastive LearningPreprint
Xiao, T., Wang, X.-L., Efros, A. A., & Darrell, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2008.05659 · Cited by 223
Hierarchical Graph Convolutional Networks for Semi-supervised Node Classification
Hu, F., Zhu, Y., Wu, S., Wang, L., & Tan, T. (2019) · Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/630 · Cited by 171 · cited 2×
“However, existing GNN models are mostly established in a supervised manner [20, 23, 45], which require abundant labeled nodes for training.”
BackgroundSelf-citationData-Efficient Image Recognition with Contrastive Predictive Coding
Hénaff, O. J. (2020) · International Conference on Machine Learning · Cited by 168
A Framework For Contrastive Self-Supervised Learning And Designing A New ApproachPreprint
Falcon, W., & Cho, K. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.00104 · Cited by 115
On Mutual Information in Contrastive Learning for Visual RepresentationsPreprint
Wu, M., Zhuang, C., Mosse, M., Yamins, D. L. K., & Goodman, N. D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.13149 · Cited by 89
Chen, 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
Improving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
Lin, Z., Tian, C., Hou, Y., & Zhao, W. X. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512104 · Cited by 572
A comprehensive survey on pretrained foundation models: a history from BERT to ChatGPT
Zhou, C., Li, Q., Li, C., Yu, J., Liu, Y., Wang, G., Zhang, K., Ji, C., Yan, Q., He, L., et al. (2025) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-024-02443-6 · Cited by 557
Graph Self-Supervised Learning: A Survey
Liu, Y., Jin, M., Pan, S., Zhou, C., Zheng, Y., Xia, F., & Yu, P. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2022.3172903 · Cited by 510
Self-Supervised Learning of Graph Neural Networks: A Unified Review
Xie, Y., Xu, Z., Zhang, J., Wang, Z., & Ji, S. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3170559 · Cited by 389
Mining Latent Structures for Multimedia Recommendation
Zhang, J., Zhu, Y., Liu, Q., Wu, S., Wang, S., & Wang, L. (2021) · Proceedings of the 29th ACM International Conference on Multimedia · doi:10.1145/3474085.3475259 · Cited by 354
Self-citation
Metadata
- Authors
- Zhu, Y., Xu, Y., Yu, F., Liu, Q., Wu, S., & Wang, L.
- Venue
- Proceedings of the Web Conference 2021
- Publisher
- ACM
- Published
- 2021-04-19
- Pages
- 2069-2080
- OpenAlex
- W3095746859
- Cited by
- 1,066
- References
- 63
- FWCI
- 85.64
- Type
- conference paper
- Language
- en
- Open access
- gold
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.