Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits
Not on the map. Why?
Abstract (arXiv)
We explore off-policy evaluation and learning (OPE/L) in contextual combinatorial bandits (CCB), where a policy selects a subset in the action space. For example, it might choose a set of furniture pieces (a bed and a drawer) from available items (bed, drawer, chair, etc.) for interior design sales. This setting is widespread in fields such as recommender systems and healthcare, yet OPE/L of CCB remains unexplored in the relevant literature. Typical OPE/L methods such as regression and importance sampling can be applied to the CCB problem, however, they face significant challenges due to high bias or variance, exacerbated by the exponential growth in the number of available subsets. To address these challenges, we introduce a concept of factored action space, which allows us to decompose each subset into binary indicators. This formulation allows us to distinguish between the ''main effect'' derived from the main actions, and the ''residual effect'', originating from the supplemental actions, facilitating more effective OPE. Specifically, our estimator, called OPCB, leverages an importance sampling-based approach to unbiasedly estimate the main effect, while employing regression-based approach to deal with the residual effect with low variance. OPCB achieves substantial variance reduction compared to conventional importance sampling methods and bias reduction relative to regression methods under certain conditions, as illustrated in our theoretical analysis. Experiments demonstrate OPCB's superior performance over typical methods in both OPE and OPL.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 34 of its 59 references that are in the map. First posted on arXiv 20 Aug 2024.
Builds on
34 of 59 references.
References · 34
- 2018Breaking the Curse of Horizon: Infinite-Horizon Off-Policy Estimationcited by 226
- 2015Doubly Robust Policy Evaluation and Optimizationcited by 158
- 2018More Robust Doubly Robust Off-policy Evaluationcited by 141
- 2016Off-policy evaluation for slate recommendationcited by 102
- 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 94
- 2019Doubly robust off-policy evaluation with shrinkagecited by 87
- 2018Thompson Sampling for Combinatorial Semi-Banditscited by 78
- 2020Open Bandit Dataset and Pipeline: Towards Realistic and Reproducible Off-Policy Evaluationcited by 77
- 2020Off-policy Bandits with Deficient Supportcited by 60
- 2022Off-Policy Evaluation for Large Action Spaces via Embeddingscited by 53
- 2020Adaptive Estimator Selection for Off-Policy Evaluationcited by 38
- 2014Efficient Learning in Large-Scale Combinatorial Semi-Banditscited by 36
22 more
- 2020Counterfactual Evaluation of Slate Recommendations with Sequential Reward Interactionscited by 35
- 2023Off-Policy Evaluation for Large Action Spaces via Conjunct Effect Modelingcited by 34
- 2018Offline Evaluation of Ranking Policies with Click Modelscited by 32
- 2021Evaluating the Robustness of Off-Policy Evaluationcited by 32
- 2020Statistical Efficiency of Thompson Sampling for Combinatorial Semi-Banditscited by 30
- 2020Optimal Off-Policy Evaluation from Multiple Logging Policiescited by 30
- 2022Doubly Robust Off-Policy Evaluation for Ranking Policies under the Cascade Behavior Modelcited by 30
- 2014Matroid Bandits: Fast Combinatorial Optimization with Learningcited by 29
- 2019Top-k Combinatorial Bandits with Full-Bandit Feedbackcited by 28
- 2022Policy-Adaptive Estimator Selection for Off-Policy Evaluationcited by 24
- 2024Off-Policy Evaluation of Slate Bandit Policies via Optimizing Abstractioncited by 17
- 2023Off-Policy Evaluation of Ranking Policies under Diverse User Behaviorcited by 16
- 2022Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Armscited by 15
- 2019Batch-Size Independent Regret Bounds for the Combinatorial Multi-Armed Bandit Problemcited by 14
- 2023Off-Policy Evaluation for Large Action Spaces via Policy Convolutioncited by 14
- 2021Control Variates for Slate Off-Policy Evaluationcited by 13
- 2023Towards Assessing and Benchmarking Risk-Return Tradeoff of Off-Policy Evaluationcited by 13
- 2024POTEC: Off-Policy Learning for Large Action Spaces via Two-Stage Policy Decompositioncited by 13
- 2021Near-Optimal Regret Bounds for Contextual Combinatorial Semi-Bandits with Linear Payoff Functionscited by 9
- 2024Long-term Off-Policy Evaluation and Learningcited by 9
- 2018Stochastic Top-K Subset Bandits with Linear Space and Non-Linear Feedbackcited by 8
- 2024Hyperparameter Optimization Can Even be Harmful in Off-Policy Learning and How to Deal with Itcited by 5
Built on by
Citing papers per year: 2025: 2; 2026: 6.
8 papers.
- 2025Off-Policy Evaluation and Learning for Matching Marketscited by 2
- 2026Off-Policy Evaluation for Ranking Policies under Deterministic Logging Policiescited by 1
- 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modelingcited by 0
- 2026Offline Contextual Bandits in the Presence of New Actionscited by 0
- 2026Quotient DAGs for Off-Policy Evaluation:Forward-Flow Importance Sampling and Exact Slate Propensitiescited by 0
- 2026Diffusion-Based Data-Driven Assortment Optimizationcited by 0
- 2026COVER: Identifiable Evaluation of Coalition Routingcited by 0
- 2026Adaptive Doubly Robust Off-Policy Evaluation for Ranking Policies under Diverse User Behaviorcited by 0
- 2026Adaptive Doubly Robust Off-Policy Evaluation for Ranking Policies under Diverse User Behavior30 Aug 2026
- 2026COVER: Identifiable Evaluation of Coalition Routing28 Aug 2026
- 2026Diffusion-Based Data-Driven Assortment Optimization11 Aug 2026
- 2026Quotient DAGs for Off-Policy Evaluation:Forward-Flow Importance Sampling and Exact Slate Propensities28 May 2026
- 2026Offline Contextual Bandits in the Presence of New Actions18 May 2026
- 2026Off-Policy Evaluation for Ranking Policies under Deterministic Logging Policies23 Mar 2026
- 2025Off-Policy Evaluation and Learning for Matching Markets18 Jul 2025
- 2025Off-Policy Evaluation of Ranking Policies via Embedding-Space User Behavior Modeling31 May 2025