paper-with-me

홈 › Papers

Trading off rewards and errors in multi-armed bandits

2026-05-01 · Akram Erraqabi, Alessandro Lazaric, Michal Valko, Emma Brunskill, Yun-En Liu arxiv

In multi-armed bandits, the most-explored arms are the most informative, while reward maximization typically pulls only the best arm. We study the tradeoff between identifying arm means accurately and accumulating reward, and present an algorithm with regret guarantees that interpolates between the two objectives. We provide both upper and lower bounds and validate empirically.

📄 PDF Abstract BibTeX arXiv:2605.00488

Code (0)

등록된 구현이 없습니다.

Tasks

Multi-Armed Bandits

Similar Papers 제목 키워드 기반

Stochastic Multi-armed Bandits with Non-stationary Rewards Generated by a Linear Dynamical System

2022-04-06 · Jonathan Gornet, Mehdi Hosseinzadeh, Bruno Sinopoli

The stochastic multi-armed bandit has provided a framework for studying decision-making in unknown environments. We propose a variant of the stochastic multi-armed bandit where the rewards are sampled from a stochastic l…

Decision MakingMulti-Armed Bandits

Global Rewards in Restless Multi-Armed Bandits

2024-06-02 · Naveen Raman, Zheyuan Ryan Shi, Fei Fang

Restless multi-armed bandits (RMAB) extend multi-armed bandits so pulling an arm impacts future states. Despite the success of RMABs, a key limiting assumption is the separability of rewards into a sum across arms. We ad…

Multi-Armed Bandits

Survival Multiarmed Bandits with Bootstrapping Methods

2024-10-21 · Peter Veroutis, Frédéric Godin

The Multiarmed Bandits (MAB) problem has been extensively studied and has seen many practical applications in a variety of fields. The Survival Multiarmed Bandits (S-MAB) open problem is an extension which constrains an …

Residual Bootstrap Exploration for Bandit Algorithms

2020-02-19 · Chi-Hua Wang, Yang Yu, Botao Hao, Guang Cheng

In this paper, we propose a novel perturbation-based exploration method in bandit algorithms with bounded or unbounded rewards, called residual bootstrap exploration (\texttt{ReBoot}). The \texttt{ReBoot} enforces explor…

Computational EfficiencyMulti-Armed BanditsThompson Sampling

Indexability of Finite State Restless Multi-Armed Bandit and Rollout Policy

2023-04-30 · Vishesh Mittal, Rahul Meshram, Deepak Dev, Surya Prakash

We consider finite state restless multi-armed bandit problem. The decision maker can act on M bandits out of N bandits in each time step. The play of arm (active arm) yields state dependent rewards based on action and wh…