TL;DR
This paper introduces a mixture-based correction method for counterfactual learning to rank that effectively corrects position and trust bias without relying on relevance estimation, improving efficiency and robustness.
Contribution
The proposed mixture-based correction (MBC) method removes the dependency on relevance probability estimation, addressing cyclic bias correction issues in CLTR.
Findings
MBC outperforms affine correction in various bias settings.
MBC is significantly more efficient in training time.
MBC maintains unbiasedness regardless of bias parameter estimation accuracy.
Abstract
In counterfactual learning to rank (CLTR) user interactions are used as a source of supervision. Since user interactions come with bias, an important focus of research in this field lies in developing methods to correct for the bias of interactions. Inverse propensity scoring (IPS) is a popular method suitable for correcting position bias. Affine correction (AC) is a generalization of IPS that corrects for position bias and trust bias. IPS and AC provably remove bias, conditioned on an accurate estimation of the bias parameters. Estimating the bias parameters, in turn, requires an accurate estimation of the relevance probabilities. This cyclic dependency introduces practical limitations in terms of sensitivity, convergence and efficiency. We propose a new correction method for position and trust bias in CLTR in which, unlike the existing methods, the correction does not rely on…
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.
