Frequency-Corrupt Based Graph Self-Supervised Learning
Haojie Li, Mengjiao Zhang, Guanfeng Liu, Qiang Hu, Yan Wang, Junwei Du
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
它引用的顶会 Paper40
- A Simple Framework for Contrastive Learning of Visual RepresentationsTing Chen, Simon Kornblith, Mohammad Norouzi, Geoffrey E. HintonICML 2020 · 被引用 24,064 次
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen 等NeurIPS 2020 · 被引用 3,042 次
- Contrastive Multi-View Representation Learning on GraphsKaveh Hassani, Amir Hosein Khas AhmadiICML 2020 · 被引用 1,663 次
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He 等SIGIR 2021 · 被引用 1,476 次
相关 Paper
- Graph Positional Autoencoders as Self-supervised LearnersYang Liu, Deyu Bo, Wenxuan Cao, Yuan Fang 等KDD 2025 · 被引用 2 次
- GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph LearnerZhenyu Hou, Yufei He, Yukuo Cen, Xiao Liu 等WWW 2023 · 被引用 183 次
- GAUSS: GrAph-customized Universal Self-Supervised LearningLiang Yang, Weixiao Hu, Jizhong Xu, Runjie Shi 等WWW 2024 · 被引用 5 次
- Robust Graph Representation Learning for Local Corruption RecoveryBingxin Zhou, Yuanhong Jiang, Yuguang Wang, Jingwei Liang 等WWW 2023 · 被引用 16 次
- Beyond Low-frequency Information in Graph Convolutional NetworksDeyu Bo, Xiao Wang, Chuan Shi, Huawei ShenAAAI 2021 · 被引用 773 次
