English
Related papers

Related papers: Control Variates for Slate Off-Policy Evaluation

200 papers

For a real-world decision-making problem, the reward function often needs to be engineered or learned. A popular approach is to utilize human feedback to learn a reward function for training. The most straightforward way to do so is to ask…

Machine Learning · Computer Science 2023-10-31 Xiang Ji , Huazheng Wang , Minshuo Chen , Tuo Zhao , Mengdi Wang

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

Offline policy improvement faces an inherent conflict between maximizing value and fitting the data distribution. While in-sample weighted regression is stable, it suffers from over-conservatism that suppresses high-value actions in the…

Machine Learning · Computer Science 2026-05-28 Jiaxin Zhao , Weihang Pan , Xun Liang , Binbin Lin

We consider the problem of learning personalized decision policies from observational bandit feedback data across multiple heterogeneous data sources. In our approach, we introduce a novel regret analysis that establishes finite-sample…

Machine Learning · Computer Science 2024-10-14 Aldo Gael Carranza , Susan Athey

We consider a combinatorial multi-armed bandit problem for maximum value reward function under maximum value and index feedback. This is a new feedback structure that lies in between commonly studied semi-bandit and full-bandit feedback…

Machine Learning · Computer Science 2023-05-26 Yiliu Wang , Wei Chen , Milan Vojnović

Contextual bandits have become an increasingly popular solution for personalized recommender systems. Despite their growing use, the interpretability of these systems remains a significant challenge, particularly for the often non-expert…

Machine Learning · Computer Science 2024-09-24 Andrew Maher , Matia Gobbo , Lancelot Lachartre , Subash Prabanantham , Rowan Swiers , Puli Liyanagama

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

Learning in multi-player games can model a large variety of practical scenarios, where each player seeks to optimize its own local objective function, which at the same time relies on the actions taken by others. Motivated by the frequent…

Optimization and Control · Mathematics 2023-09-08 Yuanhanqing Huang , Jianghai Hu

Uniform random exploration in decision-making systems supports off-policy learning via supervision but incurs high regret, making it impractical for many applications. Conversely, non-uniform exploration offers better immediate performance…

Machine Learning · Computer Science 2025-07-11 Akhila Vangara , Alex Egg

Off-policy evaluation is critical in a number of applications where new policies need to be evaluated offline before online deployment. Most existing methods focus on the expected return, define the target parameter through averaging and…

Machine Learning · Statistics 2023-02-10 Yingying Zhang , Chengchun Shi , Shikai Luo

Off-policy evaluation and learning in contextual bandits use logged interaction data to estimate and optimize the value of a target policy. Most existing methods require sufficient action overlap between the logging and target policies, and…

Machine Learning · Statistics 2026-02-03 Shu Tamano

We consider a multi-armed bandit problem in a setting where each arm produces a noisy reward realization which depends on an observable random covariate. As opposed to the traditional static multi-armed bandit problem, this setting allows…

Statistics Theory · Mathematics 2013-05-27 Vianney Perchet , Philippe Rigollet

Off-policy evaluation (OPE) estimates the value of a contextual bandit policy prior to deployment. As such, OPE plays a critical role in ensuring safety in high-stakes domains such as healthcare. However, standard OPE approaches are limited…

Machine Learning · Computer Science 2025-11-25 Aishwarya Mandyam , Kalyani Limaye , Barbara E. Engelhardt , Emily Alsentzer

We study contextual bandits in the stochastic i.i.d.\ setting, where a learner observes contexts drawn from an unknown distribution, selects actions from a finite set $A$, and aims to identify an approximately optimal policy from a given…

Machine Learning · Computer Science 2026-05-29 Liad Erez , Fan Chen , Alon Cohen , Tomer Koren , Yishay Mansour , Shay Moran , Alexander Rakhlin

Off-policy learning (OPL) in contextual bandits aims to learn a decision-making policy that maximizes the target rewards by using only historical interaction data collected under previously developed policies. Unfortunately, when rewards…

Machine Learning · Computer Science 2025-06-18 Rikiya Takehi , Masahiro Asami , Kosuke Kawakami , Yuta Saito

An extension of the traditional two-armed bandit problem is considered, in which the decision maker has access to some side information before deciding which arm to pull. At each time t, before making a selection, the decision maker is able…

Information Theory · Computer Science 2007-07-16 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

Contextual bandits are widely-used in the study of learning-based control policies for finite action spaces. While the problem is well-studied for bandits with perfectly observed context vectors, little is known about the case of…

Machine Learning · Statistics 2022-02-03 Hongju Park , Mohamad Kazem Shirani Faradonbeh

Off-policy evaluation provides an essential tool for evaluating the effects of different policies or treatments using only observed data. When applied to high-stakes scenarios such as medical diagnosis or financial decision-making, it is…

Machine Learning · Computer Science 2020-10-30 Ziyang Tang , Yihao Feng , Na Zhang , Jian Peng , Qiang Liu

Contextual bandits with average-case statistical guarantees are inadequate in risk-averse situations because they might trade off degraded worst-case behaviour for better average performance. Designing a risk-averse contextual bandit is…

Machine Learning · Statistics 2023-07-11 Mónika Farsang , Paul Mineiro , Wangda Zhang

In production systems, contextual bandit approaches often rely on direct reward models that take both action and context as input. However, these models can suffer from confounding, making it difficult to isolate the effect of the action…

Machine Learning · Computer Science 2025-09-16 Alexandre Gilotte , Otmane Sakhi , Imad Aouali , Benjamin Heymann