Indexed Minimum Empirical Divergence for Unimodal Bandits

12/02/2021
by   Hassan Saber, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/30/2020

Forced-exploration free Strategies for Unimodal Bandits

We consider a multi-armed bandit problem specified by a set of Gaussian ...
research
07/07/2020

Optimal Strategies for Graph-Structured Bandits

We study a structured variant of the multi-armed bandit problem specifie...
research
04/25/2019

Uniform minimum risk equivariant estimates for moment condition models

We consider semiparametric moment condition models invariant to transfor...
research
02/19/2021

A High Performance, Low Complexity Algorithm for Multi-Player Bandits Without Collision Sensing Information

Motivated by applications in cognitive radio networks, we consider the d...
research
07/12/2013

Thompson Sampling for 1-Dimensional Exponential Family Bandits

Thompson Sampling has been demonstrated in many complex bandit models, h...
research
05/24/2017

Boundary Crossing Probabilities for General Exponential Families

We consider parametric exponential families of dimension K on the real l...
research
01/18/2022

Bregman Deviations of Generic Exponential Families

We revisit the method of mixture technique, also known as the Laplace me...

Please sign up or login with your details

Forgot password? Click here to reset