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

多级检索系统中的动态权衡预测

Dynamic Trade-Off Prediction in Multi-Stage Retrieval Systems

J. Shane Culpepper, Charles L. A. Clarke, Jimmy Lin

摘要:

现代多阶段检索系统由候选生成阶段和一个或多个重新排序阶段组成。在这种架构中,最终排名列表的质量可能对初始候选池的质量不敏感,特别是在早期精度方面。这提供了几个机会,以提高检索效率,而不会显着牺牲有效性。在本文中,我们探索了一种新的方法来动态预测两个不同的参数在候选生成阶段,可以直接影响整个系统的整体效率和有效性。以前探索这种权衡的工作主要集中在适用于所有查询的全局参数设置上,即使最佳设置因查询而异。相比之下,我们提出了一种技术,使一个参数预测,最大限度地提高效率,在一个有效性的信封上每个查询的基础上,只使用静态预检索功能。使用分类器级联来决定有效性和效率之间的查询特定的权衡点,该分类器级联在可能的参数截止值的范围内权衡可能的效率增益与有效性损失以进行预测。我们的新方法中有趣的转折是训练分类器,而不需要显式的相关性判断。我们表明,我们的框架是可推广的,通过将其应用到两个不同的检索参数-选择常见的前k查询检索算法中的k,并设置一个质量阈值,$ρ$,得分在一个时间近似查询评估算法。实验结果表明,大量的效率增益是可以实现的动态参数的选择。此外,我们的框架提供了一个通用的工具,可用于在选择和调整算法进行机器学习预测之前估计可能的有效性-效率权衡。

英文摘要:

Modern multi-stage retrieval systems are comprised of a candidate generation stage followed by one or more reranking stages. In such an architecture, the quality of the final ranked list may not be sensitive to the quality of initial candidate pool, especially in terms of early precision. This provides several opportunities to increase retrieval efficiency without significantly sacrificing effectiveness. In this paper, we explore a new approach to dynamically predicting two different parameters in the candidate generation stage which can directly affect the overall efficiency and effectiveness of the entire system. Previous work exploring this tradeoff has focused on global parameter settings that apply to all queries, even though optimal settings vary across queries. In contrast, we propose a technique which makes a parameter prediction that maximizes efficiency within a effectiveness envelope on a per query basis, using only static pre-retrieval features. The query-specific tradeoff point between effectiveness and efficiency is decided using a classifier cascade that weighs possible efficiency gains against effectiveness losses over a range of possible parameter cutoffs to make the prediction. The interesting twist in our new approach is to train classifiers without requiring explicit relevance judgments. We show that our framework is generalizable by applying it to two different retrieval parameters - selecting k in common top-k query retrieval algorithms, and setting a quality threshold, $ρ$, for score-at-a-time approximate query evaluation algorithms. Experimental results show that substantial efficiency gains are achievable depending on the dynamic parameter choice. In addition, our framework provides a versatile tool that can be used to estimate the effectiveness-efficiency tradeoffs that are possible before selecting and tuning algorithms to make machine learned predictions.

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

↑