Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks

被引:51
作者
Ai, Qingyao [1 ]
Wang, Xuanhui [2 ]
Bruch, Sebastian [2 ]
Golbandi, Nadav [2 ]
Bendersky, Michael [2 ]
Najork, Marc [2 ]
机构
[1] UMass Amherst, CICS, Amherst, MA 01003 USA
[2] Google Res, Mountain View, CA USA
来源
PROCEEDINGS OF THE 2019 ACM SIGIR INTERNATIONAL CONFERENCE ON THEORY OF INFORMATION RETRIEVAL (ICTIR'19) | 2019年
关键词
Multivariate scoring; groupwise scoring functions; deep neural architectures for IR;
D O I
10.1145/3341981.3344218
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
While in a classification or a regression setting a label or a value is assigned to each individual document, in a ranking setting we determine the relevance ordering of the entire input document list. This difference leads to the notion of relative relevance between documents in ranking. The majority of the existing learning-to-rank algorithms model such relativity at the loss level using pairwise or listwise loss functions. However, they are restricted to univariate scoring functions, i.e., the relevance score of a document is computed based on the document itself, regardless of other documents in the list. To overcome this limitation, we propose a new framework for multivariate scoring functions, in which the relevance score of a document is determined jointly by multiple documents in the list. We refer to this framework as GSFs-groupwise scoring functions. We learn GSFs with a deep neural network architecture, and demonstrate that several representative learning-to-rank algorithms can be modeled as special cases in our framework. We conduct evaluation using click logs from one of the largest commercial email search engines, as well as a public benchmark dataset. In both cases, GSFs lead to significant performance improvements, especially in the presence of sparse textual features.
引用
收藏
页码:84 / 91
页数:8
相关论文
共 39 条
[1]  
Agrawal R., 2009, PROC 2 ACM INT C WEB, P5, DOI DOI 10.1145/1498759.1498766
[2]   Learning a Deep Listwise Context Model for Ranking Refinement [J].
Ai, Qingyao ;
Bi, Keping ;
Guo, Jiafeng ;
Croft, W. Bruce .
ACM/SIGIR PROCEEDINGS 2018, 2018, :135-144
[3]  
[Anonymous], 2005, Monte Carlo statistical methods. Springer texts in statistics
[4]  
[Anonymous], ARXIV181200073
[5]  
[Anonymous], 2008, Proceedings of NIPS'08
[6]  
Bello I., 2018, ARXIV181002019
[7]   A Neural Click Model for Web Search [J].
Borisov, Alexey ;
Markov, Ilya ;
de Rijke, Maarten ;
Serdyukov, Pavel .
PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16), 2016, :531-541
[8]  
Burges C., 2005, P 22 INT C MACH LEAR, P89, DOI DOI 10.1145/1102351.1102363
[9]  
Burges C., 2006, ADV NEURAL INFORM PR, V19, P193, DOI DOI 10.7551/MITPRESS/7503.003.0029
[10]  
Burges C. J. C., 2010, Learning, V11, P81