paper-with-me

홈 › Papers

Indexed Minimum Empirical Divergence for Unimodal Bandits

2021-12-02 · NeurIPS 2021 12 · Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard

We consider a multi-armed bandit problem specified by a set of one-dimensional family exponential distributions endowed with a unimodal structure. We introduce IMED-UB, a algorithm that optimally exploits the unimodal-structure, by adapting to this setting the Indexed Minimum Empirical Divergence (IMED) algorithm introduced by Honda and Takemura [2015]. Owing to our proof technique, we are able to provide a concise finite-time analysis of IMED-UB algorithm. Numerical experiments show that IMED-UB competes with the state-of-the-art algorithms.

📄 PDF Abstract BibTeX arXiv:2112.01452

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Forced-exploration free Strategies for Unimodal Bandits

2020-06-30 · Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard

We consider a multi-armed bandit problem specified by a set of Gaussian or Bernoulli distributions endowed with a unimodal structure. Although this problem has been addressed in the literature (Combes and Proutiere, 2014…

Indexed Minimum Empirical Divergence-Based Algorithms for Linear Bandits

2024-05-24 · Jie Bian, Vincent Y. F. Tan

The Indexed Minimum Empirical Divergence (IMED) algorithm is a highly effective approach that offers a stronger theoretical guarantee of the asymptotic optimality compared to the Kullback--Leibler Upper Confidence Bound …

Multi-Armed BanditsThompson Sampling

Minimum Empirical Divergence for Sub-Gaussian Linear Bandits

2024-10-31 · Kapilan Balagopalan, Kwang-Sung Jun

We propose a novel linear bandit algorithm called LinMED (Linear Minimum Empirical Divergence), which is a linear extension of the MED algorithm that was originally designed for multi-armed bandits. LinMED is a randomize…

Multi-Armed BanditsOff-policy evaluationThompson Sampling

Thompson Sampling for Unimodal Bandits

2021-06-15 · Long Yang, Zhao Li, Zehong Hu, Shasha Ruan 외

In this paper, we propose a Thompson Sampling algorithm for \emph{unimodal} bandits, where the expected reward is unimodal over the partially ordered arms. To exploit the unimodal structure better, at each step, instead …

Thompson Sampling

Optimal Strategies for Graph-Structured Bandits

2020-07-07 · Hassan Saber, Pierre Ménard, Odalric-Ambrym Maillard

We study a structured variant of the multi-armed bandit problem specified by a set of Bernoulli distributions $ \nu \!= \!(\nu\_{a,b})\_{a \in \mathcal{A}, b \in \mathcal{B}}$ with means $(\mu\_{a,b})\_{a \in \mathcal{A}…