Computer Science ›› 2026, Vol. 53 ›› Issue (9): 432-438.doi: 10.11896/jsjkx.250900132

• Information Security • Previous Articles     Next Articles

Momentum Contrast and GAN-Enhanced Sampling for Graph Contrastive Learning

WANG Chenxu1,2, WANG Shihao1, WANG Zhanggong1, SHEN Yancheng1, MENG Panpan1   

  1. 1 School of Software Engineering,Xi'an Jiaotong University,Xi'an 710049,China
    2 Key Laboratory of Intelligent Network and Network Security(Xi'an Jiaotong University),Ministry of Education,Xi'an 710049,China
  • Received:2025-09-21 Revised:2025-12-29 Online:2026-09-15 Published:2026-09-10
  • About author:WANG Chenxu,born in 1986,Ph.D,professor,Ph.D supervisor.His main research interests include cross block chain technology,data privacy-preserving,data mining and network security.
  • Supported by:
    National Natural Science Foundation of China(62272379, T2341003),Natural Science Basic Research Program of Shaanxi Province (2025JC-JCQN-081) and Fundamental Research Funds for the Central Universities(xzy012023068).

Abstract: Node-level graph contrastive learning(GCL) aims to learn discriminative node representations by constructing high-quality positive and negative sample pairs.However,existing methods suffer from semantic distortion,cross-hierarchy semantic fragmentation,and limited dynamic adaptability due to homogeneous data augmentation and randomly sampled negative pairs.To address these problems,this paper proposes a node level-augmentation free adversarial negative sampling(NL-AFANS) framework.Firstly,an adaptive Gaussian noise injection mechanism is designed based on node degree centrality to dynamically regulate noise intensity for critical nodes,effectively mitigating semantic drift caused by structural perturbations.Secondly,a graph convolutional network(GCN)-based adversarial generator with dual-constraint losses synthesizes topologically valid and semantically challenging high-order hard negative samples,alleviating false-negative contamination and feature redundancy.Concurrently,a hierarchical contrastive architecture jointly optimizes node-level local feature alignment and node-graph-level global mutual information maximization,enhancing cross-hierarchy semantic consistency.Furthermore,a dynamic curriculum strategy with gradient-decoupled alternating training and exponentially increasing difficulty weights for negative samples is introduced to adaptively align progressive learning needs.Experimental results show that NL-AFANS significantly outperforms baseline models such as DGI(Cora:82.3%) and GRACE(Cora:81.7%) in terms of accuracy in unsupervised node classification tasks on mainstream graph datasets like Cora(83.9%) and Photo(93.08%).This work provides new insights into dynamic sample optimization and hierarchical semantic alignment for node-level graph representation learning.

Key words: Graph contrastive learning, Node representation, Dynamic curriculum learning, Adversarial generation, Hierarchical contrast

CLC Number: 

  • TP391
[1] KIPF T N,WELLING M.Semi-Supervised Classification with Graph Convolutional Networks[C] //Proceedings of the International Conference on Learning Representations.2017.
[2] XU K,HU W,LESKOVEC J,et al.How powerful are graph neural networks? [J].arXiv:1810.00826,2018.
[3] VELIČKOVIĆ P,CUCURULL G,CASANOVA A,et al.Graph Attention Networks[C] //Proceedings of the International Conference on Learning Representations.2018.
[4] THAKOOR S,TALLEC C,AZAR M G,et al.Bootstrappedrepresentation learning on graphs[C] //Proceedings of the ICLR 2021 Workshop on Geometrical and Topological Representation Learning.2021.
[5] ZHAO T,LIU Y Z,NEVES L,et al.Data augmentation forgraph neural networks[C] //Proceedings of the AAAI Confe-rence on Artificial Intelligence.2021.
[6] ZHU Y Q,XU Y C,YU F,et al.Graph contrastive learning with adaptive augmentation[C] //Proceedings of the Web Conference 2021.2021.
[7] YOU Y N,CHEN T L,SUI Y D,et al.Graph contrastive lear-ning with augmentations [J].Advances in Neural Information Processing Systems,2020,33:5812-5823.
[8] ZHANG S Y,BANSAL M.Addressing Semantic Drift in Question Generation for Semi-Supervised Question Answering[C] //Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing(EMNLP-IJCNLP).2019.
[9] ROBINSON J D,CHUANG C Y,SRA S,et al.ContrastiveLearning with Hard Negative Samples[C] //Proceedings of the International Conference on Learning Representations.2020.
[10] KALANTIDIS Y,SARIYILDIZ M B,PION N,et al.Hard negative mixing for contrastive learning [J].Advances in Neural Information Processing Systems,2020,33:21798-21809.
[11] XIA J,WU L R,CHEN J T,et al.Simgrace:A simple framework for graph contrastive learning without data augmentation[C] //Proceedings of the ACM Web Conference 2022.2022.
[12] ZHU Y Q,XU Y C,YU F,et al.Deep graph contrastive representation learning [J].arXiv:2006.04131,2020.
[13] VELIČKOVIĆ P,FEDUS W,HAMILTON W L,et al.Deep Graph Infomax[C] //Proceedings of the International Confe-rence on Learning Representations.2018.
[14] XIAO T,ZHU H S,CHEN Z Y,et al.Simple and asymmetric graph contrastive learning without augmentations [J].Advances in Neural Information Processing Systems,2023,36:16129-16152.
[15] QIAN Z S,HUANG H,ZHU H,et al.Multi-Perspective Graph Contrastive Learning Recommendation Method with Layer Attention Mechanism[J].Journal of Computer Research and Development,2025,62(1):160-178.
[16] HASSANI K,KHASAHMADI A H.Contrastive multi-viewrepresentation learning on graphs[C] //Proceedings of the International Conference on Machine Learning.PMLR,2020.
[17] BAHMANI B,CHOWDHURY A,GOEL A.Fast incremental and personalized PageRank [J].Proceedings of the VLDB Endowment,2010,4(3):173-184.
[18] GRILL J B,STRUB F,ALTCHÉ F,et al.Bootstrap your own latent-a new approach to self-supervised learning [J].Advances in Neural Information Processing Systems,2020,33:21271-21284.
[19] CHEN J L,KOU G.Attribute and structure preserving graph contrastive learning[C] //Proceedings of the AAAI Conference On Artificial Intelligence.2023.
[20] GONG X M,YANG C,SHI C.Ma-gcl:Model augmentationtricks for graph contrastive learning[C] //Proceedings of the AAAI Conference on Artificial Intelligence.2023.
[1] YU Chengcheng, JIANG Yongfa, CHEN Fangshu, WANG Jiahui, MENG Xiankai. Multi-view Exercise Representation and Forgetting Mechanism for Deep KnowledgeTracing [J]. Computer Science, 2026, 53(3): 107-114.
[2] WANG Xinyu, SONG Xiaomin, ZHENG Huiming, PENG Dezhong, CHEN Jie. Contrastive Learning-based Masked Graph Autoencoder [J]. Computer Science, 2026, 53(2): 145-151.
[3] YUAN Ye, CHEN Ming, WU Anbiao, WANG Yishu. Graph Anomaly Detection Model Based on Personalized PageRank and Contrastive Learning [J]. Computer Science, 2025, 52(2): 80-90.
[4] HU Jintao, XIAN Guangming. Self-attention-based Graph Contrastive Learning for Recommendation [J]. Computer Science, 2025, 52(11): 82-89.
[5] HU Haibo, YANG Dan, NIE Tiezheng, KOU Yue. Graph Contrastive Learning Incorporating Multi-influence and Preference for Social Recommendation [J]. Computer Science, 2024, 51(7): 146-155.
[6] XIE Zhuo, KANG Le, ZHOU Lijuan, ZHANG Zhihong. Clustering Method Based on Contrastive Learning for Multi-relation Attribute Graph [J]. Computer Science, 2023, 50(11): 62-70.
[7] XIAO Yang, QIN Jianyang, LI Kenli, WANG Ge, LI Rui, LIAO Qing. Co-Forecasting for Multi-modal Traffic Flow Based on Graph Contrastive Learning [J]. Computer Science, 2023, 50(10): 135-145.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!