Pith. sign in

REVIEW 2 cited by

Automated Off-Policy Estimator Selection via Supervised Learning

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

arxiv 2406.18022 v2 pith:6TMQNWNG submitted 2024-06-26 cs.LG cs.AI

classification cs.LGcs.AI
keywords estimatorselectionlearningmethodproblemseveralaccurateautomated
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Off-Policy Evaluation (OPE) problem consists of evaluating the performance of counterfactual policies with data collected by another one. To solve the OPE problem, we resort to estimators, which aim to estimate in the most accurate way possible the performance that the counterfactual policies would have had if they were deployed in place of the logging policy. In the literature, several estimators have been developed, all with different characteristics and theoretical guarantees. Therefore, there is no dominant estimator and each estimator may be the best for different OPE problems, depending on the characteristics of the dataset at hand. Although the selection of the estimator is a crucial choice for an accurate OPE, this problem has been widely overlooked in the literature. We propose an automated data-driven OPE estimator selection method based on supervised learning. In particular, the core idea we propose in this paper is to create several synthetic OPE tasks and use a machine learning model trained to predict the best estimator for those synthetic tasks. We empirically show how our method is able to perform a better estimator selection compared to a baseline method on several real-world datasets, with a computational cost significantly lower than the one of the baseline.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Cross-Domain Off-Policy Evaluation and Learning for Contextual Bandits

    cs.LG 2026-07 reject novelty 6.0 of 10

    COPE/COPE-PG, a cross-domain off-policy evaluation and learning method, leverages source-domain data to estimate and optimize target-domain policies even with few-shot data, deterministic logging, and completely new actions.

  2. Off-Policy Evaluation and Learning for the Future under Non-Stationarity

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A new importance-weighted estimator, OPFV, estimates and optimizes future policy value in non-stationary bandit environments by leveraging recurring time features in historical logs.

Pith tools