Learning to Learn a Cold-start Sequential Recommender

• URL: http://arxiv.org/abs/2110.09083v1
• Date: Mon, 18 Oct 2021 08:11:24 GMT
• Title: Learning to Learn a Cold-start Sequential Recommender
• Authors: Xiaowen Huang, Jitao Sang, Jian Yu, Changsheng Xu
• Abstract summary: 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.
• Score: 70.5692886883067
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The cold-start recommendation is an urgent problem in contemporary online applications. It aims to provide users whose behaviors are literally sparse with as accurate recommendations as possible. Many data-driven algorithms, such as the widely used matrix factorization, underperform because of data sparseness. This work adopts the idea of meta-learning to solve the user's cold-start recommendation problem. We propose a meta-learning based cold-start sequential recommendation framework called metaCSR, including three main components: Diffusion Representer for learning better user/item embedding through information diffusion on the interaction graph; Sequential Recommender for capturing temporal dependencies of behavior sequences; Meta Learner for extracting and propagating transferable knowledge of prior users and learning a good initialization for new users. metaCSR holds the ability to learn the common patterns from regular users' behaviors and optimize the initialization so that the model can quickly adapt to new users after one or a few gradient updates to achieve optimal performance. The extensive quantitative experiments on three widely-used datasets show the remarkable performance of metaCSR in dealing with user cold-start problem. Meanwhile, a series of qualitative analysis demonstrates that the proposed metaCSR has good generalization.

Related papers

• ClusterSeq: Enhancing Sequential Recommender Systems with Clustering based Meta-Learning [3.168790535780547]
  ClusterSeq is a Meta-Learning Clustering-Based Sequential Recommender System. It exploits dynamic information in the user sequence to enhance item prediction accuracy, even in the absence of side information. Our proposed approach achieves a substantial improvement of 16-39% in Mean Reciprocal Rank (MRR)
  arXiv  Detail & Related papers  (2023-07-25T18:53:24Z)
• Meta-Learning with Adaptive Weighted Loss for Imbalanced Cold-Start Recommendation [4.379304291229695]
  We propose a novel sequential recommendation framework based on gradient-based meta-learning. Our work is the first to tackle the impact of imbalanced ratings in cold-start sequential recommendation scenarios.
  arXiv  Detail & Related papers  (2023-02-28T15:18:42Z)
• RESUS: Warm-Up Cold Users via Meta-Learning Residual User Preferences in CTR Prediction [14.807495564177252]
  Click-Through Rate (CTR) prediction on cold users is a challenging task in recommender systems. We propose a novel and efficient approach named RESUS, which decouples the learning of global preference knowledge contributed by collective users from the learning of residual preferences for individual users. Our approach is efficient and effective in improving CTR prediction accuracy on cold users, compared with various state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-10-28T11:57:58Z)
• Modeling Dynamic User Preference via Dictionary Learning for Sequential Recommendation [133.8758914874593]
  Capturing the dynamics in user preference is crucial to better predict user future behaviors because user preferences often drift over time. Many existing recommendation algorithms -- including both shallow and deep ones -- often model such dynamics independently. This paper considers the problem of embedding a user's sequential behavior into the latent space of user preferences.
  arXiv  Detail & Related papers  (2022-04-02T03:23:46Z)
• Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations [92.47380209981348]
  We propose a Diverse Preference Augmentation framework with multiple source domains based on meta-learning. We generate diverse ratings in a new domain of interest to handle overfitting on the case of sparse interactions. These ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability.
  arXiv  Detail & Related papers  (2022-04-01T10:10:50Z)
• 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)
• Reinforcement Learning based Path Exploration for Sequential Explainable Recommendation [57.67616822888859]
  We propose a novel Temporal Meta-path Guided Explainable Recommendation leveraging Reinforcement Learning (TMER-RL) TMER-RL utilizes reinforcement item-item path modelling between consecutive items with attention mechanisms to sequentially model dynamic user-item evolutions on dynamic knowledge graph for explainable recommendation. Extensive evaluations of TMER on two real-world datasets show state-of-the-art performance compared against recent strong baselines.
  arXiv  Detail & Related papers  (2021-11-24T04:34:26Z)
• Hyper Meta-Path Contrastive Learning for Multi-Behavior Recommendation [61.114580368455236]
  User purchasing prediction with multi-behavior information remains a challenging problem for current recommendation systems. We propose the concept of hyper meta-path to construct hyper meta-paths or hyper meta-graphs to explicitly illustrate the dependencies among different behaviors of a user. Thanks to the recent success of graph contrastive learning, we leverage it to learn embeddings of user behavior patterns adaptively instead of assigning a fixed scheme to understand the dependencies among different behaviors.
  arXiv  Detail & Related papers  (2021-09-07T04:28:09Z)
• 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)
• S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximization [104.87483578308526]
  We propose the model S3-Rec, which stands for Self-Supervised learning for Sequential Recommendation. For our task, we devise four auxiliary self-supervised objectives to learn the correlations among attribute, item, subsequence, and sequence. Extensive experiments conducted on six real-world datasets demonstrate the superiority of our proposed method over existing state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-08-18T11:44:10Z)

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.