arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.07203cs.IRcs.LGstat.ML
收藏

Deep Retrieval:学习一种可检索的大规模推荐结构

Deep Retrieval: Learning A Retrievable Structure for Large-Scale Recommendations

ByteDance Inc.(字节跳动有限公司)

Weihao Gao, Xiangjun Fan, Chong Wang, Jiankai Sun, Kai Jia, Wenzhi Xiao, Ruofan Ding, Xingyan Bin, Hui Yang, Xiaobing Liu

摘要:

大规模推荐中的核心问题之一是准确有效地检索最相关的候选人,最好是在亚线性时间内。以前的方法大多基于两步过程:首先学习内积模型,然后使用近似最近邻(ANN)搜索算法来找到最佳候选人。在本文中,我们提出了深度检索(DR),直接使用用户-项目交互数据(例如点击)来学习可检索的结构,而无需在ANN算法中采用欧几里德空间假设。DR的结构将所有候选项编码到离散的潜在空间中。候选者的那些潜在代码是模型参数,并且与其他神经网络参数一起学习以最大化相同的目标函数。随着模型的学习,在结构上执行束搜索以检索用于重新排序的最佳候选。从经验上讲,我们首先证明了DR,具有次线性计算复杂性,可以达到几乎相同的精度作为两个公共数据集上的蛮力基线。此外,我们表明,在现场生产推荐系统中,部署的DR方法在参与指标方面显着优于精心调整的ANN基线。据我们所知,DR是第一个成功部署在工业推荐系统中数亿项规模的非ANN算法之一。

英文摘要:

One of the core problems in large-scale recommendations is to retrieve top relevant candidates accurately and efficiently, preferably in sub-linear time. Previous approaches are mostly based on a two-step procedure: first learn an inner-product model, and then use some approximate nearest neighbor (ANN) search algorithm to find top candidates. In this paper, we present Deep Retrieval (DR), to learn a retrievable structure directly with user-item interaction data (e.g. clicks) without resorting to the Euclidean space assumption in ANN algorithms. DR's structure encodes all candidate items into a discrete latent space. Those latent codes for the candidates are model parameters and learnt together with other neural network parameters to maximize the same objective function. With the model learnt, a beam search over the structure is performed to retrieve the top candidates for reranking. Empirically, we first demonstrate that DR, with sub-linear computational complexity, can achieve almost the same accuracy as the brute-force baseline on two public datasets. Moreover, we show that, in a live production recommendation system, a deployed DR approach significantly outperforms a well-tuned ANN baseline in terms of engagement metrics. To the best of our knowledge, DR is among the first non-ANN algorithms successfully deployed at the scale of hundreds of millions of items for industrial recommendation systems.

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

↑