Zero Shot on the Cold-Start Problem: Model-Agnostic Interest Learning
for Recommender Systems
- URL: http://arxiv.org/abs/2108.13592v1
- Date: Tue, 31 Aug 2021 02:41:19 GMT
- Title: Zero Shot on the Cold-Start Problem: Model-Agnostic Interest Learning
for Recommender Systems
- Authors: Philip J. Feng, Pingjun Pan, Tingting Zhou, Hongxiang Chen, Chuanjiang
Luo
- Abstract summary: A two-tower framework, namely, the model-agnostic interest learning (MAIL) framework, is proposed to address the cold-start recommendation problem for recommender systems.
MAIL tackles the cold-start recommendation problem from a zero-shot view, and the other tower focuses on the general ranking task.
The proposed method has been successfully deployed on the live recommendation system of NetEase Cloud Music to achieve a click-through rate improvement of 13% to 15% for millions of users.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: User behavior has been validated to be effective in revealing personalized
preferences for commercial recommendations. However, few user-item interactions
can be collected for new users, which results in a null space for their
interests, i.e., the cold-start dilemma. In this paper, a two-tower framework,
namely, the model-agnostic interest learning (MAIL) framework, is proposed to
address the cold-start recommendation (CSR) problem for recommender systems. In
MAIL, one unique tower is constructed to tackle the CSR from a zero-shot view,
and the other tower focuses on the general ranking task. Specifically, the
zero-shot tower first performs cross-modal reconstruction with dual
auto-encoders to obtain virtual behavior data from highly aligned hidden
features for new users; and the ranking tower can then output recommendations
for users based on the completed data by the zero-shot tower. Practically, the
ranking tower in MAIL is model-agnostic and can be implemented with any
embedding-based deep models. Based on the co-training of the two towers, the
MAIL presents an end-to-end method for recommender systems that shows an
incremental performance improvement. The proposed method has been successfully
deployed on the live recommendation system of NetEase Cloud Music to achieve a
click-through rate improvement of 13% to 15% for millions of users. Offline
experiments on real-world datasets also show its superior performance in CSR.
Our code is available.
Related papers
- A Large Language Model Enhanced Sequential Recommender for Joint Video and Comment Recommendation [77.42486522565295]
We propose a novel recommendation approach called LSVCR to jointly conduct personalized video and comment recommendation.
Our approach consists of two key components, namely sequential recommendation (SR) model and supplemental large language model (LLM) recommender.
In particular, we achieve a significant overall gain of 4.13% in comment watch time.
arXiv Detail & Related papers (2024-03-20T13:14:29Z) - End-to-end Learnable Clustering for Intent Learning in Recommendation [54.157784572994316]
We propose a novel intent learning method termed underlineELCRec.
It unifies behavior representation learning into an underlineEnd-to-end underlineLearnable underlineClustering framework.
We deploy this method on the industrial recommendation system with 130 million page views and achieve promising results.
arXiv Detail & Related papers (2024-01-11T15:22:55Z) - Large Language Models are Zero-Shot Rankers for Recommender Systems [76.02500186203929]
This work aims to investigate the capacity of large language models (LLMs) to act as the ranking model for recommender systems.
We show that LLMs have promising zero-shot ranking abilities but struggle to perceive the order of historical interactions.
We demonstrate that these issues can be alleviated using specially designed prompting and bootstrapping strategies.
arXiv Detail & Related papers (2023-05-15T17:57:39Z) - 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) - 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) - Click-Through Rate Prediction Using Graph Neural Networks and Online
Learning [0.0]
A small percent improvement on the CTR prediction accuracy has been mentioned to add millions of dollars of revenue to the advertisement industry.
This project is interested in building a CTR predictor using Graph Neural Networks and an online learning algorithm.
arXiv Detail & Related papers (2021-05-09T01:35:49Z) - Self-Supervised Reinforcement Learning for Recommender Systems [77.38665506495553]
We propose self-supervised reinforcement learning for sequential recommendation tasks.
Our approach augments standard recommendation models with two output layers: one for self-supervised learning and the other for RL.
Based on such an approach, we propose two frameworks namely Self-Supervised Q-learning(SQN) and Self-Supervised Actor-Critic(SAC)
arXiv Detail & Related papers (2020-06-10T11:18:57Z) - Joint Training Capsule Network for Cold Start Recommendation [64.35879555545749]
This paper proposes a novel neural network, joint training capsule network (JTCN) for the cold start recommendation task.
An attentive capsule layer is proposed to aggregate high-level user preference from the low-level interaction history.
Experiments on two publicly available datasets demonstrate the effectiveness of the proposed model.
arXiv Detail & Related papers (2020-05-23T04:27:38Z)
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.