Browse State-of-the-Art › Off-policy evaluation
Off-policy evaluation
102 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Off-policy Evaluation (OPE), or offline evaluation in general, evaluates the performance of hypothetical policies leveraging only offline log data. It is particularly useful in applications where the online interaction involves high stakes and expensive setting such as precision medicine and recommender systems.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
30 shown of 102 papers with code (265 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
17 Aug 2020 4 repositories listed Syntology ran 1 of 3 samples · 2 unverifiedOur dataset is unique in that it contains a set of multiple logged bandit datasets collected by running different policies on the same platform.
-
13 Feb 2022 3 repositories listed Syntology ran 1 of 3 samples · 2 unverifiedUnfortunately, when the number of actions is large, existing OPE estimators -- most of which are based on inverse propensity score weighting -- degrade severely and can suffer from extreme bias and variance.
-
30 Mar 2021 3 repositories listed Syntology ran 3 of 3 samples · 0 unverified · 3 pointer-only (licence)Off-policy evaluation (OPE) holds the promise of being able to leverage large, offline datasets for both evaluating and selecting complex policies for decision making.
-
4 Dec 2016 3 repositories listedWe study the off-policy evaluation problem---estimating the value of a target policy using data collected by another policy---under the contextual bandit model.
-
24 Feb 2023 2 repositories listedWe consider a personalized pricing problem in which we have data consisting of feature information, historical pricing decisions, and binary realized demand.
-
3 Feb 2022 2 repositories listedWe show that the proposed estimator is unbiased in more cases compared to existing estimators that make stronger assumptions.
-
31 Aug 2021 2 repositories listed Syntology ran 0 of 1 samples · 1 unverifiedUnfortunately, identifying a reliable estimator from results reported in research papers is often difficult because the current experimental procedure evaluates and compares the estimators' performance on a narrow set…
-
8 Jun 2021 2 repositories listedTraining models that perform well under distribution shifts is a central challenge in machine learning.
-
18 Jun 2020 2 repositories listed Syntology ran 0 of 5 samples · 5 unverifiedWe consider off-policy evaluation in the contextual bandit setting for the purpose of obtaining a robust off-policy selection strategy, where the selection strategy is evaluated based on the value of the chosen policy…
-
9 Jun 2019 2 repositories listedWe propose new estimators for OPE based on empirical likelihood that are always more efficient than IS, SNIS, and DR and satisfy the same stability and boundedness properties as SNIS.
-
2 May 2025 1 repository listedOff-policy evaluation (OPE) and off-policy learning (OPL) for contextual bandit policies leverage historical data to evaluate and optimize a target policy.
-
3 Feb 2025 1 repository listedHeterogeneity in sensors and actuators across environments poses a significant challenge to building large-scale pre-trained world models on top of this low-dimensional sensor information.
-
8 Dec 2024 1 repository listed Syntology ran 0 of 4 samples · 4 unverified · 4 pointer-only (licence)This paper studies off-policy evaluation (OPE) in the presence of unmeasured confounders.
-
31 Oct 2024 1 repository listedWe propose a novel linear bandit algorithm called LinMED (Linear Minimum Empirical Divergence), which is a linear extension of the MED algorithm that was originally designed for multi-armed bandits.
-
3 Oct 2024 1 repository listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)Evaluating policies using off-policy data is crucial for applying reinforcement learning to real-world problems such as healthcare and autonomous driving.
-
25 Jul 2024 1 repository listedOff-policy evaluation (OPE) is widely applied in sectors such as pharmaceuticals and e-commerce to evaluate the efficacy of novel products or policies from offline datasets.
-
27 Jun 2024 1 repository listedOff-policy evaluation (OPE) is crucial for assessing a target policy's impact offline before its deployment.
-
29 May 2024 1 repository listed Syntology ran 5 of 8 samples · 3 unverified · 1 pointer-only (licence)To address this limitation, we propose to relax the deterministic target policy using a kernel and learn the kernel metrics that minimize the overall mean squared error of the estimated temporal difference update vector…
-
24 May 2024 1 repository listedWe study estimator selection and hyper-parameter tuning in off-policy evaluation.
-
23 May 2024 1 repository listed Syntology ran 1 of 2 samples · 1 unverified · 2 pointer-only (licence)This work investigates the offline formulation of the contextual bandit problem, where the goal is to leverage past interactions collected under a behavior policy to evaluate, select, and learn new, potentially…
-
24 Apr 2024 1 repository listedExisting approaches to this problem either need a restrictive assumption about the short-term outcomes called surrogacy or cannot effectively use short-term outcomes, which is inefficient.
-
1 Apr 2024 1 repository listed Syntology ran 3 of 4 samples · 1 unverified · 4 pointer-only (licence)However, it is challenging to compare predictive performance against an existing decision-making policy that is generally under-specified and dependent on unobservable factors.
-
29 Mar 2024 1 repository listed Syntology ran 0 of 3 samples · 3 unverified · 3 pointer-only (licence)We study the evaluation of a policy under best- and worst-case perturbations to a Markov decision process (MDP), using transition observations from the original MDP, whether they are generated under the same or a…
-
3 Feb 2024 1 repository listedThe PseudoInverse (PI) estimator has been introduced to mitigate the variance issue by assuming linearity in the reward function, but this can result in significant bias as this assumption is hard-to-verify from…
-
2 Feb 2024 1 repository listedIn contrast, we study the more manageable expectation-extended statistical distances and provide a novel theoretical justification on their validity for learning the return distribution.
-
11 Dec 2023 1 repository listedMobile health leverages personalized and contextually tailored interventions optimized through bandit and reinforcement learning algorithms.
-
3 Dec 2023 1 repository listed Syntology ran 2 of 2 samples · 0 unverified · 2 pointer-only (licence)Off-Policy Evaluation (OPE) in contextual bandits is crucial for assessing new policies using existing data without costly experimentation.
-
30 Nov 2023 1 repository listedExisting evaluation metrics for OPE estimators primarily focus on the "accuracy" of OPE or that of downstream policy selection, neglecting risk-return tradeoff in the subsequent online policy deployment.
-
30 Nov 2023 1 repository listedThis paper introduces SCOPE-RL, a comprehensive open-source Python software designed for offline reinforcement learning (offline RL), off-policy evaluation (OPE), and selection (OPS).
-
23 Nov 2023 1 repository listed Syntology ran 5 of 6 samples · 1 unverified · 6 pointer-only (licence)On the one hand, it brings opportunities for safe policy improvement under high-stakes scenarios like clinical guidelines.
Syntology lines on 13 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections