PULSE: Socially-Aware User Representation Modeling Toward Parameter-Efficient Graph Collaborative Filtering
Doyun Choi, Cheonwoo Lee, Biniyam Aschalew Tolera, Taewook Ham, Chanyoung Park, Jaemin Yoo
Abstract
Graph-based social recommendation (SocialRec) has emerged as a powerful extension of graph collaborative filtering (GCF), which leverages graph neural networks (GNNs) to capture multi-hop collaborative signals from user-item interactions. These methods enrich user representations by incorporating social network information into GCF, thereby integrating additional collaborative signals from social relations. However, existing GCF and graph-based So-cialRec approaches face significant challenges: they incur high computational costs and suffer from limited scalability due to the large number of parameters required to assign explicit embeddings to all users and items. In this work, we propose PULSE (Parameterefficient User representation Learning with Social Knowledge), a framework that addresses this limitation by constructing user representations from socially meaningful signals without creating an explicit learnable embedding for each user. PULSE reduces the parameter size by up to 50% compared to the most lightweight GCF baseline. Beyond parameter efficiency, our method achieves stateof-the-art performance, outperforming 13 GCF and graph-based social recommendation baselines across varying levels of interaction sparsity, from cold-start to highly active users, through a timeand memory-efficient modeling process. Our implementation is available at https://github.com/cdy9777/PULSE . CCS Concepts • Information systems → Collaborative filtering.
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.
Builds on15
- LoRA: Low-Rank Adaptation of Large Language ModelsEdward J. Hu, Yelong Shen, Phillip Wallis, Zeyuan Allen-Zhu et al.ICLR 2022 · 18,833 citations
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- Are Graph Augmentations Necessary?: Simple Graph Contrastive Learning for RecommendationJunliang Yu, Hongzhi Yin, Xin Xia, Tong Chen et al.SIGIR 2022 · 658 citations
- Automated Self-Supervised Learning for RecommendationLianghao Xia, Chao Huang, Chunzhen Huang, Kangyi Lin et al.WWW 2023 · 141 citations
Related papers
- Lightweight Embeddings for Graph Collaborative FilteringXurong Liang, Tong Chen, Lizhen Cui, Yang Wang et al.SIGIR 2024 · 13 citations
- Graph-less Collaborative FilteringLianghao Xia, Chao Huang, Jiao Shi, Yong XuWWW 2023 · 60 citations
- Graph Heterogeneous Multi-Relational RecommendationChong Chen, Weizhi Ma, Min Zhang, Zhaowei Wang et al.AAAI 2021 · 199 citations
- CKAN: Collaborative Knowledge-aware Attentive Network for Recommender SystemsZe Wang, Guangyan Lin, Huobin Tan, Qinghong Chen et al.SIGIR 2020 · 311 citations
- GSL4Rec: Session-based Recommendations with Collective Graph Structure Learning and Next Interaction PredictionChunyu Wei, Bing Bai, Kun Bai, Fei WangWWW 2022 · 17 citations
