Frequency-Corrupt Based Graph Self-Supervised Learning
Haojie Li, Mengjiao Zhang, Guanfeng Liu, Qiang Hu, Yan Wang, Junwei Du
Abstract
Graph self-supervised learning (GSSL) alleviates the graph data labeling bottleneck without supervision, enabling wide application in domains like recommendation systems and social network analysis. High-frequency signals are valuable in GSSL for capturing local structural preferences, thereby enriching graph representations and boosting model performance. However, in practical applications, two critical problems hinder the efficient and robust use of these signals. First, the locality of high-frequency signals limits their full utilization by the model. Second, over-reliance on specific high-frequency signals will affect the model's generalization. To address the above problems, we propose the Frequency-Corrupt Based Graph Self-Supervised Learning (FC-GSSL) algorithm. Specifically, we generate corrupted graphs biased toward high-frequency signals by corrupting nodes and edges according to their low-frequency contributions. These corrupted graphs are fed as input to an autoencoder, with low-frequency and general features serving as the supervision. This compels the model to effectively fuse high- and low-frequency signals, thereby integrating and utilizing more valuable high-frequency information. Additionally, we design multiple sampling strategies and form diverse corrupted graphs based on the intersections and union between the results obtained from these strategies. By aligning the node representations from these views, the model can identify valuable frequency combinations, which helps reduce the negative impact of specific high-frequency components and improve generalization. FC-GSSL optimizes the design of GSSL for web applications, significantly improving model performance on complex web-related graphs, such as social networks and citation networks. This work makes a direct contribution to advancing the ''Graph Algorithms and Modeling for the Web'' research track. Experimental results on 14 datasets across multiple tasks illustrate the superiority of the proposed approach.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cf07d72d-5179-4781-8cd0-4e581c3a9075Builds on40
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 24,064 citations
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- Contrastive Multi-View Representation Learning on GraphsKaveh Hassani, Amir Hosein Khas AhmadiICML 2020 · 1,663 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
Related papers
- Graph Positional Autoencoders as Self-supervised LearnersYang Liu, Deyu Bo, Wenxuan Cao, Yuan Fang et al.KDD 2025 · 2 citations
- GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph LearnerZhenyu Hou, Yufei He, Yukuo Cen, Xiao Liu et al.WWW 2023 · 183 citations
- GAUSS: GrAph-customized Universal Self-Supervised LearningLiang Yang, Weixiao Hu, Jizhong Xu, Runjie Shi et al.WWW 2024 · 5 citations
- Robust Graph Representation Learning for Local Corruption RecoveryBingxin Zhou, Yuanhong Jiang, Yuguang Wang, Jingwei Liang et al.WWW 2023 · 16 citations
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 773 citations
