Evaluating the Robustness of Click Models to Policy Distributional Shift

Author:

Deffayet Romain1,Renders Jean-Michel2,de Rijke Maarten3

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 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3