GPatch: Patching Graph Neural Networks for Cold-Start Recommendations

• URL: http://arxiv.org/abs/2209.12215v1
• Date: Sun, 25 Sep 2022 13:16:39 GMT
• Title: GPatch: Patching Graph Neural Networks for Cold-Start Recommendations
• Authors: Hao Chen, Zefan Wang, Yue Xu, Xiao Huang, Feiran Huang
• Abstract summary: Cold start is an essential and persistent problem in recommender systems. State-of-the-art solutions rely on training hybrid models for both cold-start and existing users/items. We propose a tailored GNN-based framework (GPatch) that contains two separate but correlated components.
• Score: 20.326139541161194
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cold start is an essential and persistent problem in recommender systems. State-of-the-art solutions rely on training hybrid models for both cold-start and existing users/items, based on the auxiliary information. Such a hybrid model would compromise the performance of existing users/items, which might make these solutions not applicable in real-worlds recommender systems where the experience of existing users/items must be guaranteed. Meanwhile, graph neural networks (GNNs) have been demonstrated to perform effectively warm (non-cold-start) recommendations. However, they have never been applied to handle the cold-start problem in a user-item bipartite graph. This is a challenging but rewarding task since cold-start users/items do not have links. Besides, it is nontrivial to design an appropriate GNN to conduct cold-start recommendations while maintaining the performance for existing users/items. To bridge the gap, we propose a tailored GNN-based framework (GPatch) that contains two separate but correlated components. First, an efficient GNN architecture -- GWarmer, is designed to model the warm users/items. Second, we construct correlated Patching Networks to simulate and patch GWarmer by conducting cold-start recommendations. Experiments on benchmark and large-scale commercial datasets demonstrate that GPatch is significantly superior in providing recommendations for both existing and cold-start users/items.

Related papers

• Node Duplication Improves Cold-start Link Prediction [52.917775253887264]
  Graph Neural Networks (GNNs) are prominent in graph machine learning. Recent studies show that GNNs struggle to produce good results on low-degree nodes. We propose a simple yet surprisingly effective augmentation technique called NodeDup.
  arXiv  Detail & Related papers  (2024-02-15T05:07:39Z)
• Cold & Warm Net: Addressing Cold-Start Users in Recommender Systems [10.133475523630139]
  Cold-start recommendation is one of the major challenges faced by recommender systems (RS) In this paper, we propose Cold & Warm Net based on expert models who are responsible for modeling cold-start and warm-up users respectively. The proposed model has also been deployed on an industrial short video platform and achieves a significant increase in app dwell time and user retention rate.
  arXiv  Detail & Related papers  (2023-09-27T13:31:43Z)
• Could Small Language Models Serve as Recommenders? Towards Data-centric Cold-start Recommendations [38.91330250981614]
  We present PromptRec, a simple but effective approach based on in-context learning of language models. We propose to enhance small language models for recommender systems with a data-centric pipeline. To the best of our knowledge, this is the first study to tackle the system cold-start recommendation problem.
  arXiv  Detail & Related papers  (2023-06-29T18:50:12Z)
• Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation [74.81561396321712]
  We propose a dual-intent enhanced graph neural network for session-based recommendations. We learn user intent from an attention mechanism and the distribution of historical data. By outputting new item probabilities, which contain recommendation scores of the corresponding items, the new items with higher scores are recommended to users.
  arXiv  Detail & Related papers  (2023-05-10T02:42:12Z)
• Sparsity Regularization For Cold-Start Recommendation [7.848143873095096]
  We introduce a novel representation for user-vectors by combining user demographics and user preferences. We develop a novel sparse adversarial model, SRLGAN, for Cold-Start Recommendation leveraging the sparse user-purchase behavior. We evaluate the SRLGAN on two popular datasets and demonstrate state-of-the-art results.
  arXiv  Detail & Related papers  (2022-01-26T02:28:08Z)
• A Multi-Strategy based Pre-Training Method for Cold-Start Recommendation [28.337475919795008]
  Cold-start problem is a fundamental challenge for recommendation tasks. Recent self-supervised learning (SSL) on Graph Neural Networks (GNNs) model, PT-GNN, pre-trains the GNN model to reconstruct the cold-start embeddings. We propose a multi-strategy based pre-training method for cold-start recommendation (MPT), which extends PT-GNN from the perspective of model architecture and pretext tasks.
  arXiv  Detail & Related papers  (2021-12-04T08:11:55Z)
• Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods [69.13371028670153]
  We introduce feature-contribution ratio (FCR) to study the viability of using inductive GNNs to solve the Strict Cold Start (SCS) problem. We experimentally show FCR disentangles the contributions of various components of graph datasets and demonstrate the superior performance of Cold Brew.
  arXiv  Detail & Related papers  (2021-11-08T21:29:25Z)
• Learning to Learn a Cold-start Sequential Recommender [70.5692886883067]
  The cold-start recommendation is an urgent problem in contemporary online applications. We propose a meta-learning based cold-start sequential recommendation framework called metaCSR. metaCSR holds the ability to learn the common patterns from regular users' behaviors.
  arXiv  Detail & Related papers  (2021-10-18T08:11:24Z)
• Privileged Graph Distillation for Cold Start Recommendation [57.918041397089254]
  The cold start problem in recommender systems requires recommending to new users (items) based on attributes without any historical interaction records. We propose a privileged graph distillation model(PGD) Our proposed model is generally applicable to different cold start scenarios with new user, new item, or new user-new item.
  arXiv  Detail & Related papers  (2021-05-31T14:05:27Z)
• Cold-start Sequential Recommendation via Meta Learner [10.491428090228768]
  We propose a Meta-learning-based Cold-Start Sequential Recommendation Framework, namely Mecos, to mitigate the item cold-start problem in sequential recommendation. Mecos effectively extracts user preference from limited interactions and learns to match the target cold-start item with the potential user.
  arXiv  Detail & Related papers  (2020-12-10T05:23:13Z)
• Joint Training Capsule Network for Cold Start Recommendation [64.35879555545749]
  This paper proposes a novel neural network, joint training capsule network (JTCN) for the cold start recommendation task. An attentive capsule layer is proposed to aggregate high-level user preference from the low-level interaction history. Experiments on two publicly available datasets demonstrate the effectiveness of the proposed model.
  arXiv  Detail & Related papers  (2020-05-23T04:27:38Z)

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.