Affiliation:
1. Naver Labs Europe, France and University of Amsterdam, The Netherlands
2. Naver Labs Europe, France
3. University of Amsterdam, The Netherlands
Abstract
Many click models have been proposed to interpret logs of natural interactions with search engines and extract unbiased information for evaluation or learning. The experimental set-up used to evaluate them typically involves measuring two metrics, namely the test perplexity for click prediction and nDCG for relevance estimation. In both cases, the data used for training and testing is assumed to be collected using the same ranking policy. We question this assumption.
Important downstream tasks based on click models involve evaluating a different policy than the training policy, i.e., click models need to operate under
policy distributional shift
. We show that click models are sensitive to it. This can severely hinder their performance on the targeted task: conventional evaluation metrics cannot guarantee that a click model will perform equally well under distributional shift.
In order to more reliably predict click model performance under policy distributional shift, we propose a new evaluation protocol. It allows us to compare the relative robustness of six types of click models under various shifts, training configurations and downstream tasks. We obtain insights into the factors that worsen the sensitivity to policy distributional shift, and formulate guidelines to mitigate the risks of deploying policies based on click models.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Science Applications,General Business, Management and Accounting,Information Systems
Reference52 articles.
1. Unbiased Learning to Rank: Online or Offline?ACM;Ai Qingyao;Trans. Inf. Syst.,2021
2. Arthur Argenson and Gabriel Dulac-Arnold. 2021. Model-Based Offline Planning. arxiv:2008.05556 [cs.LG] Arthur Argenson and Gabriel Dulac-Arnold. 2021. Model-Based Offline Planning. arxiv:2008.05556 [cs.LG]
3. A Neural Click Model for Web Search
4. A Click Sequence Model for Web Search
5. A dynamic bayesian network click model for web search ranking
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-
n
Recommendation;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
2. Trustworthy Recommendation and Search: Introduction to the Special Section - Part 2;ACM Transactions on Information Systems;2023-07-28
3. An Offline Metric for the Debiasedness of Click Models;Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval;2023-07-18