中文
相关论文

相关论文: Communication-Efficient Collaborative Best Arm Ide…

200 篇论文

Remote education has proliferated in the twenty-first century, yielding rise to intelligent tutoring systems. In particular, research has found multi-armed bandit (MAB) intelligent tutors to have notable abilities in traversing the…

计算机与社会 · 计算机科学 2024-08-15 Blake Castleman , Uzay Macar , Ansaf Salleb-Aouissi

We examine a multi-armed bandit problem with contextual information, where the objective is to ensure that each arm receives a minimum aggregated reward across contexts while simultaneously maximizing the total cumulative reward. This…

机器学习 · 计算机科学 2025-10-15 Ahmed Ben Yahmed , Hafedh El Ferchichi , Marc Abeille , Vianney Perchet

The multi-armed bandit (MAB) problem models a decision-maker that optimizes its actions based on current and acquired new knowledge to maximize its reward. This type of online decision is prominent in many procedures of Brain-Computer…

人工智能 · 计算机科学 2022-11-10 Frida Heskebeck , Carolina Bergeling , Bo Bernhardsson

We investigate the problem of batched best arm identification in multi-armed bandits, where we aim to identify the best arm from a set of $n$ arms while minimizing both the number of samples and batches. We introduce an algorithm that…

机器学习 · 计算机科学 2025-01-30 Tianyuan Jin , Qin Zhang , Dongruo Zhou

We study the evolution of information in interactive decision making through the lens of a stochastic multi-armed bandit problem. Focusing on a fundamental example where a unique optimal arm outperforms the rest by a fixed margin, we…

机器学习 · 统计学 2025-10-23 Yuzhou Gu , Yanjun Han , Jian Qian

The 1-identification problem is a fundamental pure-exploration problem in multi-armed bandits. An agent aims to determine whether there exists an arm whose mean reward exceeds a known threshold $\mu_0$, or to output \textsf{None} otherwise.…

机器学习 · 计算机科学 2026-05-15 Zitian Li , Wang Chi Cheung

Stochastic multi-armed bandits are a sequential-decision-making framework, where, at each interaction step, the learner selects an arm and observes a stochastic reward. Within the context of best-arm identification (BAI) problems, the goal…

机器学习 · 计算机科学 2024-01-15 Riccardo Poiani , Alberto Maria Metelli , Marcello Restelli

This paper investigates the problem of best arm identification in $\textit{contaminated}$ stochastic multi-arm bandits. In this setting, the rewards obtained from any arm are replaced by samples from an adversarial model with probability…

机器学习 · 计算机科学 2021-11-16 Arpan Mukherjee , Ali Tajer , Pin-Yu Chen , Payel Das

This paper investigates a hitherto unaddressed aspect of best arm identification (BAI) in stochastic multi-armed bandits in the fixed-confidence setting. Two key metrics for assessing bandit algorithms are computational efficiency and…

机器学习 · 统计学 2023-06-26 Arpan Mukherjee , Ali Tajer

The staggering feats of AI systems have brought to attention the topic of AI Alignment: aligning a "superintelligent" AI agent's actions with humanity's interests. Many existing frameworks/algorithms in alignment study the problem on a…

机器学习 · 计算机科学 2024-10-22 Hong Jun Jeon , Benjamin Van Roy

Multi-agent reinforcement learning (MARL) problems are challenging due to information asymmetry. To overcome this challenge, existing methods often require high level of coordination or communication between the agents. We consider…

机器学习 · 计算机科学 2021-11-02 Hsu Kao , Chen-Yu Wei , Vijay Subramanian

We consider the combinatorial bandits problem with semi-bandit feedback under finite sampling budget constraints, in which the learner can carry out its action only for a limited number of times specified by an overall budget. The action is…

机器学习 · 计算机科学 2022-10-17 Jasmin Brandt , Viktor Bengs , Björn Haddenhorst , Eyke Hüllermeier

We address the M-best-arm identification problem in multi-armed bandits. A player has a limited budget to explore K arms (M<K), and once pulled, each arm yields a reward drawn (independently) from a fixed, unknown distribution. The goal is…

机器学习 · 统计学 2017-07-11 Shahin Shahrampour , Vahid Tarokh

We study the explore-exploit tradeoff in distributed cooperative decision-making using the context of the multiarmed bandit (MAB) problem. For the distributed cooperative MAB problem, we design the cooperative UCB algorithm that comprises…

系统与控制 · 计算机科学 2019-09-17 Peter Landgren , Vaibhav Srivastava , Naomi Ehrich Leonard

Motivated by cognitive radio networks, we consider the stochastic multiplayer multi-armed bandit problem, where several players pull arms simultaneously and collisions occur if one of them is pulled by several players at the same stage. We…

机器学习 · 计算机科学 2019-11-20 Etienne Boursier , Vianney Perchet

We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual learns the best option if eventually (as $t\to \infty$) it…

分布式、并行与集群计算 · 计算机科学 2018-12-27 Lili Su , Martin Zubeldia , Nancy Lynch

In machine learning, the notion of multi-armed bandits refers to a class of online learning problems, in which an agent is supposed to simultaneously explore and exploit a given set of choice alternatives in the course of a sequential…

机器学习 · 计算机科学 2021-07-13 Viktor Bengs , Robert Busa-Fekete , Adil El Mesaoudi-Paul , Eyke Hüllermeier

Beam alignment (BA) is to ensure the transmitter and receiver beams are accurately aligned to establish a reliable communication link in millimeter-wave (mmwave) systems. Existing BA methods search the entire beam space to identify the…

信号处理 · 电气工程与系统科学 2019-09-10 Wen Wu , Nan Cheng , Ning Zhang , Peng Yang , Weihua Zhuang , Xuemin , Shen

Motivated by real-world applications that necessitate responsible experimentation, we introduce the problem of best arm identification (BAI) with minimal regret. This innovative variant of the multi-armed bandit problem elegantly…

机器学习 · 计算机科学 2024-09-30 Junwen Yang , Vincent Y. F. Tan , Tianyuan Jin

We consider the problem of robust multi-agent reinforcement learning (MARL) for cooperative communication and coordination tasks. MARL agents, mainly those trained in a centralized way, can be brittle because they can adopt policies that…

多智能体系统 · 计算机科学 2020-12-16 T. van der Heiden , C. Salge , E. Gavves , H. van Hoof