TL;DR
This paper introduces PDGD, a novel differentiable online learning to rank method that effectively optimizes non-linear models like neural networks, outperforming existing methods in speed and accuracy while maintaining unbiased gradients.
Contribution
The paper presents PDGD, a new unbiased, differentiable OLTR approach that extends effective optimization to non-linear models such as neural networks.
Findings
PDGD outperforms existing OLTR methods in learning speed and convergence.
Using neural networks with PDGD yields better performance than linear models.
PDGD maintains unbiased gradients and improves user experience.
Abstract
Online Learning to Rank (OLTR) methods optimize rankers based on user interactions. State-of-the-art OLTR methods are built specifically for linear models. Their approaches do not extend well to non-linear models such as neural networks. We introduce an entirely novel approach to OLTR that constructs a weighted differentiable pairwise loss after each interaction: Pairwise Differentiable Gradient Descent (PDGD). PDGD breaks away from the traditional approach that relies on interleaving or multileaving and extensive sampling of models to estimate gradients. Instead, its gradient is based on inferring preferences between document pairs from user clicks and can optimize any differentiable model. We prove that the gradient of PDGD is unbiased w.r.t. user document pair preferences. Our experiments on the largest publicly available Learning to Rank (LTR) datasets show considerable and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
