DeepAI AI Chat
Log In Sign Up

ARSM Gradient Estimator for Supervised Learning to Rank

by   Siamak Zamani Dadaneh, et al.

We propose a new model for supervised learning to rank. In our model, the relevancy labels are are assumed to follow a categorical distribution whose probabilities are constructed based on a scoring function. We optimize the training objective with respect to the multivariate categorical variables with an unbiased and low-variance gradient estimator. Learning to rank methods can generally be categorized into pointwise, pairwise, and listwise approaches. Our approach belongs to the class of pointwise methods. Although it has previously been reported that pointwise methods cannot achieve as good performance as of pairwise or listwise approaches, we show that the proposed method achieves better or comparable results on two datasets compared with pairwise and listwise methods.


page 1

page 2

page 3

page 4


CARMS: Categorical-Antithetic-REINFORCE Multi-Sample Gradient Estimator

Accurately backpropagating the gradient through categorical variables is...

Classification from Pairwise Similarity and Unlabeled Data

One of the biggest bottlenecks in supervised learning is its high labeli...

Unbiased Learning to Rank with Biased Continuous Feedback

It is a well-known challenge to learn an unbiased ranker with biased fee...

WMRB: Learning to Rank in a Scalable Batch Training Approach

We propose a new learning to rank algorithm, named Weighted Margin-Rank ...

Differentiable Unbiased Online Learning to Rank

Online Learning to Rank (OLTR) methods optimize rankers based on user in...

A General Framework for Pairwise Unbiased Learning to Rank

Pairwise debiasing is one of the most effective strategies in reducing p...