mlsanityData to 7 Oct 2026

Off-Policy Evaluation of Slate Policies under Bayes Risk

arXiv 2101.02553 ↗First posted 5 Jan 2021cs.LG math.ST stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

We study the problem of off-policy evaluation for slate bandits, for the typical case in which the logging policy factorizes over the slots of the slate. We slightly depart from the existing literature by taking Bayes risk as the criterion by which to evaluate estimators, and we analyze the family of 'additive' estimators that includes the pseudoinverse (PI) estimator of Swaminathan et al. (2017; arXiv:1605.04812). Using a control variate approach, we identify a new estimator in this family that is guaranteed to have lower risk than PI in the above class of problems. In particular, we show that the risk improvement over PI grows linearly with the number of slots, and linearly with the gap between the arithmetic and the harmonic mean of a set of slot-level divergences between the logging and the target policy. In the typical case of a uniform logging policy and a deterministic target policy, each divergence corresponds to slot size, showing that maximal gains can be obtained for slate problems with diverse numbers of actions per slot.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 8 of its 14 references that are in the map. First posted on arXiv 5 Jan 2021.

Builds on

8 of 14 references.

References · 8

  1. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
  2. 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
  3. 2016Off-policy evaluation for slate recommendationcited by 102
  4. 2018Offline A/B testing for Recommender Systemscited by 94
  5. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  6. 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
  7. 2018An Efficient Bandit Algorithm for Realtime Multivariate Optimizationcited by 34
  8. 2018Beyond Greedy Ranking: Slate Optimization via List-CVAEcited by 21

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1.

2 papers.