Self-Supervised Denoising through Independent Cascade Graph Augmentation for Robust Social Recommendation
Youchen Sun, Zhu Sun, Yingpeng Du, Jie Zhang, Yew Soon Ong
Abstract
Social Recommendation (SR) typically exploits neighborhood influence in the social network to enhance user preference modeling. However, users' intricate social behaviors may introduce noisy social connections for user modeling and harm the models' robustness. Existing solutions to alleviate social noise either filter out the noisy connections or generate new potential social connections. Due to the absence of labels, the former approaches may retain uncertain connections for user preference modeling while the latter methods may introduce additional social noise. Through data analysis, we discover that (1) social noise likely comes from the connected users with low preference similarity; and (2) Opinion Leaders (OLs) play a pivotal role in influence dissemination, surpassing high-similarity neighbors, regardless of their preference similarity with trusting peers. Guided by these observations, we propose a novel Self-Supervised Denoising approach through Independent Cascade Graph Augmentation, for more robust SR. Specifically, we employ the independent cascade diffusion model to generate an augmented graph view, which traverses the social graph and activates the edges in sequence to simulate the cascading influence spread. To steer the augmentation towards a denoised social graph, we (1) introduce a hierarchical contrastive loss to prioritize the activation of OLs first, followed by high-similarity neighbors, while weakening the low-similarity neighbors; and (2) integrate an information bottleneck based contrastive loss, aiming to minimize mutual information between original and augmented graphs yet preserve sufficient information for improved SR. Experiments conducted on two public datasets demonstrate that our model outperforms the state-of-the-art while also exhibiting higher robustness to different extents of social noise.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get d721aedc-9504-4277-a17b-7ed5c2d796b1Cited by top-tier papers6
- Collaboration! Towards Robust Neural Methods for Routing ProblemsJianan Zhou, Yaoxin Wu, Zhiguang Cao, Wen Song et al.NeurIPS 2024 · 12 citations
- Embedding-Space Orthogonal Decomposition for Robust Social RecommendationRongfeng Guo, Yinxuan Huang, Wei Chen, Mingyang Zhou et al.KDD 2026 · 1 citation
- PULSE: Socially-Aware User Representation Modeling Toward Parameter-Efficient Graph Collaborative FilteringDoyun Choi, Cheonwoo Lee, Biniyam Aschalew Tolera, Taewook Ham et al.WWW 2026
- Dual-Phase Playtime-guided Recommendation: Interest Intensity Exploration and Multimodal Random WalksJingmao Zhang, Zhiting Zhao, Yunqi Lin, Jianghong Ma et al.ACM MM 2025
- Deep Hierarchical Knowledge Loss for Fault Intensity DiagnosisYu Sha, Shuiping Gou, Bo Liu, Haofan Lu et al.KDD 2026
Related papers
- Dual Graph Denoising Model for Social RecommendationAnchen Li, Bo YangWWW 2025 · 15 citations
- Graph Augmentation for RecommendationQianru Zhang, Lianghao Xia, Xuheng Cai, Siu-Ming Yiu et al.ICDE 2024 · 31 citations
- Model-Agnostic Social Network Refinement with Diffusion Models for Robust Social RecommendationYouchen Sun, Zhu Sun, Yingpeng Du, Jie Zhang et al.WWW 2025 · 10 citations
- Robust Preference-Guided Denoising for Graph based Social RecommendationYuhan Quan, Jingtao Ding, Chen Gao, Lingling Yi et al.WWW 2023 · 85 citations
- Graph Bottlenecked Social RecommendationYonghui Yang, Le Wu, Zihan Wang, Zhuangzhuang He et al.KDD 2024 · 34 citations
