arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.13459cs.IRcs.DScs.LG
收藏

基于邻近图的最大内积搜索的理解与改进

Understanding and Improving Proximity Graph based Maximum Inner Product Search

The Chinese University of Hong Kong(香港中文大学)

Jie Liu, Xiao Yan, Xinyan Dai, Zhirong Li, James Cheng, Ming-Chang Yang

摘要:

内积可导航小世界图(ip-NSW)代表了最先进的近似最大内积搜索(MIPS)方法,它可以在最快的基线上实现一个数量级的加速。然而,迄今为止,仍不清楚其卓越的性能来自何处。在本文中,我们表明,有一个强大的范数偏置的MIPS问题,这意味着大范数项目很可能成为MIPS的结果。然后,我们解释了ip-NSW的良好性能匹配的标准偏差的MIPS问题-大的范数项目有很大的在ip-NSW接近图的度和图上的行走花费大部分的计算在这些项目上,从而有效地避免了不必要的计算小范数项目。此外,我们提出了ip-NSW+算法,它通过引入一个额外的角邻近图来改进ip-NSW。首先在角度图上搜索查询的角度邻居,然后利用这些角度邻居的MIPS邻居初始化候选池,在内积邻近图上进行搜索.实验结果表明,ip-NSW+在不同数据分布下的性能均显著优于ip-NSW,并具有更好的鲁棒性。

英文摘要:

The inner-product navigable small world graph (ip-NSW) represents the state-of-the-art method for approximate maximum inner product search (MIPS) and it can achieve an order of magnitude speedup over the fastest baseline. However, to date it is still unclear where its exceptional performance comes from. In this paper, we show that there is a strong norm bias in the MIPS problem, which means that the large norm items are very likely to become the result of MIPS. Then we explain the good performance of ip-NSW as matching the norm bias of the MIPS problem - large norm items have big in-degrees in the ip-NSW proximity graph and a walk on the graph spends the majority of computation on these items, thus effectively avoids unnecessary computation on small norm items. Furthermore, we propose the ip-NSW+ algorithm, which improves ip-NSW by introducing an additional angular proximity graph. Search is first conducted on the angular graph to find the angular neighbors of a query and then the MIPS neighbors of these angular neighbors are used to initialize the candidate pool for search on the inner-product proximity graph. Experiment results show that ip-NSW+ consistently and significantly outperforms ip-NSW and provides more robust performance under different data distributions.

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

↑