mlsanityData to 7 Oct 2026

Off-Policy Evaluation of Ranking Policies under Diverse User Behavior

arXiv 2306.15098 ↗First posted 26 Jun 2023stat.ML cs.IR cs.LGcited by 16

Not on the map. Why?

Abstract (arXiv)

Ranking interfaces are everywhere in online platforms. There is thus an ever growing interest in their Off-Policy Evaluation (OPE), aiming towards an accurate performance evaluation of ranking policies using logged data. A de-facto approach for OPE is Inverse Propensity Scoring (IPS), which provides an unbiased and consistent value estimate. However, it becomes extremely inaccurate in the ranking setup due to its high variance under large action spaces. To deal with this problem, previous studies assume either independent or cascade user behavior, resulting in some ranking versions of IPS. While these estimators are somewhat effective in reducing the variance, all existing estimators apply a single universal assumption to every user, causing excessive bias and variance. Therefore, this work explores a far more general formulation where user behavior is diverse and can vary depending on the user context. We show that the resulting estimator, which we call Adaptive IPS (AIPS), can be unbiased under any complex user behavior. Moreover, AIPS achieves the minimum variance among all unbiased estimators based on IPS. We further develop a procedure to identify the appropriate user behavior model to minimize the mean squared error (MSE) of AIPS in a data-driven fashion. Extensive experiments demonstrate that the empirical accuracy improvement can be significant, enabling effective OPE of ranking systems even under diverse user behavior.

Key facts. Cited by 16 papers in the map (data through 7 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 26 Jun 2023.

Builds on

21 of 47 references.

References · 21

  1. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,873
  2. 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 254
  3. 2016Unbiased Learning-to-Rank with Biased Feedbackcited by 155
  4. 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
  5. 2016Off-policy evaluation for slate recommendationcited by 102
  6. 2018Offline A/B testing for Recommender Systemscited by 94
  7. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  8. 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
  9. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  10. 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 53
  11. 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
  12. 2023Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modelingcited by 34
9 more
  1. 2018Offline Evaluation of Ranking Policies with Click Modelscited by 32
  2. 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
  3. 2020Optimal Off-Policy Evaluation from Multiple Logging Policiescited by 30
  4. 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
  5. 2022Policy-Adaptive Estimator Selection for Off-Policy Evaluationcited by 24
  6. 2021Accelerating Offline Reinforcement Learning Application in Real-Time Bidding and Recommendation: Potential Use of Simulationcited by 16
  7. 2021Identification of Subgroups With Similar Benefits in Off-Policy Policy Evaluationcited by 5
  8. 2021Off-Policy Evaluation of Slate Policies under Bayes Riskcited by 2
  9. 2020Hybrid Interest Modeling for Long-tailed Userscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 4; 2025: 3; 2026: 8.

16 papers.

Sort:

By area: