vix.ing · top · new · best · stats · spec

Offline Comparison of Ranking Functions using Randomized Data

2018/10/11 by Aman Agarwal, Agarwal, Aman, Xuanhui Wang +7
Decision Sciences · Economics, Econometrics and Finance · #Advanced Bandit Algorithms Research #FOS: Computer and information sciences #Game Theory and Voting Systems #Information Retrieval (cs.IR) #Sports Analytics and Performance

paper · pdf · doi:10.48550/arxiv.1810.05252

openalex publication_date 2018/10/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Ranking functions return ranked lists of items, and users often interact with these items. How to evaluate ranking functions using historical interaction logs, also known as off-policy evaluation, is an important but challenging problem. The commonly used Inverse Propensity Scores (IPS) approaches work better for the single item case, but suffer from extremely low data efficiency for the ranked list case. In this paper, we study how to improve the data efficiency of IPS approaches in the offline comparison setting. We propose two approaches Trunc-match and Rand-interleaving for offline comparison using uniformly randomized data. We show that these methods can improve the data efficiency and also the comparison sensitivity based on one of the largest email search engines.

Related