When Can You Trust Offline Evaluation of Equal-Cost Top-k Allocation? A Controlled, Reproducible Benchmark and Practitioner's Guide
Not on the map. Why?
Abstract (arXiv)
Organizations decide whom to treat under a budget and want to know what a targeting rule would have earned before deploying it. Off-policy evaluation promises this from logged data, but the deployable rule is a deterministic top-k policy: it removes all averaging over actions, so weak overlap hits the estimate directly. We benchmark six estimators across five datasets and two known-effect sweeps, and validate the mechanisms against a non-simulated paired reference. First, weak overlap is governed by logger-target action alignment, not by logging sharpness alone: what governs support is the logger's probability of the target's actions. Sharpening a logger built from the target's own score barely moves overlap over the tested range; action-level disagreement collapses it. Effective sample size ranks this risk across logging environments, but is weak at ranking candidates within the single log a practitioner holds, and its cut point does not transfer. Second, the optimizer's curse is not fixed by cross-fitting the outcome nuisance. When the rule is fit on the data used to evaluate it, cross-fitting the nuisance alone leaves the reuse bias in place and makes it worse. Honest policy-level splitting avoids the reuse by targeting the learning procedure's value -- a change of estimand, not a de-biasing of the full-sample policy. Third, propensity-estimation error is the largest degradation we measure: an out-of-fold estimate hurts IPS more than any other stress we apply, leaves doubly-robust estimation almost unchanged, and can invert the overlap diagnostic itself. Logging is synthesized and propensities floored at 0.02, so every failure occurs with bounded weights; the floor also reduces the two tuned hybrids to their untuned parents, leaving four practically distinct estimators, and all exact-value surfaces are synthetic or semi-synthetic. We release the benchmark; public data only.
Key facts. No citing papers in the map yet (data through 13 Oct 2026). Builds on 15 of its 26 references that are in the map. First posted on arXiv 12 Aug 2026.
Builds on
15 of 26 references.
References · 15
- 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
- 2015Recursive Partitioning for Heterogeneous Causal Effectscited by 255
- 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
- 2017Automated versus do-it-yourself methods for causal inference: Lessons learned from a data analysis competitioncited by 106
- 2019Doubly robust off-policy evaluation with shrinkagecited by 87
- 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
- 2019Atlantic Causal Inference Conference (ACIC) Data Analysis Challenge 2017cited by 23
- 2022Offline Policy Optimization with Eligible Actionscited by 7
- 2023SCOPE-RL: A Python Library for Offline Reinforcement Learning and Off-Policy Evaluationcited by 6
- 2022Off-Policy Evaluation with Policy-Dependent Optimization Responsecited by 3
- 2026Logging Policy Design for Off-Policy Evaluationcited by 3
- 2025Breaking Determinism: Stochastic Modeling for Reliable Off-Policy Evaluation in Ad Auctionscited by 2
Built on by
Not cited yet.