paper-with-me

홈 › Papers

De-Biased Modelling of Search Click Behavior with Reinforcement Learning

2021-05-21 · Jianghong Zhou, Sayyed M. Zahiri, Simon Hughes, Khalifeh Al Jadda, Surya Kallumadi, Eugene Agichtein

Users' clicks on Web search results are one of the key signals for evaluating and improving web search quality and have been widely used as part of current state-of-the-art Learning-To-Rank(LTR) models. With a large volume of search logs available for major search engines, effective models of searcher click behavior have emerged to evaluate and train LTR models. However, when modeling the users' click behavior, considering the bias of the behavior is imperative. In particular, when a search result is not clicked, it is not necessarily chosen as not relevant by the user, but instead could have been simply missed, especially for lower-ranked results. These kinds of biases in the click log data can be incorporated into the click models, propagating the errors to the resulting LTR ranking models or evaluation metrics. In this paper, we propose the De-biased Reinforcement Learning Click model (DRLC). The DRLC model relaxes previously made assumptions about the users' examination behavior and resulting latent states. To implement the DRLC model, convolutional neural networks are used as the value networks for reinforcement learning, trained to learn a policy to reduce bias in the click logs. To demonstrate the effectiveness of the DRLC model, we first compare performance with the previous state-of-art approaches using established click prediction metrics, including log-likelihood and perplexity. We further show that DRLC also leads to improvements in ranking performance. Our experiments demonstrate the effectiveness of the DRLC model in learning to reduce bias in click logs, leading to improved modeling performance and showing the potential for using DRLC for improving Web search quality.

📄 PDF Abstract BibTeX arXiv:2105.10072

Code (0)

등록된 구현이 없습니다.

Tasks

Learning-To-Rankreinforcement-learningReinforcement LearningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

Reaching the End of Unbiasedness: Uncovering Implicit Limitations of Click-Based Learning to Rank

2022-06-24 · Harrie Oosterhuis

Click-based learning to rank (LTR) tackles the mismatch between click frequencies on items and their actual relevance. The approach of previous work has been to assume a model of click behavior and to subsequently introd…

counterfactualLearning-To-Rank

Reinforcement Online Learning to Rank with Unbiased Reward Shaping

2022-01-05 · Shengyao Zhuang, Zhihao Qiao, Guido Zuccon

Online learning to rank (OLTR) aims to learn a ranker directly from implicit feedback derived from users' interactions, such as clicks. Clicks however are a biased signal: specifically, top-ranked documents are likely to…

Learning-To-RankPosition

DebiasedRec: Bias-aware User Modeling and Click Prediction for Personalized News Recommendation

2021-04-15 · Jingwei Yi, Fangzhao Wu, Chuhan Wu, Qifei Li 외

News recommendation is critical for personalized news access. Existing news recommendation methods usually infer users' personal interest based on their historical clicked news, and train the news recommendation models b…

ArticlesNews Recommendation

Whole Page Unbiased Learning to Rank

2022-10-19 · Haitao Mao, Lixin Zou, Yujia Zheng, Jiliang Tang 외

The page presentation biases in the information retrieval system, especially on the click behavior, is a well-known challenge that hinders improving ranking models' performance with implicit user feedback. Unbiased Learn…

Causal DiscoveryInformation RetrievalLearning-To-RankRetrieval

Approximated Doubly Robust Search Relevance Estimation

2022-08-16 · Lixin Zou, Changying Hao, Hengyi Cai, Suqi Cheng 외

Extracting query-document relevance from the sparse, biased clickthrough log is among the most fundamental tasks in the web search system. Prior art mainly learns a relevance judgment model with semantic features of the …

counterfactual