中文
相关论文

相关论文: Contextual Bandits for Evaluating and Improving In…

200 篇论文

Policy learning using historical observational data is an important problem that has found widespread applications. Examples include selecting offers, prices, advertisements to send to customers, as well as selecting which medication to…

机器学习 · 计算机科学 2023-09-13 Nian Si , Fan Zhang , Zhengyuan Zhou , Jose Blanchet

Modifying the reward-biased maximum likelihood method originally proposed in the adaptive control literature, we propose novel learning algorithms to handle the explore-exploit trade-off in linear bandits problems as well as generalized…

机器学习 · 计算机科学 2020-10-09 Yu-Heng Hung , Ping-Chun Hsieh , Xi Liu , P. R. Kumar

We study the problem of using causal models to improve the rate at which good interventions can be learned online in a stochastic environment. Our formalism combines multi-arm bandits and causal inference to model a novel type of bandit…

机器学习 · 统计学 2016-06-13 Finnian Lattimore , Tor Lattimore , Mark D. Reid

The standard contextual bandit framework assumes fully observable and actionable contexts. In this work, we consider a new bandit setting with partially observable, correlated contexts and linear payoffs, motivated by the applications in…

机器学习 · 计算机科学 2024-09-19 Sihan Zeng , Sujay Bhatt , Alec Koppel , Sumitra Ganesh

We consider an online decision making setting known as contextual bandit problem, and propose an approach for improving contextual bandit performance by using an adaptive feature extraction (representation learning) based on online…

人工智能 · 计算机科学 2020-09-15 Baihan Lin , Djallel Bouneffouf , Guillermo Cecchi , Irina Rish

With the proliferation of electric vehicles, the electrical distribution grids are more prone to overloads. In this paper, we study an intelligent pricing and power control mechanism based on contextual bandits to provide incentives for…

其他计算机科学 · 计算机科学 2019-05-06 Christian Römer , Johannes Hiry , Chris Kittl , Thomas Liebig , Christian Rehtanz

Contextual bandits constitute a classical framework for decision-making under uncertainty. In this setting, the goal is to learn the arms of highest reward subject to contextual information, while the unknown reward parameters of each arm…

机器学习 · 统计学 2024-02-19 Hongju Park , Mohamad Kazem Shirani Faradonbeh

We consider a contextual version of multi-armed bandit problem with global knapsack constraints. In each round, the outcome of pulling an arm is a scalar reward and a resource consumption vector, both dependent on the context, and the…

机器学习 · 计算机科学 2016-07-12 Shipra Agrawal , Nikhil R. Devanur , Lihong Li

We consider a novel formulation of the multi-armed bandit model, which we call the contextual bandit with restricted context, where only a limited number of features can be accessed by the learner at every iteration. This novel formulation…

人工智能 · 计算机科学 2017-06-09 Djallel Bouneffouf , Irina Rish , Guillermo A. Cecchi , Raphael Feraud

We consider the problem of learning to choose actions using contextual information when provided with limited feedback in the form of relative pairwise comparisons. We study this problem in the dueling-bandits framework of Yue et al.…

机器学习 · 计算机科学 2015-06-16 Miroslav Dudík , Katja Hofmann , Robert E. Schapire , Aleksandrs Slivkins , Masrour Zoghi

Causal knowledge can be used to support decision-making problems. This has been recognized in the causal bandits literature, where a causal (multi-armed) bandit is characterized by a causal graphical model and a target variable. The arms…

机器学习 · 计算机科学 2025-10-14 Francisco N. F. Q. Simoes , Itai Feigenbaum , Mehdi Dastani , Thijs van Ommen

We develop confidence bounds that hold uniformly over time for off-policy evaluation in the contextual bandit setting. These confidence sequences are based on recent ideas from martingale analysis and are non-asymptotic, non-parametric, and…

机器学习 · 计算机科学 2021-02-19 Nikos Karampatziakis , Paul Mineiro , Aaditya Ramdas

In the stochastic contextual bandit setting, regret-minimizing algorithms have been extensively researched, but their instance-minimizing best-arm identification counterparts remain seldom studied. In this work, we focus on the stochastic…

机器学习 · 统计学 2023-10-04 Zhaoqi Li , Lillian Ratliff , Houssam Nassif , Kevin Jamieson , Lalit Jain

Most off-policy evaluation methods for contextual bandits have focused on the expected outcome of a policy, which is estimated via methods that at best provide only asymptotic guarantees. However, in many applications, the expectation may…

机器学习 · 统计学 2022-10-27 Muhammad Faaiz Taufiq , Jean-Francois Ton , Rob Cornish , Yee Whye Teh , Arnaud Doucet

Psychological research shows that enjoyment of many goods is subject to satiation, with short-term satisfaction declining after repeated exposures to the same item. Nevertheless, proposed algorithms for powering recommender systems seldom…

机器学习 · 计算机科学 2021-10-28 Liu Leqi , Fatma Kilinc-Karzan , Zachary C. Lipton , Alan L. Montgomery

Prediction interval (PI) is an effective tool to quantify uncertainty and usually serves as an input to downstream robust optimization. Traditional approaches focus on improving the quality of PI in the view of statistical scores and assume…

系统与控制 · 电气工程与系统科学 2023-11-30 Yufan Zhang , Honglin Wen , Qiuwei Wu

Standard approaches to decision-making under uncertainty focus on sequential exploration of the space of decisions. However, \textit{simultaneously} proposing a batch of decisions, which leverages available resources for parallel…

The paper [12] examines a concept of equilibrium policies instead of optimal controls in stochastic optimization to analyze a mean-variance portfolio selection problem. We follow the same approach in order to investigate the Merton…

最优化与控制 · 数学 2020-04-23 I. Alia , F. Chighoub , N. Khelfallah , J. Vives

Inventory management problems with periodic and controllable resets occur in the context of managing water storage in the developing world and retailing limited-time availability products. In this paper, we consider a set of sequential…

最优化与控制 · 数学 2022-09-09 Yoon Lee , Yonatan Mintz , Anil Aswani , Zuo-Jun Max Shen , Cong Yang

We consider a bandit problem which involves sequential sampling from two populations (arms). Each arm produces a noisy reward realization which depends on an observable random covariate. The goal is to maximize cumulative expected reward.…

统计理论 · 数学 2010-03-09 Philippe Rigollet , Assaf Zeevi