arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.02404cs.IRcs.AI
收藏

复杂演示布局中的相关性和显示首选项排名

Ranking for Relevance and Display Preferences in Complex Presentation Layouts

University of Amsterdam(阿姆斯特丹大学)

Harrie Oosterhuis, Maarten de Rijke

摘要:

学习排序传统上考虑了给定对象的相关性信息的设置,对对象进行排序的期望顺序是清楚的。然而,随着今天的各种各样的用户和布局,情况并非总是如此。在本文中,我们考虑所谓的复杂的排名设置,这是不清楚应该显示什么,也就是说,什么相关的项目,以及它们应该如何显示,也就是说,最相关的项目应该放在哪里。这些排名设置是复杂的,因为它们涉及传统排名和推断最佳显示顺序。现有的学习排序方法不能处理这种复杂的排序设置,因为它们假设显示顺序是预先已知的。为了解决这一差距,我们引入了一种新的深度强化学习方法,该方法能够从弱奖励信号中学习复杂的排名,包括布局和给定布局的最佳排名。我们提出的方法通过顺序选择文档和位置来实现,因此它对文档和位置进行排名,这就是为什么我们称之为双排名模型(DRM)。我们的实验表明,DRM优于所有现有的方法在复杂的排名设置,从而导致显着的排名改善的情况下,显示顺序是不知道的先验。

英文摘要:

Learning to Rank has traditionally considered settings where given the relevance information of objects, the desired order in which to rank the objects is clear. However, with today's large variety of users and layouts this is not always the case. In this paper, we consider so-called complex ranking settings where it is not clear what should be displayed, that is, what the relevant items are, and how they should be displayed, that is, where the most relevant items should be placed. These ranking settings are complex as they involve both traditional ranking and inferring the best display order. Existing learning to rank methods cannot handle such complex ranking settings as they assume that the display order is known beforehand. To address this gap we introduce a novel Deep Reinforcement Learning method that is capable of learning complex rankings, both the layout and the best ranking given the layout, from weak reward signals. Our proposed method does so by selecting documents and positions sequentially, hence it ranks both the documents and positions, which is why we call it the Double-Rank Model (DRM). Our experiments show that DRM outperforms all existing methods in complex ranking settings, thus it leads to substantial ranking improvements in cases where the display order is not known a priori.

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

↑