arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1603.01855cs.LG
收藏

在线学习排序靠前的反馈

Online Learning to Rank with Feedback at the Top

University of Michigan, Ann Arbor(密歇根大学安娜堡分校)

Sougata Chaudhuri, Ambuj Tewari

摘要:

我们考虑一个在线学习排序设置,在每一轮,一个不经意的对手产生一个列表的$m$文件,有关的查询,和学习者产生分数排名的文件。然后,对手生成相关性向量,学习者根据收到的反馈更新其排名。我们认为反馈被限制为仅是$k \ll m$的排名列表中的顶部$k$文档的相关性级别的设置。然而,学习器的性能是基于未显示的全相关向量,使用适当的学习排序损失函数来判断的。我们开发了有效的算法,众所周知的损失在逐点,成对和列表家庭。我们还证明,没有在线算法可以有次线性遗憾,与前1反馈,任何损失,是校准相对于NDCG。我们将我们的算法应用于基准数据集上,证明了从高度限制的反馈中对排名函数进行有效的在线学习。

英文摘要:

We consider an online learning to rank setting in which, at each round, an oblivious adversary generates a list of $m$ documents, pertaining to a query, and the learner produces scores to rank the documents. The adversary then generates a relevance vector and the learner updates its ranker according to the feedback received. We consider the setting where the feedback is restricted to be the relevance levels of only the top $k$ documents in the ranked list for $k \ll m$. However, the performance of learner is judged based on the unrevealed full relevance vectors, using an appropriate learning to rank loss function. We develop efficient algorithms for well known losses in the pointwise, pairwise and listwise families. We also prove that no online algorithm can have sublinear regret, with top-1 feedback, for any loss that is calibrated with respect to NDCG. We apply our algorithms on benchmark datasets demonstrating efficient online learning of a ranking function from highly restricted feedback.

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

↑