Learning from implicit user feedback is challenging as we can only observe positive samples but never access negative ones. Most conventional methods cope with this issue by adopting a pairwise ranking approach with negative sampling. However, the pairwise ranking approach has a severe disadvantage in the convergence time owing to the quadratically increasing computational cost with respect to the sample size; it is problematic, particularly for large-scale datasets and complex models such as neural networks. By contrast, a pointwise approach does not directly solve a ranking problem, and is therefore inferior to a pairwise counterpart in top-K ranking tasks; however, it is generally advantageous in regards to the convergence time. This study aims to establish an approach to learn personalised ranking from implicit feedback, which reconciles the training efficiency of the pointwise approach and ranking effectiveness of the pairwise counterpart. The key idea is to estimate the ranking of items in a pointwise manner; we first reformulate the conventional pointwise approach based on density ratio estimation and then incorporate the essence of ranking-oriented approaches (e.g. the pairwise approach) into our formulation. Through experiments on three real-world datasets, we demonstrate that our approach not only dramatically reduces the convergence time (one to two orders of magnitude faster) but also significantly improving the ranking performance.
翻译:从隐性用户反馈中学习,具有挑战性,因为我们只能观察正数样本,但从不访问负数样本。大多数常规方法都通过采用负数抽样的对等排序方法来应对这一问题。然而,由于对称排序方法在合并时间上严重不利,因为相对于抽样规模而言,计算成本的四进制增加;特别是对于大型数据集和神经网络等复杂模型而言,这是个问题。相比之下,从点到点方法不能直接解决排名问题,因此,在最高K级任务中比对对对方方法要低;但是,在趋同时间方面,这种方法一般比较有利。本研究的目的是建立一种方法,从隐含的反馈中学习个性化的排序,这种方法调和点方法的培训效率以及对对对等对应方的排序相调。关键的想法是,用点估计项目的排名;我们首先改革基于密度比率估计的传统点方法,然后将排序导向方法(例如对比方法)的精髓纳入我们的编制中。通过三个真实世界数据集的实验,我们证明我们的方法不仅大大缩短了时间排序的进度。