about
Learning Category Trees for ID-Based Recommendation: Differentiable VQ (arxiv.org)
4 points by RicoElectrico on Oct 14, 2024 | hide | past | pdf | discuss on HN

In plain words: When item categories are missing, this approach builds its own category trees for users and items by learning category codes and entity profiles together from scratch. Adding these trees improved recommendation accuracy across three tasks and several recommenders compared with using those recommenders alone.

Abstract · Learning Category Trees for ID-Based Recommendation: Exploring the Power of Differentiable Vector Quantization

Category information plays a crucial role in enhancing the quality and personalization of recommender systems. Nevertheless, the availability of item category information is not consistently present, particularly in the context of ID-based recommendations. In this work, we propose a novel approach to automatically learn and generate entity (i.e., user or item) category trees for ID-based recommendation. Specifically, we devise a differentiable vector quantization framework for automatic category tree generation, namely CAGE, which enables the simultaneous learning and refinement of categorical code representations and entity embeddings in an end-to-end manner, starting from the randomly initialized states. With its high adaptability, CAGE can be easily integrated into both sequential and non-sequential recommender systems. We validate the effectiveness of CAGE on various recommendation tasks including list completion, collaborative filtering, and click-through rate prediction, across different recommendation models. We release the code and data for others to reproduce the reported results.

Qijiong Liu, Lu Fan, Jiaren Xiao, Jieming Zhu, Xiao-Ming Wu
arXiv:2308.16761 · cs.IR · submitted Aug 31, 2023 · updated Mar 15, 2024
abstract · pdf · html · TheWebConf'24 accepted paper

add comment on HN