中文
相关论文

相关论文: Bandit Learning with Delayed Impact of Actions

200 篇论文

We consider the correlated multiarmed bandit (MAB) problem in which the rewards associated with each arm are modeled by a multivariate Gaussian random variable, and we investigate the influence of the assumptions in the Bayesian prior on…

最优化与控制 · 数学 2015-07-09 Vaibhav Srivastava , Paul Reverdy , Naomi Ehrich Leonard

We extend the classic multi-armed bandit (MAB) model to the setting of noncompliance, where the arm pull is a mere instrument and the treatment applied may differ from it, which gives rise to the instrument-armed bandit (IAB) problem. The…

机器学习 · 统计学 2017-05-23 Nathan Kallus

We study the multi-armed bandit problem with adversarially chosen delays in the Best-of-Both-Worlds (BoBW) framework, which aims to achieve near-optimal performance in both stochastic and adversarial environments. While prior work has made…

机器学习 · 计算机科学 2025-10-21 Ofir Schlisselberg , Tal Lancewicki , Peter Auer , Yishay Mansour

Decision-making problems of sequential nature, where decisions made in the past may have an impact on the future, are used to model many practically important applications. In some real-world applications, feedback about a decision is…

机器学习 · 计算机科学 2023-03-02 Ronald C. van den Broek , Rik Litjens , Tobias Sagis , Luc Siecker , Nina Verbeeke , Pratik Gajane

We study the effect of persistence of engagement on learning in a stochastic multi-armed bandit setting. In advertising and recommendation systems, repetition effect includes a wear-in period, where the user's propensity to reward the…

机器学习 · 计算机科学 2020-06-19 Priyank Agrawal , Theja Tulabandhula

The Multi-Armed Bandits (MAB) framework highlights the tension between acquiring new knowledge (Exploration) and leveraging available knowledge (Exploitation). In the classical MAB problem, a decision maker must choose an arm at each time…

机器学习 · 统计学 2017-11-03 Nir Levine , Koby Crammer , Shie Mannor

While significant progress has been made in designing algorithms that minimize regret in online decision-making, real-world scenarios often introduce additional complexities, perhaps the most challenging of which is missing outcomes.…

机器学习 · 统计学 2024-11-11 Ilia Mahrooghi , Mahshad Moradi , Sina Akbari , Negar Kiyavash

We study the Improving Multi-Armed Bandit (IMAB) problem, where the reward obtained from an arm increases with the number of pulls it receives. This model provides an elegant abstraction for many real-world problems in domains such as…

机器学习 · 计算机科学 2022-08-22 Vishakha Patil , Vineet Nair , Ganesh Ghalme , Arindam Khan

Machine Learning (ML) increasingly informs the allocation of opportunities to individuals and communities in areas such as lending, education, employment, and beyond. Such decisions often impact their subjects' future characteristics and…

机器学习 · 计算机科学 2021-06-03 David Lindner , Hoda Heidari , Andreas Krause

We study the stochastic multi-armed bandit (MAB) problem in the presence of side-observations across actions that occur as a result of an underlying network structure. In our model, a bipartite graph captures the relationship between…

机器学习 · 计算机科学 2017-07-14 Swapna Buccapatnam , Fang Liu , Atilla Eryilmaz , Ness B. Shroff

This paper considers the multi-armed bandit (MAB) problem and provides a new best-of-both-worlds (BOBW) algorithm that works nearly optimally in both stochastic and adversarial settings. In stochastic settings, some existing BOBW algorithms…

机器学习 · 计算机科学 2022-06-15 Shinji Ito , Taira Tsuchiya , Junya Honda

The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently as a decentralized multi-armed bandit (D-MAB) problem. In a…

机器学习 · 计算机科学 2011-04-04 Yi Gai , Bhaskar Krishnamachari

Motivated by models of human decision making proposed to explain commonly observed deviations from conventional expected value preferences, we formulate two stochastic multi-armed bandit problems with distorted probabilities on the reward…

机器学习 · 计算机科学 2023-11-01 Ravi Kumar Kolla , Prashanth L. A. , Aditya Gopalan , Krishna Jagannathan , Michael Fu , Steve Marcus

We study a $K$-armed bandit with delayed feedback and intermediate observations. We consider a model where intermediate observations have a form of a finite state, which is observed immediately after taking an action, whereas the loss is…

Experimentation with interference poses a significant challenge in contemporary online platforms. Prior research on experimentation with interference has concentrated on the final output of a policy. The cumulative performance, while…

机器学习 · 计算机科学 2024-07-17 Su Jia , Peter Frazier , Nathan Kallus

Online experimentation with interference is a common challenge in modern applications such as e-commerce and adaptive clinical trials in medicine. For example, in online marketplaces, the revenue of a good depends on discounts applied to…

机器学习 · 计算机科学 2024-05-30 Abhineet Agarwal , Anish Agarwal , Lorenzo Masoero , Justin Whitehouse

Motivated by the fact that humans like some level of unpredictability or novelty, and might therefore get quickly bored when interacting with a stationary policy, we introduce a novel non-stationary bandit problem, where the expected reward…

机器学习 · 计算机科学 2022-03-08 Pierre Laforgue , Giulia Clerici , Nicolò Cesa-Bianchi , Ran Gilad-Bachrach

In this paper, we investigate the impact of diverse user preference on learning under the stochastic multi-armed bandit (MAB) framework. We aim to show that when the user preferences are sufficiently diverse and each arm can be optimal for…

机器学习 · 计算机科学 2022-11-11 Chao Gan , Jing Yang , Ruida Zhou , Cong Shen

In this paper, we study the multi-objective bandits (MOB) problem, where a learner repeatedly selects one arm to play and then receives a reward vector consisting of multiple objectives. MOB has found many real-world applications as varied…

机器学习 · 计算机科学 2019-05-31 Shiyin Lu , Guanghui Wang , Yao Hu , Lijun Zhang

We study a decentralized cooperative stochastic multi-armed bandit problem with $K$ arms on a network of $N$ agents. In our model, the reward distribution of each arm is the same for each agent and rewards are drawn independently across…

机器学习 · 计算机科学 2019-10-25 David Martínez-Rubio , Varun Kanade , Patrick Rebeschini