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

高效且有效的基于树和神经学习的排序

Efficient and Effective Tree-based and Neural Learning to Rank

Sebastian Bruch, Claudio Lucchese, Franco Maria Nardini

AI总结:

本专著全面综述了排序与检索领域的效率与有效性研究,探讨了神经网络与决策森林排序模型间的联系与挑战,并指出了未来重要研究方向。

摘要:

本专著旨在推动神经信息检索时代的效率研究,通过全面综述排序以及部分检索领域的效率与有效性文献来实现这一目标。本专著的灵感来自于基于神经网络的排序解决方案与其前身——基于决策森林的学习排序模型之间存在的相似挑战,以及迄今为止文献所提供的解决方案之间的联系。我们相信,通过理解支撑这些算法和数据结构解决方案的基本原理,以控制效率与有效性之间的矛盾关系,人们可以更好地识别未来的方向,并更高效地判断各种想法的价值。我们还提出了我们认为在检索和排序的效率与有效性前沿的重要研究方向。

英文摘要:

This monograph takes a step towards promoting the study of efficiency in the era of neural information retrieval by offering a comprehensive survey of the literature on efficiency and effectiveness in ranking, and to a limited extent, retrieval. This monograph was inspired by the parallels that exist between the challenges in neural network-based ranking solutions and their predecessors, decision forest-based learning to rank models, as well as the connections between the solutions the literature to date has to offer. We believe that by understanding the fundamentals underpinning these algorithmic and data structure solutions for containing the contentious relationship between efficiency and effectiveness, one can better identify future directions and more efficiently determine the merits of ideas. We also present what we believe to be important research directions in the forefront of efficiency and effectiveness in retrieval and ranking.

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

↑