PULSE: Socially-Aware User Representation Modeling Toward Parameter-Efficient Graph Collaborative Filtering

• URL: http://arxiv.org/abs/2601.14720v2
• Date: Wed, 28 Jan 2026 04:54:53 GMT
• Title: PULSE: Socially-Aware User Representation Modeling Toward Parameter-Efficient Graph Collaborative Filtering
• Authors: Doyun Choi, Cheonwoo Lee, Biniyam Aschalew Tolera, Taewook Ham, Chanyoung Park, Jaemin Yoo,
• Abstract summary: Graph-based social recommendation (SocialRec) has emerged as a powerful extension of graph collaborative filtering (GCF)<n>We propose PULSE (efficient User representation 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.<n>Our method achieves state-of-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 time- and memory-efficient modeling process.
• Score: 14.34577569889612
• License: http://creativecommons.org/licenses/by/4.0/
• 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 SocialRec 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 (Parameter-efficient 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 state-of-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 time- and memory-efficient modeling process.

Related papers

• Invariance Matters: Empowering Social Recommendation via Graph Invariant Learning [39.957513241513105]
  Social Graph Invariant Learning (SGIL) aims to uncover stable user preferences within the input social graph.<n>To achieve this goal, SGIL first simulates multiple noisy social environments through graph generators.<n>To further promote diversity in the generated social environments, we employ an adversarial training strategy.
  arXiv  Detail & Related papers  (2025-04-14T17:20:48Z)
• CombiGCN: An effective GCN model for Recommender System [0.0]
  Graph Neural Networks (GNNs) have opened up a potential line of research for collaborative filtering (CF)<n>We propose a recommendation framework, CombiGCN, in which item embeddings are only linearly propagated on the user-item interaction graph.<n>We also conducted experiments comparing CombiGCN with several state-of-the-art models on three real-world datasets.
  arXiv  Detail & Related papers  (2025-03-27T13:03:27Z)
• RGL: A Graph-Centric, Modular Framework for Efficient Retrieval-Augmented Generation on Graphs [58.10503898336799]
  We introduce the RAG-on-Graphs Library (RGL), a modular framework that seamlessly integrates the complete RAG pipeline.<n>RGL addresses key challenges by supporting a variety of graph formats and integrating optimized implementations for essential components.<n>Our evaluations demonstrate that RGL not only accelerates the prototyping process but also enhances the performance and applicability of graph-based RAG systems.
  arXiv  Detail & Related papers  (2025-03-25T03:21:48Z)
• Learning Social Graph for Inactive User Recommendation [50.090904659803854]
  LSIR learns an optimal social graph structure for social recommendation, especially for inactive users. Experiments on real-world datasets demonstrate that LSIR achieves significant improvements of up to 129.58% on NDCG in inactive user recommendation.
  arXiv  Detail & Related papers  (2024-05-08T03:40:36Z)
• Ranking-based Group Identification via Factorized Attention on Social Tripartite Graph [68.08590487960475]
  We propose a novel GNN-based framework named Contextualized Factorized Attention for Group identification (CFAG) We devise tripartite graph convolution layers to aggregate information from different types of neighborhoods among users, groups, and items. To cope with the data sparsity issue, we devise a novel propagation augmentation layer, which is based on our proposed factorized attention mechanism.
  arXiv  Detail & Related papers  (2022-11-02T01:42:20Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Knowledge-aware Coupled Graph Neural Network for Social Recommendation [29.648300580880683]
  We propose a Knowledge-aware Coupled Graph Neural Network (KCGN) that injects the inter-dependent knowledge across items and users into the recommendation framework. KCGN enables the high-order user- and item-wise relation encoding by exploiting the mutual information for global graph structure awareness. We further augment KCGN with the capability of capturing dynamic multi-typed user-item interactive patterns.
  arXiv  Detail & Related papers  (2021-10-08T09:13:51Z)
• Social Recommendation with Self-Supervised Metagraph Informax Network [21.41026069530997]
  We propose a Self-Supervised Metagraph Infor-max Network (SMIN) which investigates the potential of incorporating social- and knowledge-aware relational structures into the user preference representation for recommendation. To inject high-order collaborative signals, we generalize the mutual information learning paradigm under the self-supervised graph-based collaborative filtering. Experimental results on several real-world datasets demonstrate the effectiveness of our SMIN model over various state-of-the-art recommendation methods.
  arXiv  Detail & Related papers  (2021-10-08T08:18:37Z)
• Graph Convolutional Embeddings for Recommender Systems [67.5973695167534]
  We propose a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions. More specifically, we define a graph convolutional embedding layer for N-partite graphs that processes user-item-context interactions.
  arXiv  Detail & Related papers  (2021-03-05T10:46:16Z)
• Disentangled Graph Collaborative Filtering [100.26835145396782]
  Disentangled Graph Collaborative Filtering (DGCF) is a new model for learning informative representations of users and items from interaction data. By modeling a distribution over intents for each user-item interaction, we iteratively refine the intent-aware interaction graphs and representations. DGCF achieves significant improvements over several state-of-the-art models like NGCF, DisenGCN, and MacridVAE.
  arXiv  Detail & Related papers  (2020-07-03T15:37:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.