FELRec: Efficient Handling of Item Cold-Start With Dynamic Representation Learning in Recommender Systems

October 30, 2022 ยท Entered Twilight ยท ๐Ÿ› International Journal of Data Science and Analysis

๐Ÿ’ค TWILIGHT: Eternal Rest
Repo abandoned since publication

Repo contents: .gitignore, LICENSE, README.md, logging.ini, reclib, requirements.txt, trainer

Authors Kuba Weimann, Tim O. F. Conrad arXiv ID 2210.16928 Category cs.IR: Information Retrieval Cross-listed cs.LG Citations 0 Venue International Journal of Data Science and Analysis Repository https://github.com/kweimann/FELRec โญ 5 Last Checked 3 months ago
Abstract
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 .
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Retrieval