Automated Self-Supervised Learning for Recommendation
Lianghao Xia, Chao Huang, Chunzhen Huang, Kangyi Lin, Tao Yu, Ben Kao
Abstract
Graph neural networks (GNNs) have emerged as the state-of-the-art paradigm for collaborative filtering (CF). To improve the representation quality over limited labeled data, contrastive learning has attracted attention in recommendation and benefited graph-based CF model recently. However, the success of most contrastive methods heavily relies on manually generating effective contrastive views for heuristic-based data augmentation. This does not generalize across different datasets and downstream recommendation tasks, which is difficult to be adaptive for data augmentation and robust to noise perturbation. To fill this crucial gap, this work proposes a unified Automated Collaborative Filtering (AutoCF) to automatically perform data augmentation for recommendation. Specifically, we focus on the generative self-supervised learning framework with a learnable augmentation paradigm that benefits the automated distillation of important self-supervised signals. To enhance the representation discrimination ability, our masked graph autoencoder is designed to aggregate global information during the augmentation via reconstructing the masked subgraph structures. Experiments and ablation studies are performed on several public datasets for recommending products, venues, and locations. Results demonstrate the superiority of AutoCF against various baseline methods. We release the model implementation at https://github.com/HKUDS/AutoCF . CCS CONCEPTS • Information systems → Recommender systems.
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 9d16bdb8-a02d-4bad-b4cc-7df58869fcf9Cited by top-tier papers26
- Representation Learning with Large Language Models for RecommendationXubin Ren, Wei Wei, Lianghao Xia, Lixin Su et al.WWW 2024 · 385 citations
- GraphGPT: Graph Instruction Tuning for Large Language ModelsJiabin Tang, Yuhao Yang, Wei Wei, Lei Shi et al.SIGIR 2024 · 182 citations
- Disentangled Contrastive Collaborative FilteringXubin Ren, Lianghao Xia, Jiashu Zhao, Dawei Yin et al.SIGIR 2023 · 154 citations
- Knowledge Graph Self-Supervised Rationalization for RecommendationYuhao Yang, Chao Huang, Lianghao Xia, Chunzhen HuangKDD 2023 · 151 citations
- SelfGNN: Self-Supervised Graph Neural Networks for Sequential RecommendationYuxi Liu, Lianghao Xia, Chao HuangSIGIR 2024 · 62 citations
Builds on24
- Supervised Contrastive LearningPrannay Khosla, Piotr Teterwak, Chen Wang, Aaron Sarna et al.NeurIPS 2020 · 7,049 citations
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Restormer: Efficient Transformer for High-Resolution Image RestorationSyed Waqas Zamir, Aditya Arora, Salman Khan, Munawar Hayat et al.CVPR 2022 · 3,348 citations
- Reformer: The Efficient TransformerNikita Kitaev, Lukasz Kaiser, Anselm LevskayaICLR 2020 · 2,878 citations
- Simple and Deep Graph Convolutional NetworksMing Chen, Zhewei Wei, Zengfeng Huang, Bolin Ding et al.ICML 2020 · 1,910 citations
Related papers
- Graph Augmentation for RecommendationQianru Zhang, Lianghao Xia, Xuheng Cai, Siu-Ming Yiu et al.ICDE 2024 · 31 citations
- Graph Masked Autoencoder for Sequential RecommendationYaowen Ye, Lianghao Xia, Chao HuangSIGIR 2023 · 63 citations
- LightGCL: Simple Yet Effective Graph Contrastive Learning for RecommendationXuheng Cai, Chao Huang, Lianghao Xia, Xubin RenICLR 2023 · 99 citations
- Meta-optimized Structural and Semantic Contrastive Learning for Graph Collaborative FilteringYongjing Hao, Pengpeng Zhao, Jianfeng Qu, Lei Zhao et al.ICDE 2024 · 1 citation
- Path-Enhanced Contrastive Learning for RecommendationHaoran Sun, Fei Xiong, Yuanzhe Hu, Liang WangNeurIPS 2025
