REVIEW 2 cited by
Bayesian Off-Policy Evaluation and Learning for Large Action Spaces
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Bayesian Off-Policy Evaluation and Learning for Large Action Spaces
read the original abstract
In interactive systems, actions are often correlated, presenting an opportunity for more sample-efficient off-policy evaluation (OPE) and learning (OPL) in large action spaces. We introduce a unified Bayesian framework to capture these correlations through structured and informative priors. In this framework, we propose sDM, a generic Bayesian approach for OPE and OPL, grounded in both algorithmic and theoretical foundations. Notably, sDM leverages action correlations without compromising computational efficiency. Moreover, inspired by online Bayesian bandits, we introduce Bayesian metrics that assess the average performance of algorithms across multiple problem instances, deviating from the conventional worst-case assessments. We analyze sDM in OPE and OPL, highlighting the benefits of leveraging action correlations. Empirical evidence showcases the strong performance of sDM.
Forward citations
Cited by 2 Pith papers
-
Offline Contextual Bandit with Counterfactual Sample Identification
CSI converts offline contextual bandit learning into a binary classification problem by comparing the logged action against a counterfactual action sampled from the logging policy, and the argmax of the resulting clas...
-
Off-Policy Learning in Large Action Spaces: Optimization Matters More Than Estimation
Reward-weighted log-likelihood objectives outperform complex off-policy estimators in large action spaces because their optimization landscapes are much easier to navigate.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.