arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.14532cs.IR
收藏

重新思考推荐系统中用于候选匹配的多兴趣学习

Rethinking Multi-Interest Learning for Candidate Matching in Recommender Systems

Yueqi Xie, Jingqi Gao, Peilin Zhou, Qichen Ye, Yining Hua, Jaeboum Kim, Fangzhao Wu, Sunghun Kim

AI总结:

本文针对多兴趣候选匹配训练方案中的简单负样本过多和路由坍缩问题,提出REMI框架,通过兴趣感知困难负样本挖掘策略和路由正则化方法显著提升了多兴趣表示的表达能力。

摘要:

推荐系统中针对多兴趣候选匹配的现有研究主要集中在改进模型架构或引入额外信息,而忽略了训练方案的重要性。本文重新审视了训练框架,并发现了两个阻碍所学多兴趣表示表达能力的主要问题。首先,当前的训练目标(即均匀采样softmax)由于简单负样本的急剧增加,无法在多兴趣学习场景中有效训练出具有区分度的表示。其次,观察到了路由坍缩问题,即每个学习到的兴趣可能会坍缩为仅表达来自单个物品的信息,从而导致信息丢失。为了解决这些问题,我们提出了REMI框架,包含兴趣感知困难负样本挖掘策略(IHN)和路由正则化(RR)方法。IHN通过提出一种理想的采样分布并开发蒙特卡洛策略进行高效近似,从而强调兴趣感知的困难负样本。RR通过对物品到兴趣的路由矩阵引入新颖的正则化项来防止路由坍缩。这两个组件从优化目标和组合信息两方面增强了所学到的多兴趣表示。REMI是一个通用框架,可以轻松应用于各种现有的多兴趣候选匹配方法。在三个真实世界数据集上的实验表明,我们的方法能够显著改善最先进的方法,且实现简单,计算开销可忽略不计。源代码将会发布。

英文摘要:

Existing research efforts for multi-interest candidate matching in recommender systems mainly focus on improving model architecture or incorporating additional information, neglecting the importance of training schemes. This work revisits the training framework and uncovers two major problems hindering the expressiveness of learned multi-interest representations. First, the current training objective (i.e., uniformly sampled softmax) fails to effectively train discriminative representations in a multi-interest learning scenario due to the severe increase in easy negative samples. Second, a routing collapse problem is observed where each learned interest may collapse to express information only from a single item, resulting in information loss. To address these issues, we propose the REMI framework, consisting of an Interest-aware Hard Negative mining strategy (IHN) and a Routing Regularization (RR) method. IHN emphasizes interest-aware hard negatives by proposing an ideal sampling distribution and developing a Monte-Carlo strategy for efficient approximation. RR prevents routing collapse by introducing a novel regularization term on the item-to-interest routing matrices. These two components enhance the learned multi-interest representations from both the optimization objective and the composition information. REMI is a general framework that can be readily applied to various existing multi-interest candidate matching methods. Experiments on three real-world datasets show our method can significantly improve state-of-the-art methods with easy implementation and negligible computational overhead. The source code will be released.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