English
Related papers

Related papers: A Practical Guide of Off-Policy Evaluation for Ban…

200 papers

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…

Machine Learning · Statistics 2023-06-12 Yuta Saito , Qingyang Ren , Thorsten Joachims

We consider evaluating and training a new policy for the evaluation data by using the historical data obtained from a different policy. The goal of off-policy evaluation (OPE) is to estimate the expected reward of a new policy over the…

Machine Learning · Statistics 2020-10-19 Masahiro Kato , Masatoshi Uehara , Shota Yasui

This paper investigates off-policy evaluation in contextual bandits, aiming to quantify the performance of a target policy using data collected under a different and potentially unknown behavior policy. Recently, methods based on conformal…

Machine Learning · Statistics 2025-07-23 Yilong Wan , Yuqiang Li , Xianyi Wu

We offer an experimental benchmark and empirical study for off-policy policy evaluation (OPE) in reinforcement learning, which is a key problem in many safety critical applications. Given the increasing interest in deploying learning-based…

Machine Learning · Computer Science 2021-11-30 Cameron Voloshin , Hoang M. Le , Nan Jiang , Yisong Yue

Off-policy evaluation (OPE) aims to estimate the benefit of following a counterfactual sequence of actions, given data collected from executed sequences. However, existing OPE estimators often exhibit high bias and high variance in problems…

Machine Learning · Computer Science 2023-07-17 Aaman Rebello , Shengpu Tang , Jenna Wiens , Sonali Parbhoo

Counterfactual estimators are critical for learning and refining policies using logged data, a process known as Off-Policy Evaluation (OPE). OPE allows researchers to assess new policies without costly experiments, speeding up the…

Artificial Intelligence · Computer Science 2025-01-10 Ritam Guha , Nilavra Pathak

Off-policy evaluation (OPE) in reinforcement learning is an important problem in settings where experimentation is limited, such as education and healthcare. But, in these very same settings, observed actions are often confounded by…

Machine Learning · Computer Science 2020-07-29 Andrew Bennett , Nathan Kallus , Lihong Li , Ali Mousavi

Off-policy evaluation (OPE) is critical for applying contextual bandit algorithms to high-stakes decision-making settings such as healthcare, where new treatment policies must be evaluated prior to deployment. Unfortunately, OPE techniques…

Machine Learning · Computer Science 2026-05-28 Aishwarya Mandyam , Shengpu Tang , Jiayu Yao , Jenna Wiens , Barbara E. Engelhardt

We study the off-policy evaluation problem---estimating the value of a target policy using data collected by another policy---under the contextual bandit model. We consider the general (agnostic) setting without access to a consistent model…

Machine Learning · Statistics 2017-11-15 Yu-Xiang Wang , Alekh Agarwal , Miroslav Dudik

Off-Policy Evaluation (OPE) is employed to assess the potential impact of a hypothetical policy using logged contextual bandit feedback, which is crucial in areas such as personalized medicine and recommender systems, where online…

Machine Learning · Computer Science 2025-07-10 Yuqi Bai , Ziyu Zhao , Chenxin Lyu , Minqin Zhu , Kun Kuang

Evaluating a policy by deploying it in the real world can be risky and costly. Off-policy policy evaluation (OPE) algorithms use historical data collected from running a previous policy to evaluate a new policy, which provides a means for…

Artificial Intelligence · Computer Science 2017-12-07 Zhaohan Daniel Guo , Philip S. Thomas , Emma Brunskill

Assessing the effects of a policy based on observational data from a different policy is a common problem across several high-stake decision-making domains, and several off-policy evaluation (OPE) techniques have been proposed. However,…

Machine Learning · Computer Science 2022-01-21 Sonali Parbhoo , Shalmali Joshi , Finale Doshi-Velez

This paper addresses the problem of policy selection in domains with abundant logged data, but with a restricted interaction budget. Solving this problem would enable safe evaluation and deployment of offline reinforcement learning policies…

Off-policy evaluation (OPE) in both contextual bandits and reinforcement learning allows one to evaluate novel decision policies without needing to conduct exploration, which is often costly or otherwise infeasible. The problem's importance…

Machine Learning · Computer Science 2019-06-11 Nathan Kallus , Masatoshi Uehara

Off-policy evaluation (OPE) is the task of estimating the expected reward of a given policy based on offline data previously collected under different policies. Therefore, OPE is a key step in applying reinforcement learning to real-world…

Machine Learning · Computer Science 2021-03-11 Yihao Feng , Ziyang Tang , Na Zhang , Qiang Liu

We propose an estimator and confidence interval for computing the value of a policy from off-policy data in the contextual bandit setting. To this end we apply empirical likelihood techniques to formulate our estimator and confidence…

Machine Learning · Computer Science 2020-10-20 Nikos Karampatziakis , John Langford , Paul Mineiro

Off-policy evaluation (OPE) is important for closing the gap between offline training and evaluation of reinforcement learning (RL), by estimating performance and/or rank of target (evaluation) policies using offline trajectories only. It…

Machine Learning · Computer Science 2023-10-17 Qitong Gao , Ge Gao , Juncheng Dong , Vahid Tarokh , Min Chi , Miroslav Pajic

We consider off-policy evaluation (OPE), which evaluates the performance of a new policy from observed data collected from previous experiments, without requiring the execution of the new policy. This finds important applications in areas…

Machine Learning · Computer Science 2020-08-18 Yihao Feng , Tongzheng Ren , Ziyang Tang , Qiang Liu

Off-Policy Evaluation (OPE) is an important practical problem in algorithmic ranking systems, where the goal is to estimate the expected performance of a new ranking policy using only offline logged data collected under a different, logging…

We study the problem of off-policy evaluation for slate bandits, for the typical case in which the logging policy factorizes over the slots of the slate. We slightly depart from the existing literature by taking Bayes risk as the criterion…

Machine Learning · Computer Science 2021-01-08 Nikos Vlassis , Fernando Amat Gil , Ashok Chandrashekar