计算机科学 ›› 2026, Vol. 53 ›› Issue (9): 432-438.doi: 10.11896/jsjkx.250900132

• 信息安全 • 上一篇    下一篇

基于动量对比与生成对抗网络的图对比学习采样方法研究

王晨旭1,2, 王世豪1, 王张共1, 沈彦成1, 蒙盼盼1   

  1. 1 西安交通大学软件学院 西安 710049
    2 智能网络与网络安全教育部重点实验室(西安交通大学) 西安 710049
  • 收稿日期:2025-09-21 修回日期:2025-12-29 出版日期:2026-09-15 发布日期:2026-09-10
  • 通讯作者: 王晨旭(cxwang@mail.xjtu.edu.cn)
  • 基金资助:
    国家自然科学基金(62272379,T2341003);陕西省杰出青年科学基金(2025JC-JCQN-081);中央高校基本科研业务费(xzy012023068)

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 Published:2026-09-15 Online: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).

摘要: 节点级图对比学习通过构造高质量正负样本对,以学习判别性节点表示,但现有方法因均质化数据增强和随机负样本,导致存在语义失真、跨层次语义割裂及动态适应性不足等问题。针对上述问题,提出节点级多层次动态课程对比学习框架NL-AFANS。首先,基于节点度中心性设计自适应高斯噪声注入机制,动态调控关键节点的噪声强度,抑制结构扰动导致的语义漂移;其次,构建基于GCN的对抗生成器与双重约束损失,合成拓扑合理且具有高阶语义挑战性的难负样本,缓解假负样本污染与特征冗余问题;同时,提出层次化对比架构,联合节点级局部特征对齐与节点-图级全局互信息最大化,强化跨层次语义一致性;进一步引入动态课程策略,通过梯度解耦的交替训练与指数递增的负样本难度权重,适配模型训练的渐进式需求。实验结果表明,NL-AFANS在Cora(83.9%),Photo(93.08%)等主流图数据集上的无监督节点分类准确率显著优于DGI(Cora:82.3%),GRACE(Cora:81.7%)等基线模型。该研究为节点级图表示学习的动态样本优化与层次化语义对齐提供了新思路。

关键词: 图对比学习, 节点表示, 动态课程学习, 对抗生成, 层次化对比

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

中图分类号: 

  • 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.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!