Off-Policy Evaluation for Large Action Spaces via Policy Convolution
Not on the map. Why?
Abstract (arXiv)
Developing accurate off-policy estimators is crucial for both evaluating and optimizing for new policies. The main challenge in off-policy estimation is the distribution shift between the logging policy that generates data and the target policy that we aim to evaluate. Typically, techniques for correcting distribution shift involve some form of importance sampling. This approach results in unbiased value estimation but often comes with the trade-off of high variance, even in the simpler case of one-step contextual bandits. Furthermore, importance sampling relies on the common support assumption, which becomes impractical when the action space is large. To address these challenges, we introduce the Policy Convolution (PC) family of estimators. These methods leverage latent structure within actions -- made available through action embeddings -- to strategically convolve the logging and target policies. This convolution introduces a unique bias-variance trade-off, which can be controlled by adjusting the amount of convolution. Our experiments on synthetic and benchmark datasets demonstrate remarkable mean squared error (MSE) improvements when using PC, especially when either the action space or policy mismatch becomes large, with gains of up to 5 - 6 orders of magnitude over existing estimators.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 28 of its 55 references that are in the map. First posted on arXiv 24 Oct 2023.
Builds on
28 of 55 references.
References · 28
- 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
- 2016Recommendations as Treatments: Debiasing Learning and Evaluationcited by 246
- 2015Supersizing Self-supervision: Learning to Grasp from 50K Tries and 700 Robot Hourscited by 208
- 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
- 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
- 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
- 2016Off-policy evaluation for slate recommendationcited by 102
- 2020The Importance of Pessimism in Fixed-Dataset Policy Optimizationcited by 99
- 2022A Review of Off-Policy Evaluation in Reinforcement Learningcited by 92
- 2019Doubly robust off-policy evaluation with shrinkagecited by 87
16 more
- 2019Unbiased Recommender Learning from Missing-Not-At-Random Implicit Feedbackcited by 79
- 2019Efficiently Breaking the Curse of Horizon in Off-Policy Evaluation with Double Reinforcement Learningcited by 75
- 2019Discretizing Continuous Action Space for On-Policy Optimizationcited by 65
- 2020Off-policy Policy Evaluation For Sequential Decisions Under Unobserved Confoundingcited by 60
- 2020Off-policy Bandits with Deficient Supportcited by 60
- 2018Policy Evaluation and Optimization with Continuous Treatmentscited by 57
- 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 53
- 2020Adaptive Estimator Selection for Off-Policy Evaluationcited by 38
- 2021ECLARE: Extreme Classification with Label Graph Correlationscited by 38
- 2023Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modelingcited by 34
- 2022Infinite Recommendation Networks: A Data-Centric Approachcited by 20
- 2020BLOB : A Probabilistic Model for Recommendation that Combines Organic and Bandit Signalscited by 19
- 2020Learning from eXtreme Bandit Feedbackcited by 17
- 2023Oracle-Efficient Pessimism: Offline Policy Optimization in Contextual Banditscited by 14
- 2022Oracle Inequalities for Model Selection in Offline Reinforcement Learningcited by 13
- 2022Local Metric Learning for Off-Policy Evaluation in Contextual Bandits with Continuous Actionscited by 6
Built on by
Citing papers per year: 2024: 6; 2025: 7; 2026: 1.
14 papers.
Sort:
- 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learningcited by 16
- 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
- 2024Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Banditscited by 8
- 2024Bayesian Off-Policy Evaluation and Learning for Large Action Spacescited by 5
- 2024Cross-Validated Off-Policy Evaluationcited by 3
- 2025Clustering Context in Off-Policy Evaluationcited by 2
- 2025Prompt Optimization with Logged Bandit Datacited by 1
- 2025Doubly Robust Fusion of Many Treatments for Policy Learningcited by 1
- 2025Exploiting Similarities in A/B Testing with Off-Policy Estimationcited by 1
- 2024Position Paper: Why the Shooting in the Dark Method Dominates Recommender Systems Practice; A Call to Abandon Anti-Utopian Thinkingcited by 0
- 2025MultiScale Contextual Bandits for Long Term Objectivescited by 0
- 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modelingcited by 0
- 2026Cross-Domain Off-Policy Evaluation and Learning for Contextual Bandits24 Jul 2026
- 2025Context-Action Embedding Learning for Off-Policy Evaluation in Contextual Bandits31 Aug 2025
- 2025Exploiting Similarities in A/B Testing with Off-Policy Estimation12 Jun 2025
- 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modeling31 May 2025
- 2025Doubly Robust Fusion of Many Treatments for Policy Learning12 May 2025
- 2025Prompt Optimization with Logged Bandit Data3 Apr 2025
- 2025MultiScale Contextual Bandits for Long Term Objectives22 Mar 2025
- 2025Clustering Context in Off-Policy Evaluation28 Feb 2025
- 2024Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits20 Aug 2024
- 2024Cross-Validated Off-Policy Evaluation24 May 2024
- 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learning23 May 2024
- 2024Bayesian Off-Policy Evaluation and Learning for Large Action Spaces22 Feb 2024
- 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learningcited by 16
- 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
- 2024Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Banditscited by 8
- 2024Bayesian Off-Policy Evaluation and Learning for Large Action Spacescited by 5
- 2024Cross-Validated Off-Policy Evaluationcited by 3
- 2025Clustering Context in Off-Policy Evaluationcited by 2
- 2025Prompt Optimization with Logged Bandit Datacited by 1
- 2025Doubly Robust Fusion of Many Treatments for Policy Learningcited by 1
- 2025Exploiting Similarities in A/B Testing with Off-Policy Estimationcited by 1
- 2024Position Paper: Why the Shooting in the Dark Method Dominates Recommender Systems Practice; A Call to Abandon Anti-Utopian Thinkingcited by 0
- 2025MultiScale Contextual Bandits for Long Term Objectivescited by 0
- 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modelingcited by 0
12 most cited of 14 All 14 (JSON)
- 2026Cross-Domain Off-Policy Evaluation and Learning for Contextual Bandits24 Jul 2026
- 2025Context-Action Embedding Learning for Off-Policy Evaluation in Contextual Bandits31 Aug 2025
- 2025Exploiting Similarities in A/B Testing with Off-Policy Estimation12 Jun 2025
- 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modeling31 May 2025
- 2025Doubly Robust Fusion of Many Treatments for Policy Learning12 May 2025
- 2025Prompt Optimization with Logged Bandit Data3 Apr 2025
- 2025MultiScale Contextual Bandits for Long Term Objectives22 Mar 2025
- 2025Clustering Context in Off-Policy Evaluation28 Feb 2025
- 2024Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits20 Aug 2024
- 2024Cross-Validated Off-Policy Evaluation24 May 2024
- 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learning23 May 2024
- 2024Bayesian Off-Policy Evaluation and Learning for Large Action Spaces22 Feb 2024
12 newest of 14 All 14 (JSON)