Felrec: Efficient Handling Of Item Cold-start With Dynamic Representation Learning In Recommender Systems | Awesome Learning to Hash Add your paper to Learning2Hash

Felrec: Efficient Handling Of Item Cold-start With Dynamic Representation Learning In Recommender Systems

Kuba Weimann, Tim O. F. Conrad . Arxiv 2022 – 0 citations

[Code] [Paper]   Search on Google Scholar   Search on Semantic Scholar
Datasets Few Shot & Zero Shot Recommender Systems

Recommender systems suffer from the cold-start problem whenever a new user joins the platform or a new item is added to the catalog. To address item cold-start, we propose to replace the embedding layer in sequential recommenders with a dynamic storage that has no learnable weights and can keep an arbitrary number of representations. In this paper, we present FELRec, a large embedding network that refines the existing representations of users and items in a recursive manner, as new information becomes available. In contrast to similar approaches, our model represents new users and items without side information and time-consuming finetuning, instead it runs a single forward pass over a sequence of existing representations. During item cold-start, our method outperforms similar method by 29.50%-47.45%. Further, our proposed model generalizes well to previously unseen datasets in zero-shot settings. The source code is publicly available at https://github.com/kweimann/FELRec .

Similar Work