中文
相关论文

相关论文: Balanced off-policy evaluation in general action s…

200 篇论文

Off-policy evaluation is a key component of reinforcement learning which evaluates a target policy with offline data collected from behavior policies. It is a crucial step towards safe reinforcement learning and has been used in…

机器学习 · 计算机科学 2020-12-01 Jinlin Lai , Lixin Zou , Jiaxing Song

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…

机器学习 · 计算机科学 2020-07-29 Andrew Bennett , Nathan Kallus , Lihong Li , Ali Mousavi

We consider the problem of off-policy evaluation in Markov decision processes. Off-policy evaluation is the task of evaluating the expected return of one policy with data generated by a different, behavior policy. Importance sampling is a…

机器学习 · 计算机科学 2019-05-13 Josiah P. Hanna , Scott Niekum , Peter Stone

Matching users based on mutual preferences is a fundamental aspect of services driven by reciprocal recommendations, such as job search and dating applications. Although A/B tests remain the gold standard for evaluating new policies in…

机器学习 · 计算机科学 2025-07-21 Yudai Hayashi , Shuhei Goda , Yuta Saito

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…

机器学习 · 计算机科学 2021-03-11 Yihao Feng , Ziyang Tang , Na Zhang , 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…

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…

机器学习 · 计算机科学 2024-11-12 Nicolò Felicioni , Michael Benigni , Maurizio Ferrari Dacrema

Evaluating novel contextual bandit policies using logged data is crucial in applications where exploration is costly, such as medicine. But it usually relies on the assumption of no unobserved confounders, which is bound to fail in…

机器学习 · 统计学 2019-08-07 Andrew Bennett , Nathan Kallus

In many domains, the exploration process of reinforcement learning will be too costly as it requires trying out suboptimal policies, resulting in a need for off-policy evaluation, in which a target policy is evaluated based on data…

机器学习 · 计算机科学 2024-05-07 David M. Bossens , Philip S. Thomas

Off-policy evaluation (OPE) is the method that attempts to estimate the performance of decision making policies using historical data generated by different policies without conducting costly online A/B tests. Accurate OPE is essential in…

人工智能 · 计算机科学 2021-09-20 Yuta Saito , Takuma Udagawa , Kei Tateno

Off-policy evaluation (OPE) attempts to predict the performance of counterfactual policies using log data from a different policy. We extend its applicability by developing an OPE method for a class of both full support and deficient…

机器学习 · 计算机科学 2022-12-06 Yusuke Narita , Kyohei Okumura , Akihiro Shimizu , Kohei Yata

We consider the off-policy evaluation (OPE) problem in contextual bandits, where the goal is to estimate the value of a target policy using the data collected by a logging policy. Most popular approaches to the OPE are variants of the…

机器学习 · 统计学 2024-08-20 Sutanoy Dasgupta , Yabo Niu , Kishan Panaganti , Dileep Kalathil , Debdeep Pati , Bani Mallick

Off-policy evaluation (OPE) is a critical challenge in robust decision-making that seeks to assess the performance of a new policy using data collected under a different policy. However, the existing OPE methodologies suffer from several…

机器学习 · 统计学 2025-02-11 Muhammad Faaiz Taufiq

We study the problem of off-policy policy evaluation (OPPE) in RL. In contrast to prior work, we consider how to estimate both the individual policy value and average policy value accurately. We draw inspiration from recent work in causal…

Offline policy learning aims to use historical data to learn an optimal personalized decision rule. In the standard estimate-then-optimize framework, reweighting-based methods (e.g., inverse propensity weighting or doubly robust estimators)…

最优化与控制 · 数学 2026-01-21 Jingren Liu , Hanzhang Qin , Junyi Liu , Mabel C. Chou , Jong-Shi Pang

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…

机器学习 · 计算机科学 2020-08-18 Yihao Feng , Tongzheng Ren , Ziyang Tang , Qiang Liu

We consider the problem of off-policy evaluation (OPE) in reinforcement learning (RL), where the goal is to estimate the performance of an evaluation policy, $\pi_e$, using a fixed dataset, $\mathcal{D}$, collected by one or more policies…

机器学习 · 计算机科学 2022-12-16 Brahma S. Pavse , Josiah P. Hanna

Many sequential decision making problems are high-stakes and require off-policy evaluation (OPE) of a new policy using historical data collected using some other policy. One of the most common OPE techniques that provides unbiased estimates…

机器学习 · 计算机科学 2021-12-06 Christina J. Yuan , Yash Chandak , Stephen Giguere , Philip S. Thomas , Scott Niekum

We consider off-policy evaluation (OPE) in contextual bandits with finite action space. Inverse Propensity Score (IPS) weighting is a widely used method for OPE due to its unbiased, but it suffers from significant variance when the action…

机器学习 · 计算机科学 2025-10-15 Kushagra Chandak , Vincent Liu , Haanvid Lee

In this work, we consider the problem of model selection for deep reinforcement learning (RL) in real-world environments. Typically, the performance of deep RL algorithms is evaluated via on-policy interactions with the target environment.…

机器学习 · 计算机科学 2019-11-26 Alex Irpan , Kanishka Rao , Konstantinos Bousmalis , Chris Harris , Julian Ibarz , Sergey Levine