中文
相关论文

相关论文: Decision-Focused Evaluation: Analyzing Performance…

200 篇论文

Standard Multi-Armed Bandit (MAB) problems assume that the arms are independent. However, in many application scenarios, the information obtained by playing an arm provides information about the remainder of the arms. Hence, in such…

机器学习 · 计算机科学 2014-10-30 Onur Atan , Cem Tekin , Mihaela van der Schaar

Multi-armed bandit models have proven to be useful in modeling many real world problems in the areas of control and sequential decision making with partial information. However, in many scenarios, such as those prevalent in healthcare and…

最优化与控制 · 数学 2024-08-27 Qinyang He , Yonatan Mintz

The stochastic multi-armed bandit (MAB) problem is a common model for sequential decision problems. In the standard setup, a decision maker has to choose at every instant between several competing arms, each of them provides a scalar random…

机器学习 · 统计学 2021-10-27 Asaf Cassel , Shie Mannor , Assaf Zeevi

Multi-armed bandit problems (MABPs) are a special type of optimal control problem well suited to model resource allocation under uncertainty in a wide variety of contexts. Since the first publication of the optimal solution of the classic…

统计方法学 · 统计学 2015-07-30 Sofía S. Villar , Jack Bowden , James Wason

This paper is in the field of stochastic Multi-Armed Bandits (MABs), i.e. those sequential selection techniques able to learn online using only the feedback given by the chosen option (a.k.a. $arm$). We study a particular case of the rested…

机器学习 · 统计学 2024-11-28 Marco Fiandri , Alberto Maria Metelli , Francesco Trov`o

We introduce Flickering Multi-Armed Bandits (FMAB) to model sequential decision-making in environments with changing action availability, where accessibility of the next action is restricted to a subset dependent on the agent's current…

机器学习 · 计算机科学 2026-04-28 Sourav Chakraborty , Amit Kiran Rege , Claire Monteleoni , Lijun Chen

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

In restless bandits, a central agent is tasked with optimally distributing limited resources across several bandits (arms), with each arm being a Markov decision process. In this work, we generalize the traditional restless bandits problem…

机器学习 · 计算机科学 2026-02-20 Nima Akbarzadeh , Yossiri Adulyasak , Erick Delage

The adoption of dynamic, self-learning solutions for real-time wireless network optimization has recently gained significant attention due to the limited adaptability of existing protocols. This paper investigates multi-armed bandit (MAB)…

Multi-armed bandits (MAB) provide a principled online learning approach to attain the balance between exploration and exploitation. Due to the superior performance and low feedback learning without the learning to act in multiple…

信息检索 · 计算机科学 2022-10-25 Shenghao Xu

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

The restless bandit problem is one of the most well-studied generalizations of the celebrated stochastic multi-armed bandit problem in decision theory. In its ultimate generality, the restless bandit problem is known to be PSPACE-Hard to…

数据结构与算法 · 计算机科学 2009-02-03 Sudipto Guha , Kamesh Munagala , Peng Shi

Setting up the future Internet of Things (IoT) networks will require to support more and more communicating devices. We prove that intelligent devices in unlicensed bands can use Multi-Armed Bandit (MAB) learning algorithms to improve…

网络与互联网体系结构 · 计算机科学 2018-07-03 Rémi Bonnefoi , Lilian Besson , Christophe Moy , Emilie Kaufmann , Jacques Palicot

Federated multi-armed bandits (FMAB) is a new bandit paradigm that parallels the federated learning (FL) framework in supervised learning. It is inspired by practical applications in cognitive radio and recommender systems, and enjoys…

机器学习 · 计算机科学 2021-03-04 Chengshuai Shi , Cong Shen

We extend Bayesian multi-armed bandit (MAB) algorithms beyond their original setting by making use of sequential Monte Carlo (SMC) methods. A MAB is a sequential decision making problem where the goal is to learn a policy that maximizes…

机器学习 · 统计学 2024-04-08 Iñigo Urteaga , Chris H. Wiggins

Early-phase clinical trials face the challenge of selecting optimal drug doses that balance safety and efficacy due to uncertain dose-response relationships and varied participant characteristics. Traditional randomized dose allocation…

统计方法学 · 统计学 2026-02-13 Rohit Kanrar , Chunlin Li , Zara Ghodsi , Margaret Gamalo

The contextual multi-armed bandit (MAB) is a widely used framework for problems requiring sequential decision-making under uncertainty, such as recommendation systems. In applications involving a large number of users, the performance of…

机器学习 · 计算机科学 2025-02-05 Zhiyong Wang , Jiahang Sun , Mingze Kong , Jize Xie , Qinghua Hu , John C. S. Lui , Zhongxiang Dai

We track moving targets with a distributed multiple-input multiple-output (MIMO) radar, for which the transmitters and receivers are appropriately paired and selected with a limited number of radar stations. We aim to maximize the sum of…

系统与控制 · 电气工程与系统科学 2023-06-19 Yuhang Hao , Zengfu Wang , Jing Fu , Xianglong Bai , Can Li , Quan Pan

This work studies a generalized class of restless multi-armed bandits with hidden states and allow cumulative feedback, as opposed to the conventional instantaneous feedback. We call them lazy restless bandits (LRB) as the events of…

系统与控制 · 计算机科学 2019-01-30 Kesav Kaza , Rahul Meshram , Varun Mehta , S. N. Merchant

Scientific experimentation is largely driven by statistical hypothesis testing to determine significant differences in interventions. Traditionally, experimenters allocate samples uniformly between each intervention. However, such an…