Is Meta-Learning the Right Approach for the Cold-Start Problem in Recommender Systems?

• URL: http://arxiv.org/abs/2308.08354v1
• Date: Wed, 16 Aug 2023 13:24:47 GMT
• Title: Is Meta-Learning the Right Approach for the Cold-Start Problem in Recommender Systems?
• Authors: Davide Buffelli, Ashish Gupta, Agnieszka Strzalka, Vassilis Plachouras
• Abstract summary: We show that it is possible to obtain similar, or higher, performance on commonly used benchmarks for the cold-start problem without using meta-learning techniques. We further show that an extremely simple modular approach using common representation learning techniques, can perform comparably to meta-learning techniques specifically designed for the cold-start setting.
• Score: 5.804718528857615
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recommender systems have become fundamental building blocks of modern online products and services, and have a substantial impact on user experience. In the past few years, deep learning methods have attracted a lot of research, and are now heavily used in modern real-world recommender systems. Nevertheless, dealing with recommendations in the cold-start setting, e.g., when a user has done limited interactions in the system, is a problem that remains far from solved. Meta-learning techniques, and in particular optimization-based meta-learning, have recently become the most popular approaches in the academic research literature for tackling the cold-start problem in deep learning models for recommender systems. However, current meta-learning approaches are not practical for real-world recommender systems, which have billions of users and items, and strict latency requirements. In this paper we show that it is possible to obtaining similar, or higher, performance on commonly used benchmarks for the cold-start problem without using meta-learning techniques. In more detail, we show that, when tuned correctly, standard and widely adopted deep learning models perform just as well as newer meta-learning models. We further show that an extremely simple modular approach using common representation learning techniques, can perform comparably to meta-learning techniques specifically designed for the cold-start setting while being much more easily deployable in real-world applications.

Related papers

• Are Large Language Models Really Effective for Training-Free Cold-Start Recommendation? [3.446483216812751]
  This study focuses on training-free recommendation, where no task-specific training is performed.<n>Large language models (LLMs) have recently been explored as a promising solution, and numerous studies have been proposed.<n>We present the first controlled experiments that systematically evaluate these two approaches in the same setting.
  arXiv  Detail & Related papers  (2025-12-15T05:47:07Z)
• Towards a Real-World Aligned Benchmark for Unlearning in Recommender Systems [49.766845975588275]
  We propose a set of design desiderata and research questions to guide the development of a more realistic benchmark for unlearning in recommender systems.<n>We argue for an unlearning setup that reflects the sequential, time-sensitive nature of real-world deletion requests.<n>We present a preliminary experiment in a next-basket recommendation setting based on our proposed desiderata and find that unlearning also works for sequential recommendation models.
  arXiv  Detail & Related papers  (2025-08-23T16:05:40Z)
• Continual Recommender Systems [47.467562063027195]
  Current tutorials on machine learning do not address recommendation-specific demands.<n>We begin by reviewing the background and problem settings, followed by a comprehensive overview of existing approaches.<n>We then highlight recent efforts to apply continual learning to practical deployment environments.
  arXiv  Detail & Related papers  (2025-07-05T02:20:15Z)
• In-Context Learning for Gradient-Free Receiver Adaptation: Principles, Applications, and Theory [54.92893355284945]
  Deep learning-based wireless receivers offer the potential to dynamically adapt to varying channel environments.<n>Current adaptation strategies, including joint training, hypernetwork-based methods, and meta-learning, either demonstrate limited flexibility or necessitate explicit optimization through gradient descent.<n>This paper presents gradient-free adaptation techniques rooted in the emerging paradigm of in-context learning (ICL)
  arXiv  Detail & Related papers  (2025-06-18T06:43:55Z)
• Learn while Unlearn: An Iterative Unlearning Framework for Generative Language Models [49.043599241803825]
  Iterative Contrastive Unlearning (ICU) framework consists of three core components. A Knowledge Unlearning Induction module removes specific knowledge through an unlearning loss. A Contrastive Learning Enhancement module to preserve the model's expressive capabilities against the pure unlearning goal. And an Iterative Unlearning Refinement module that dynamically assess the unlearning extent on specific data pieces and make iterative update.
  arXiv  Detail & Related papers  (2024-07-25T07:09:35Z)
• Can Learned Optimization Make Reinforcement Learning Less Difficult? [70.5036361852812]
  We consider whether learned optimization can help overcome reinforcement learning difficulties. Our method, Learned Optimization for Plasticity, Exploration and Non-stationarity (OPEN), meta-learns an update rule whose input features and output structure are informed by previously proposed to these difficulties.
  arXiv  Detail & Related papers  (2024-07-09T17:55:23Z)
• 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)
• Recommender Systems in the Era of Large Language Models (LLMs) [62.0129013439038]
  Large Language Models (LLMs) have revolutionized the fields of Natural Language Processing (NLP) and Artificial Intelligence (AI) We conduct a comprehensive review of LLM-empowered recommender systems from various aspects including Pre-training, Fine-tuning, and Prompting.
  arXiv  Detail & Related papers  (2023-07-05T06:03:40Z)
• 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)
• 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)
• Comprehensive Fair Meta-learned Recommender System [39.04926584648665]
  We propose a comprehensive fair meta-learning framework, named CLOVER, for ensuring the fairness of meta-learned recommendation models. Our framework offers a generic training paradigm that is applicable to different meta-learned recommender systems.
  arXiv  Detail & Related papers  (2022-06-09T22:48:35Z)
• 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)
• Model-Based Deep Learning [155.063817656602]
  Signal processing, communications, and control have traditionally relied on classical statistical modeling techniques. Deep neural networks (DNNs) use generic architectures which learn to operate from data, and demonstrate excellent performance. We are interested in hybrid techniques that combine principled mathematical models with data-driven systems to benefit from the advantages of both approaches.
  arXiv  Detail & Related papers  (2020-12-15T16:29:49Z)
• Revisiting Meta-Learning as Supervised Learning [69.2067288158133]
  We aim to provide a principled, unifying framework by revisiting and strengthening the connection between meta-learning and traditional supervised learning. By treating pairs of task-specific data sets and target models as (feature, label) samples, we can reduce many meta-learning algorithms to instances of supervised learning. This view not only unifies meta-learning into an intuitive and practical framework but also allows us to transfer insights from supervised learning directly to improve meta-learning.
  arXiv  Detail & Related papers  (2020-02-03T06:13:01Z)

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.