Cold Item Integration in Deep Hybrid Recommenders via Tunable Stochastic Gates

• URL: http://arxiv.org/abs/2112.07615v1
• Date: Sun, 12 Dec 2021 11:37:24 GMT
• Title: Cold Item Integration in Deep Hybrid Recommenders via Tunable Stochastic Gates
• Authors: Oren Barkan, Roy Hirsch, Ori Katz, Avi Caciularu, Jonathan Weill, Noam Koenigstein
• Abstract summary: A major challenge in collaborative filtering methods is how to produce recommendations for cold items. We propose a novel hybrid recommendation algorithm that bridges these two conflicting objectives. We demonstrate the effectiveness of the proposed algorithm on movies, apps, and articles recommendations.
• Score: 19.69804455785047
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: A major challenge in collaborative filtering methods is how to produce recommendations for cold items (items with no ratings), or integrate cold item into an existing catalog. Over the years, a variety of hybrid recommendation models have been proposed to address this problem by utilizing items' metadata and content along with their ratings or usage patterns. In this work, we wish to revisit the cold start problem in order to draw attention to an overlooked challenge: the ability to integrate and balance between (regular) warm items and completely cold items. In this case, two different challenges arise: (1) preserving high quality performance on warm items, while (2) learning to promote cold items to relevant users. First, we show that these two objectives are in fact conflicting, and the balance between them depends on the business needs and the application at hand. Next, we propose a novel hybrid recommendation algorithm that bridges these two conflicting objectives and enables a harmonized balance between preserving high accuracy for warm items while effectively promoting completely cold items. We demonstrate the effectiveness of the proposed algorithm on movies, apps, and articles recommendations, and provide an empirical analysis of the cold-warm trade-off.

Related papers

• Next-User Retrieval: Enhancing Cold-Start Recommendations via Generative Next-User Modeling [3.847929624516339]
  Lookalike algorithms provide a promising solution by extending feedback for new items based on lookalike users.<n>We propose Next-User Retrieval, a novel framework for enhancing cold-start recommendations via generative next-user modeling.<n>Our method achieves significant improvements with increases of 0.0142% in daily active users and +0.1144% in publications in Douyin.
  arXiv  Detail & Related papers  (2025-06-18T08:42:01Z)
• FEASE: Shallow AutoEncoding Recommender with Cold Start Handling via Side Features [2.8680286413498903]
  User and item cold starts present significant challenges in industrial applications of recommendation systems. We introduce an augmented EASE model, i.e. FEASE, that seamlessly integrates both user and item side information. Our method strikes a balance by effectively recommending cold start items and handling cold start users without incurring extra bias.
  arXiv  Detail & Related papers  (2025-04-03T05:27:55Z)
• Prompt Tuning for Item Cold-start Recommendation [21.073232866618554]
  The item cold-start problem is crucial for online recommender systems, as the success of the cold-start phase determines whether items can transition into popular ones. Prompt learning, a powerful technique used in natural language processing (NLP) to address zero- or few-shot problems, has been adapted for recommender systems to tackle similar challenges. We propose to leverage high-value positive feedback, termed pinnacle feedback as prompt information, to simultaneously resolve the above two problems.
  arXiv  Detail & Related papers  (2024-12-24T01:38:19Z)
• Online Item Cold-Start Recommendation with Popularity-Aware Meta-Learning [14.83192161148111]
  We propose a model-agnostic recommendation algorithm called Popularity-Aware Meta-learning (PAM) to address the item cold-start problem. PAM divides incoming data into different meta-learning tasks by predefined item popularity thresholds. These task-fixing design significantly reduces additional computation and storage costs compared to offline methods.
  arXiv  Detail & Related papers  (2024-11-18T01:30:34Z)
• Language-Model Prior Overcomes Cold-Start Items [14.370472820496802]
  The growth ofRecSys is driven by digitization and the need for personalized content in areas such as e-commerce and video streaming. Existing solutions for the cold-start problem, such as content-based recommenders and hybrid methods, leverage item metadata to determine item similarities. This paper introduces a novel approach for cold-start item recommendation that utilizes the language model (LM) to estimate item similarities.
  arXiv  Detail & Related papers  (2024-11-13T22:45:52Z)
• Firzen: Firing Strict Cold-Start Items with Frozen Heterogeneous and Homogeneous Graphs for Recommendation [34.414081170244955]
  We propose a unified framework incorporating multi-modal content of items and knowledge graphs (KGs) to solve both strict cold-start and warm-start recommendation. Our model yields significant improvements for strict cold-start recommendation and outperforms or matches the state-of-the-art performance in the warm-start scenario.
  arXiv  Detail & Related papers  (2024-10-10T06:48:27Z)
• Beyond Two-Tower Matching: Learning Sparse Retrievable Cross-Interactions for Recommendation [80.19762472699814]
  Two-tower models are a prevalent matching framework for recommendation, which have been widely deployed in industrial applications. It suffers two main challenges, including limited feature interaction capability and reduced accuracy in online serving. We propose a new matching paradigm named SparCode, which supports not only sophisticated feature interactions but also efficient retrieval.
  arXiv  Detail & Related papers  (2023-11-30T03:13:36Z)
• Interactive Graph Convolutional Filtering [79.34979767405979]
  Interactive Recommender Systems (IRS) have been increasingly used in various domains, including personalized article recommendation, social media, and online advertising. These problems are exacerbated by the cold start problem and data sparsity problem. Existing Multi-Armed Bandit methods, despite their carefully designed exploration strategies, often struggle to provide satisfactory results in the early stages. Our proposed method extends interactive collaborative filtering into the graph model to enhance the performance of collaborative filtering between users and items.
  arXiv  Detail & Related papers  (2023-09-04T09:02:31Z)
• Item Cold Start Recommendation via Adversarial Variational Auto-encoder Warm-up [18.923299235862974]
  We propose an Adversarial Variational Auto-encoder Warm-up model (AVAEW) to generate warm-up item ID embedding for cold items. We demonstrate the effectiveness and compatibility of the proposed method by extensive offline experiments on public datasets and online A/B tests on a real-world news recommendation platform.
  arXiv  Detail & Related papers  (2023-02-28T08:23:15Z)
• 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)
• Set2setRank: Collaborative Set to Set Ranking for Implicit Feedback based Recommendation [59.183016033308014]
  In this paper, we explore the unique characteristics of the implicit feedback and propose Set2setRank framework for recommendation. Our proposed framework is model-agnostic and can be easily applied to most recommendation prediction approaches.
  arXiv  Detail & Related papers  (2021-05-16T08:06:22Z)
• Dual Side Deep Context-aware Modulation for Social Recommendation [50.59008227281762]
  We propose a novel graph neural network to model the social relation and collaborative relation. On top of high-order relations, a dual side deep context-aware modulation is introduced to capture the friends' information and item attraction.
  arXiv  Detail & Related papers  (2021-03-16T11:08:30Z)
• 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)
• Seamlessly Unifying Attributes and Items: Conversational Recommendation for Cold-Start Users [111.28351584726092]
  We consider the conversational recommendation for cold-start users, where a system can both ask the attributes from and recommend items to a user interactively. Our Conversational Thompson Sampling (ConTS) model holistically solves all questions in conversational recommendation by choosing the arm with the maximal reward to play.
  arXiv  Detail & Related papers  (2020-05-23T08:56:37Z)

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.