Offline Evaluation of Ranking Policies with Click Models
Shuai Li (The Chinese University of Hong Kong); Yasin Abbasi-Yadkori (Adobe Research); Branislav Kveton (Adobe Research); S. Muthukrishnan (Rutgers University); Vishwa Vinay (Adobe Research); Zheng Wen (Adobe Research)
Many web systems rank and present a list of items to users, from recommender systems to search and advertising. An important problem in practice is to evaluate new ranking policies offline and optimize them before they are deployed. We address this problem by proposing evaluation algorithms for estimating the expected number of clicks on ranked lists from historical logged data. The existing algorithms are not guaranteed to be statistically efficient in our problem because the number of recommended lists can grow exponentially with their length. To overcome this challenge, we use models of user interaction with the list of items, the so-called click models, to construct estimators that learn statistically efficiently. We analyze our estimators and prove that they are more efficient than the estimators that do not use the structure of the click model, under the assumption that the click model holds. We evaluate our estimators in a series of experiments on a real-world dataset and show that they consistently outperform prior estimators.
How can we assist you?
We'll be updating the website as information becomes available. If you have a question that requires immediate attention, please feel free to contact us. Thank you!
If you are experiencing any issue related to registrations (confirmation, payment problem etc.) or have any questions regarding registrations, please do not submit this form. Please send an email to Kelly Hughes (email@example.com) or call 1.888.526.1242 or 303.530.4683.