Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
Filip Radlinski, Thorsten Joachims
Abstract
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well known that the probability of a user clicking on a result is strongly biased toward documents presented higher in the result set irrespective of relevance. We introduce a simple method to modify the presentation of search results that provably gives relevance judgments that are unaffected by presentation bias under reasonable assumptions. We validate this property of the training data in interactive real world experiments. Finally, we show that using these unbiased relevance judgments learning methods can be guaranteed to converge to an ideal ranking given sufficient data.
Create a lesson
Related papers
misi: a Metric Inverted Sample Index
Edgar Chavez
Scaling Graph Neural Networks for Friend Recommendation: Multi-Hash User Embeddings and Temporal Neighbor Sampling
Maksim Utushkin, Andrei Ovsiannikov, Alexander D'yakonov
Stageboost: Recommending Signals Based on Counterfactual Estimation
Darpan Singhal, Matan Mandelbrod, Tal Franji et al.
Astar: Learning to Propose Evolution Directions for Self-Evolving Industrial AI Systems
Jinxin Hu, Hao Deng, Haibo Xing et al.
ProRetrieval: Learning to Orchestrate Hybrid Search via Executable Program Synthesis
Chengsong You, Zhen Sun, Yunhai Hu et al.
Conversational Recommendation over Live E-Commerce Catalogues with Self-Refreshing Retrieval
Ante Kapetanovic, Tomislav Duricic, Dionizije Fa et al.