TL;DR
This paper investigates the use of multivariate scoring functions in automatic unbiased learning to rank (AutoULTR), demonstrating that permutation-invariant multivariate models outperform univariate and permutation-variant models in noisy click data scenarios.
Contribution
It provides a theoretical analysis of multivariate scoring functions in AutoULTR, highlighting permutation invariance as a key factor for effectiveness.
Findings
Permutation-invariant multivariate models outperform univariate models.
Permutation-variant multivariate models perform worse than permutation-invariant ones.
AutoULTR with permutation-invariant multivariate functions significantly improves ranking accuracy.
Abstract
Leveraging biased click data for optimizing learning to rank systems has been a popular approach in information retrieval. Because click data is often noisy and biased, a variety of methods have been proposed to construct unbiased learning to rank (ULTR) algorithms for the learning of unbiased ranking models. Among them, automatic unbiased learning to rank (AutoULTR) algorithms that jointly learn user bias models (i.e., propensity models) with unbiased rankers have received a lot of attention due to their superior performance and low deployment cost in practice. Despite their differences in theories and algorithm design, existing studies on ULTR usually use uni-variate ranking functions to score each document or result independently. On the other hand, recent advances in context-aware learning-to-rank models have shown that multivariate scoring functions, which read multiple documents…
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.
