Pacer and Runner: Cooperative Learning Framework between Single- and Cross-Domain Sequential Recommendation

• URL: http://arxiv.org/abs/2407.11245v2
• Date: Wed, 24 Jul 2024 11:54:26 GMT
• Title: Pacer and Runner: Cooperative Learning Framework between Single- and Cross-Domain Sequential Recommendation
• Authors: Chung Park, Taesan Kim, Hyungjun Yoon, Junui Hong, Yelim Yu, Mincheol Cho, Minsung Choi, Jaegul Choo,
• Abstract summary: Cross-Domain Sequential Recommendation (CDSR) improves recommendation performance by utilizing information from multiple domains. However, CDSR may underperform compared to Single-Domain Sequential Recommendation (SDSR) in certain domains due to negative transfer. We propose a proposed CDSR model that estimates the degree of negative transfer of each domain and adaptively assigns it as a weight factor to the prediction loss.
• Score: 25.228420612022788
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cross-Domain Sequential Recommendation (CDSR) improves recommendation performance by utilizing information from multiple domains, which contrasts with Single-Domain Sequential Recommendation (SDSR) that relies on a historical interaction within a specific domain. However, CDSR may underperform compared to the SDSR approach in certain domains due to negative transfer, which occurs when there is a lack of relation between domains or different levels of data sparsity. To address the issue of negative transfer, our proposed CDSR model estimates the degree of negative transfer of each domain and adaptively assigns it as a weight factor to the prediction loss, to control gradient flows through domains with significant negative transfer. To this end, our model compares the performance of a model trained on multiple domains (CDSR) with a model trained solely on the specific domain (SDSR) to evaluate the negative transfer of each domain using our asymmetric cooperative network. In addition, to facilitate the transfer of valuable cues between the SDSR and CDSR tasks, we developed an auxiliary loss that maximizes the mutual information between the representation pairs from both tasks on a per-domain basis. This cooperative learning between SDSR and CDSR tasks is similar to the collaborative dynamics between pacers and runners in a marathon. Our model outperformed numerous previous works in extensive experiments on two real-world industrial datasets across ten service domains. We also have deployed our model in the recommendation system of our personal assistant app service, resulting in 21.4% increase in click-through rate compared to existing models, which is valuable to real-world business.

Related papers

• Graph Signal Processing for Cross-Domain Recommendation [37.87497277046321]
  Cross-domain recommendation (CDR) extends conventional recommender systems by leveraging user-item interactions from dense domains to mitigate data sparsity and the cold start problem. Most existing CDR methods suffer from sensitivity to the ratio of overlapping users and intrinsic discrepancy between source and target domains. We propose CGSP, a unified CDR framework based on GSP, which employs a cross-domain similarity graph constructed by flexibly combining target-only similarity and source-bridged similarity.
  arXiv  Detail & Related papers  (2024-07-17T07:52:45Z)
• Towards Full-scene Domain Generalization in Multi-agent Collaborative Bird's Eye View Segmentation for Connected and Autonomous Driving [54.60458503590669]
  We propose a unified domain generalization framework applicable in both training and inference stages of collaborative perception. We employ an Amplitude Augmentation (AmpAug) method to augment low-frequency image variations, broadening the model's ability to learn. In the inference phase, we introduce an intra-system domain alignment mechanism to reduce or potentially eliminate the domain discrepancy.
  arXiv  Detail & Related papers  (2023-11-28T12:52:49Z)
• Cracking the Code of Negative Transfer: A Cooperative Game Theoretic Approach for Cross-Domain Sequential Recommendation [23.531113546036856]
  Cross-Domain Sequential Recommendation (CDSR) is a promising method that uses information from multiple domains to generate accurate and diverse recommendations. We propose a new CDSR framework that addresses the problem of negative transfer by assessing the extent of negative transfer from one domain to another. We show that our model is superior to prior works in terms of model performance on two real-world datasets across ten different domains.
  arXiv  Detail & Related papers  (2023-11-22T06:30:54Z)
