Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations

• URL: http://arxiv.org/abs/2204.00327v1
• Date: Fri, 1 Apr 2022 10:10:50 GMT
• Title: Diverse Preference Augmentation with Multiple Domains for Cold-start Recommendations
• Authors: Yan Zhang, Changyu Li, Ivor W. Tsang, Hui Xu, Lixin Duan, Hongzhi Yin, Wen Li, Jie Shao
• Abstract summary: 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.
• Score: 92.47380209981348
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cold-start issues have been more and more challenging for providing accurate recommendations with the fast increase of users and items. Most existing approaches attempt to solve the intractable problems via content-aware recommendations based on auxiliary information and/or cross-domain recommendations with transfer learning. Their performances are often constrained by the extremely sparse user-item interactions, unavailable side information, or very limited domain-shared users. Recently, meta-learners with meta-augmentation by adding noises to labels have been proven to be effective to avoid overfitting and shown good performance on new tasks. Motivated by the idea of meta-augmentation, in this paper, by treating a user's preference over items as a task, we propose a so-called Diverse Preference Augmentation framework with multiple source domains based on meta-learning (referred to as MetaDPA) to i) generate diverse ratings in a new domain of interest (known as target domain) to handle overfitting on the case of sparse interactions, and to ii) learn a preference model in the target domain via a meta-learning scheme to alleviate cold-start issues. Specifically, we first conduct multi-source domain adaptation by dual conditional variational autoencoders and impose a Multi-domain InfoMax (MDI) constraint on the latent representations to learn domain-shared and domain-specific preference properties. To avoid overfitting, we add a Mutually-Exclusive (ME) constraint on the output of decoders to generate diverse ratings given content data. Finally, these generated diverse ratings and the original ratings are introduced into the meta-training procedure to learn a preference meta-learner, which produces good generalization ability on cold-start recommendation tasks. Experiments on real-world datasets show our proposed MetaDPA clearly outperforms the current state-of-the-art baselines.

Related papers

• Transferable Sequential Recommendation via Vector Quantized Meta Learning [29.49708205199897]
  We propose a vector quantized meta learning for transferable sequential recommenders (MetaRec) Our approach leverages user-item interactions from multiple source domains to improve the target domain performance. To validate the effectiveness of our approach, we perform extensive experiments on benchmark datasets.
  arXiv  Detail & Related papers  (2024-11-04T04:16:11Z)
• MDAP: A Multi-view Disentangled and Adaptive Preference Learning Framework for Cross-Domain Recommendation [63.27390451208503]
  Cross-domain Recommendation systems leverage multi-domain user interactions to improve performance. We propose the Multi-view Disentangled and Adaptive Preference Learning framework. Our framework uses a multiview encoder to capture diverse user preferences.
  arXiv  Detail & Related papers  (2024-10-08T10:06:45Z)
• MIMNet: Multi-Interest Meta Network with Multi-Granularity Target-Guided Attention for Cross-domain Recommendation [6.7902741961967]
  Cross-domain recommendation (CDR) plays a critical role in alleviating the sparsity and cold-start problem. We propose a novel method named Multi-interest Meta Network with Multi-granularity Target-guided Attention (MIMNet) for cross-domain recommendation.
  arXiv  Detail & Related papers  (2024-07-31T13:30:34Z)
• Cross-domain Transfer of Valence Preferences via a Meta-optimization Approach [17.545983294377958]
  CVPM formalizes cross-domain interest transfer as a hybrid architecture of meta-learning and self-supervised learning. With deep insights into user preferences, we employ differentiated encoders to learn their distributions. In particular, we treat each user's mapping as two parts, the common transformation and the personalized bias, where the network used to generate the personalized bias is output by a meta-learner.
  arXiv  Detail & Related papers  (2024-06-24T10:02:24Z)
• Exploring User Retrieval Integration towards Large Language Models for Cross-Domain Sequential Recommendation [66.72195610471624]
  Cross-Domain Sequential Recommendation aims to mine and transfer users' sequential preferences across different domains. We propose a novel framework named URLLM, which aims to improve the CDSR performance by exploring the User Retrieval approach.
  arXiv  Detail & Related papers  (2024-06-05T09:19:54Z)
• Transfer of codebook latent factors for cross-domain recommendation with non-overlapping data [5.145146101802871]
  Data Sparsity is one of the major drawbacks with collaborative filtering technique. In this paper, we come up with a novel transfer learning approach for cross-domain recommendation.
  arXiv  Detail & Related papers  (2022-03-26T05:26:39Z)
• A cross-domain recommender system using deep coupled autoencoders [77.86290991564829]
  Two novel coupled autoencoder-based deep learning methods are proposed for cross-domain recommendation. The first method aims to simultaneously learn a pair of autoencoders in order to reveal the intrinsic representations of the items in the source and target domains. The second method is derived based on a new joint regularized optimization problem, which employs two autoencoders to generate in a deep and non-linear manner the user and item-latent factors.
  arXiv  Detail & Related papers  (2021-12-08T15:14:26Z)
• Cross-domain User Preference Learning for Cold-start Recommendation [32.83868293457142]
  Cross-domain cold-start recommendation is an increasingly emerging issue for recommender systems. It is critical to learn a user's preference from the source domain and transfer it into the target domain. We propose a self-trained Cross-dOmain User Preference LEarning framework, targeting cold-start recommendation with various semantic tags.
  arXiv  Detail & Related papers  (2021-12-07T12:57:05Z)
• 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)
• CATN: Cross-Domain Recommendation for Cold-Start Users via Aspect Transfer Network [49.35977893592626]
  We propose a cross-domain recommendation framework via aspect transfer network for cold-start users (named CATN) CATN is devised to extract multiple aspects for each user and each item from their review documents, and learn aspect correlations across domains with an attention mechanism. On real-world datasets, the proposed CATN outperforms SOTA models significantly in terms of rating prediction accuracy.
  arXiv  Detail & Related papers  (2020-05-21T10:05:19Z)

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.