Learning Groupwise Multivariate Scoring Functions Using Deep Neural Networks
arXiv:1811.04415 · doi:10.1145/3341981.3344218
Abstract
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.
References in corpus (5)
- A Deep Relevance Matching Model for Ad-hoc Retrieval
- DeepRank: A New Deep Architecture for Relevance Ranking in Information Retrieval
- Learning a Deep Listwise Context Model for Ranking Refinement
- TF-Ranking: Scalable TensorFlow Library for Learning-to-Rank
- Deep Character-Level Click-Through Rate Prediction for Sponsored Search
Cited by in corpus (5)
- RankFormer: Listwise Learning-to-Rank Using Listwide Labels
- Listwise Learning to Rank by Exploring Unique Ratings
- Variation Control and Evaluation for Generative SlateRecommendations
- TSPRank: Bridging Pairwise and Listwise Methods with a Bilinear Travelling Salesman Model
- An Optimal Algorithm for Finding Champions in Tournament Graphs