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

连续空间中的端到端检索

End-to-End Retrieval in Continuous Space

Google AI(谷歌人工智能)

Daniel Gillick, Alessandro Presta, Gaurav Singh Tomar

摘要:

大多数基于文本的信息检索(IR)系统索引对象的单词或短语。这些离散系统已经被使用嵌入来测量连续空间中的相似性的模型所增强。但是连续空间模型通常只是用来重新排列最佳候选人。我们考虑端到端连续检索的问题,其中标准的近似最近邻(ANN)搜索取代了通常的离散倒排索引,并完全依赖于学习嵌入之间的距离。通过训练专门用于检索的简单模型,使用适当的模型架构,我们在两个相似问题检索任务上的离散基线分别提高了8%和26%(MAP)。我们还讨论了检索系统的评价问题,并展示了如何修改现有的成对相似性数据集,为此目的。

英文摘要:

Most text-based information retrieval (IR) systems index objects by words or phrases. These discrete systems have been augmented by models that use embeddings to measure similarity in continuous space. But continuous-space models are typically used just to re-rank the top candidates. We consider the problem of end-to-end continuous retrieval, where standard approximate nearest neighbor (ANN) search replaces the usual discrete inverted index, and rely entirely on distances between learned embeddings. By training simple models specifically for retrieval, with an appropriate model architecture, we improve on a discrete baseline by 8% and 26% (MAP) on two similar-question retrieval tasks. We also discuss the problem of evaluation for retrieval systems, and show how to modify existing pairwise similarity datasets for this purpose.

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

↑