Next-User Retrieval: Enhancing Cold-Start Recommendations via Generative Next-User Modeling

• URL: http://arxiv.org/abs/2506.15267v1
• Date: Wed, 18 Jun 2025 08:42:01 GMT
• Title: Next-User Retrieval: Enhancing Cold-Start Recommendations via Generative Next-User Modeling
• Authors: Yu-Ting Lan, Yang Huo, Yi Shen, Xiao Yang, Zuotao Liu,
• Abstract summary: 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.
• Score: 3.847929624516339
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The item cold-start problem is critical for online recommendation systems, as the success of this phase determines whether high-quality new items can transition to popular ones, receive essential feedback to inspire creators, and thus lead to the long-term retention of creators. However, modern recommendation systems still struggle to address item cold-start challenges due to the heavy reliance on item and historical interactions, which are non-trivial for cold-start items lacking sufficient exposure and feedback. Lookalike algorithms provide a promising solution by extending feedback for new items based on lookalike users. Traditional lookalike algorithms face such limitations: (1) failing to effectively model the lookalike users and further improve recommendations with the existing rule- or model-based methods; and (2) struggling to utilize the interaction signals and incorporate diverse features in modern recommendation systems. Inspired by lookalike algorithms, we propose Next-User Retrieval, a novel framework for enhancing cold-start recommendations via generative next-user modeling. Specifically, we employ a transformer-based model to capture the unidirectional relationships among recently interacted users and utilize these sequences to generate the next potential user who is most likely to interact with the item. The additional item features are also integrated as prefix prompt embeddings to assist the next-user generation. The effectiveness of Next-User Retrieval is evaluated through both offline experiments and online A/B tests. Our method achieves significant improvements with increases of 0.0142% in daily active users and +0.1144% in publications in Douyin, showcasing its practical applicability and scalability.

Related papers

• Search-Based Interaction For Conversation Recommendation via Generative Reward Model Based Simulated User [117.82681846559909]
  Conversational recommendation systems (CRSs) use multi-turn interaction to capture user preferences and provide personalized recommendations.<n>We propose a generative reward model based simulated user, named GRSU, for automatic interaction with CRSs.
  arXiv  Detail & Related papers  (2025-04-29T06:37:30Z)
• Bake Two Cakes with One Oven: RL for Defusing Popularity Bias and Cold-start in Third-Party Library Recommendations [5.874782446136913]
  Third-party libraries (TPLs) have become an integral part of modern software development, enhancing developer productivity and accelerating time-to-market.<n>They typically rely on collaborative filtering (CF) that exploits a two-dimensional project-library matrix (user-item in general context of recommendation) when making recommendations.<n>We propose a reinforcement learning (RL)-based approach to address popularity bias and the cold-start problem in TPL recommendation.
  arXiv  Detail & Related papers  (2025-04-18T16:17:20Z)
• Interactive Visualization Recommendation with Hier-SUCB [52.11209329270573]
  We propose an interactive personalized visualization recommendation (PVisRec) system that learns on user feedback from previous interactions.<n>For more interactive and accurate recommendations, we propose Hier-SUCB, a contextual semi-bandit in the PVisRec setting.
  arXiv  Detail & Related papers  (2025-02-05T17:14:45Z)
• 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.<n> 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.<n>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)
• Latent User Intent Modeling for Sequential Recommenders [92.66888409973495]
  Sequential recommender models learn to predict the next items a user is likely to interact with based on his/her interaction history on the platform. Most sequential recommenders however lack a higher-level understanding of user intents, which often drive user behaviors online. Intent modeling is thus critical for understanding users and optimizing long-term user experience.
  arXiv  Detail & Related papers  (2022-11-17T19:00:24Z)
• FELRec: Efficient Handling of Item Cold-Start With Dynamic Representation Learning in Recommender Systems [0.0]
  We present FELRec, a large embedding network that refines the existing representations of users and items. In contrast to similar approaches, our model represents new users and items without side information and time-consuming finetuning. Our proposed model generalizes well to previously unseen datasets in zero-shot settings.
  arXiv  Detail & Related papers  (2022-10-30T19:08:38Z)
• A Dynamic Meta-Learning Model for Time-Sensitive Cold-Start Recommendations [24.815498451832347]
  We present a novel dynamic recommendation model that focuses on users who have interactions in the past but turn relatively inactive recently. Due to the sparse recent interactions, it is challenging to capture these users' current preferences precisely.
  arXiv  Detail & Related papers  (2022-04-03T02:04:12Z)
• Sparsity Regularization For Cold-Start Recommendation [7.848143873095096]
  We introduce a novel representation for user-vectors by combining user demographics and user preferences. We develop a novel sparse adversarial model, SRLGAN, for Cold-Start Recommendation leveraging the sparse user-purchase behavior. We evaluate the SRLGAN on two popular datasets and demonstrate state-of-the-art results.
  arXiv  Detail & Related papers  (2022-01-26T02:28:08Z)
• 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)
• 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)
• Controllable Multi-Interest Framework for Recommendation [64.30030600415654]
  We formalize the recommender system as a sequential recommendation problem. We propose a novel controllable multi-interest framework for the sequential recommendation, called ComiRec. Our framework has been successfully deployed on the offline Alibaba distributed cloud platform.
  arXiv  Detail & Related papers  (2020-05-19T10:18:43Z)

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.