mlsanityData to 7 Oct 2026

Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modeling

arXiv 2305.08062 ↗First posted 14 May 2023stat.ML cs.AI cs.LGcited by 34

Not on the map. Why?

Abstract (arXiv)

We study off-policy evaluation (OPE) of contextual bandit policies for large discrete action spaces where conventional importance-weighting approaches suffer from excessive variance. To circumvent this variance issue, we propose a new estimator, called OffCEM, that is based on the conjunct effect model (CEM), a novel decomposition of the causal effect into a cluster effect and a residual effect. OffCEM applies importance weighting only to action clusters and addresses the residual causal effect through model-based reward estimation. We show that the proposed estimator is unbiased under a new condition, called local correctness, which only requires that the residual-effect model preserves the relative expected reward differences of the actions within each cluster. To best leverage the CEM and local correctness, we also propose a new two-step procedure for performing model-based estimation that minimizes bias in the first step and variance in the second step. We find that the resulting OffCEM estimator substantially improves bias and variance compared to a range of conventional estimators. Experiments demonstrate that OffCEM provides substantial improvements in OPE especially in the presence of many actions.

Key facts. Cited by 34 papers in the map (data through 7 Oct 2026). Builds on 31 of its 56 references that are in the map. First posted on arXiv 14 May 2023.

Builds on

31 of 56 references.

References · 31

  1. 2015Doubly Robust Off-policy Value Evaluation for Reinforcement Learningcited by 337
  2. 2016Data-Efficient Off-Policy Policy Evaluation for Reinforcement Learningcited by 285
  3. 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 226
  4. 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
  5. 2015Deep Reinforcement Learning in Large Discrete Action Spacescited by 158
  6. 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
  7. 2020RODE: Learning Roles to Decompose Multi-Agent Taskscited by 125
  8. 2019Empirical Study of Off-Policy Policy Evaluation for Reinforcement Learningcited by 121
  9. 2019Towards Optimal Off-Policy Evaluation for Reinforcement Learning with Marginalized Importance Samplingcited by 118
  10. 2019Double Reinforcement Learning for Efficient Off-Policy Evaluation in Markov Decision Processescited by 118
  11. 2016Optimal and Adaptive Off-policy Evaluation in Contextual Banditscited by 111
  12. 2016Off-policy evaluation for slate recommendationcited by 102
19 more
  1. 2019Doubly robust off-policy evaluation with shrinkagecited by 87
  2. 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
  3. 2019Learning Action Representations for Reinforcement Learningcited by 75
  4. 2020Off-policy Bandits with Deficient Supportcited by 60
  5. 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 53
  6. 2020Adaptive Estimator Selection for Off-Policy Evaluationcited by 38
  7. 2019Understanding the Curse of Horizon in Off-Policy Evaluation via Conditional Importance Samplingcited by 36
  8. 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
  9. 2018Offline Evaluation of Ranking Policies with Click Modelscited by 32
  10. 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
  11. 2020Optimal Off-Policy Evaluation from Multiple Logging Policiescited by 30
  12. 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
  13. 2019The Natural Language of Actionscited by 28
  14. 2020Using Experiments to Correct for Selection in Observational Studiescited by 28
  15. 2022Policy-Adaptive Estimator Selection for Off-Policy Evaluationcited by 24
  16. 2020Learning from eXtreme Bandit Feedbackcited by 17
  17. 2018Efficient Counterfactual Learning from Bandit Feedbackcited by 15
  18. 2021Control Variates for Slate Off-Policy Evaluationcited by 13
  19. 2022Off-Policy Evaluation in Embedded Spacescited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 5; 2024: 9; 2025: 11; 2026: 9.

34 papers.

Sort:

By area:

  1. 2023Off-Policy Evaluation of Ranking Policies under Diverse User Behaviorcited by 16
  2. 2024Logarithmic Smoothing for Pessimistic Off-Policy Evaluation, Selection and Learningcited by 16
  3. 2023Off-Policy Evaluation for Large Action Spaces via Policy Convolutioncited by 14
  4. 2023On (Normalised) Discounted Cumulative Gain as an Off-Policy Evaluation Metric for Top-n Recommendationcited by 13
  5. 2023Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluationcited by 13
  6. 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
  7. 2024Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Banditscited by 8
  8. 2023SCOPE-RL: A Python Library for Offline Reinforcement Learning and Off-Policy Evaluationcited by 6
  9. 2024Bayesian Off-Policy Evaluation and Learning for Large Action Spacescited by 5
  10. 2024Hyperparameter Optimization Can Even be Harmful in Off-Policy Learning and How to Deal with Itcited by 5
  11. 2024Cross-Validated Off-Policy Evaluationcited by 3
  12. 2024Unified PAC-Bayesian Study of Pessimism for Offline Policy Learning with Regularized Importance Samplingcited by 3
22 more
  1. 2024Off-policy estimation with adaptively collected data: the power of online learningcited by 3
  2. 2024Structured Learning of Compositional Sequential Interventionscited by 2
  3. 2025Clustering Context in Off-Policy Evaluationcited by 2
  4. 2025Language Model Distillation: A Temporal Difference Imitation Learning Perspectivecited by 2
  5. 2025Off-Policy Evaluation and Learning for Matching Marketscited by 2
  6. 2026Causal methods for LLM development and evaluationcited by 2
  7. 2025Prompt Optimization with Logged Bandit Datacited by 1
  8. 2025Doubly Robust Fusion of Many Treatments for Policy Learningcited by 1
  9. 2025A General Framework for Off-Policy Learning with Partially-Observed Rewardcited by 1
  10. 2026Off-Policy Evaluation for Ranking Policies under Deterministic Logging Policiescited by 1
  11. 2026Off-Policy Evaluation for Semantic ID Recommenders: Does the Model's Own Code Hierarchy Help?cited by 1
  12. 2025Counterfactual Inference under Thompson Samplingcited by 0
  13. 2025Q-function Decomposition with Intervention Semantics with Factored Action Spacescited by 0
  14. 2025DOLCE: Decomposing Off-Policy Evaluation/Learning into Lagged and Current Effectscited by 0
  15. 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modelingcited by 0
  16. 2025Off-Policy Learning in Large Action Spaces: Optimization Matters More Than Estimationcited by 0
  17. 2026CASP: Support-Aware Offline Policy Selection for Two-Stage Recommender Systemscited by 0
  18. 2026Offline Contextual Bandits in the Presence of New Actionscited by 0
  19. 2026Accelerating A/B-Tests with Counterfactual Estimation: Reducing Variance through Policy Overlapcited by 0
  20. 2026Cross-Domain Off-Policy Evaluation and Learning for Contextual Banditscited by 0
  21. 2026Adaptive Doubly Robust Off-Policy Evaluation for Ranking Policies under Diverse User Behaviorcited by 0
  22. 2026Efficient Offline Learning of Ranking Policies via Top-k Policy Decompositioncited by 0