• Towards Open-world Cross-Domain Sequential Recommendation: A Model-Agnostic Contrastive Denoising Approach [16.09514981871128]
  Cross-domain sequential recommendation (CDSR) aims to address the data sparsity problems that exist in traditional sequential recommendation (SR) systems. In real-world recommender systems, CDSR scenarios usually consist of a majority of long-tailed users with sparse behaviors and cold-start users who only exist in one domain.
  arXiv  Detail & Related papers  (2023-11-08T15:33:06Z)
• DDGHM: Dual Dynamic Graph with Hybrid Metric Training for Cross-Domain Sequential Recommendation [15.366783212837515]
  Sequential Recommendation (SR) characterizes evolving patterns of user behaviors by modeling how users transit among items. To solve this problem, we focus on Cross-Domain Sequential Recommendation (CDSR) We propose DDGHM, a novel framework for the CDSR problem, which includes two main modules, dual dynamic graph modeling and hybrid metric training.
  arXiv  Detail & Related papers  (2022-09-21T07:53:06Z)
• MemSAC: Memory Augmented Sample Consistency for Large Scale Unsupervised Domain Adaptation [71.4942277262067]
  We propose MemSAC, which exploits sample level similarity across source and target domains to achieve discriminative transfer. We provide in-depth analysis and insights into the effectiveness of MemSAC.
  arXiv  Detail & Related papers  (2022-07-25T17:55:28Z)
• Dual Attentive Sequential Learning for Cross-Domain Click-Through Rate Prediction [76.98616102965023]
  Cross domain recommender system constitutes a powerful method to tackle the cold-start and sparsity problem. We propose a novel approach to cross-domain sequential recommendations based on the dual learning mechanism.
  arXiv  Detail & Related papers  (2021-06-05T01:21:21Z)
• Dual Metric Learning for Effective and Efficient Cross-Domain Recommendations [85.6250759280292]
  Cross domain recommender systems have been increasingly valuable for helping consumers identify useful items in different applications. Existing cross-domain models typically require large number of overlap users, which can be difficult to obtain in some applications. We propose a novel cross-domain recommendation model based on dual learning that transfers information between two related domains in an iterative manner.
  arXiv  Detail & Related papers  (2021-04-17T09:18:59Z)
• Conditional Coupled Generative Adversarial Networks for Zero-Shot Domain Adaptation [31.334196673143257]
  Machine learning models trained in one domain perform poorly in the other domains due to the existence of domain shift. We propose conditional coupled generative adversarial networks (CoCoGAN) by extending the coupled generative adversarial networks (CoGAN) into a conditioning model. Our proposed CoCoGAN is able to capture the joint distribution of dual-domain samples in two different tasks, i.e. the relevant task (RT) and an irrelevant task (IRT)
  arXiv  Detail & Related papers  (2020-09-11T04:36:42Z)
• Adaptively-Accumulated Knowledge Transfer for Partial Domain Adaptation [66.74638960925854]
  Partial domain adaptation (PDA) deals with a realistic and challenging problem when the source domain label space substitutes the target domain. We propose an Adaptively-Accumulated Knowledge Transfer framework (A$2$KT) to align the relevant categories across two domains.
  arXiv  Detail & Related papers  (2020-08-27T00:53:43Z)
• Multi-Source Domain Adaptation for Text Classification via DistanceNet-Bandits [101.68525259222164]
  We present a study of various distance-based measures in the context of NLP tasks, that characterize the dissimilarity between domains based on sample estimates. We develop a DistanceNet model which uses these distance measures as an additional loss function to be minimized jointly with the task's loss function. We extend this model to a novel DistanceNet-Bandit model, which employs a multi-armed bandit controller to dynamically switch between multiple source domains.
  arXiv  Detail & Related papers  (2020-01-13T15:53:41Z)

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.