论文标题
每个人的偏好都会有所不同:加权多息检索模型
Everyone's Preference Changes Differently: Weighted Multi-Interest Retrieval Model
论文作者
论文摘要
用户嵌入(用户的矢量化表示)对于建议系统至关重要。已经提出了许多方法来为用户构建一种代表,以便找到用于检索任务的类似项目,并且已被证明在工业推荐系统中也有效。最近,人们发现使用多个嵌入式代表用户的力量,希望每个嵌入代表用户对某个主题的兴趣。通过多息表示,重要的是要对用户对不同主题的喜好进行建模以及偏好如何随时间变化。但是,现有方法要么无法估算用户对每种利息的亲和力,要么不合理地假设每个用户的每一个利息随时间而逐渐消失,从而损害了候选人检索的召回。在本文中,我们提出了多功能偏好模型(MIP)模型,这种方法不仅通过更有效地使用用户的顺序参与来为用户产生多种利益,而且还自动学习了一组权重以表示对每种嵌入的偏好,以便可以从每个兴趣中从每个兴趣中检索候选者。在各种工业规模的数据集上进行了广泛的实验,以证明我们方法的有效性。
User embeddings (vectorized representations of a user) are essential in recommendation systems. Numerous approaches have been proposed to construct a representation for the user in order to find similar items for retrieval tasks, and they have been proven effective in industrial recommendation systems as well. Recently people have discovered the power of using multiple embeddings to represent a user, with the hope that each embedding represents the user's interest in a certain topic. With multi-interest representation, it's important to model the user's preference over the different topics and how the preference change with time. However, existing approaches either fail to estimate the user's affinity to each interest or unreasonably assume every interest of every user fades with an equal rate with time, thus hurting the recall of candidate retrieval. In this paper, we propose the Multi-Interest Preference (MIP) model, an approach that not only produces multi-interest for users by using the user's sequential engagement more effectively but also automatically learns a set of weights to represent the preference over each embedding so that the candidates can be retrieved from each interest proportionally. Extensive experiments have been done on various industrial-scale datasets to demonstrate the effectiveness of our approach.