Best arm identification in rare events

03/14/2023
by   Anirban Bhattacharjee, et al.
0

We consider the best arm identification problem in the stochastic multi-armed bandit framework where each arm has a tiny probability of realizing large rewards while with overwhelming probability the reward is zero. A key application of this framework is in online advertising where click rates of advertisements could be a fraction of a single percent and final conversion to sales, while highly profitable, may again be a small fraction of the click rates. Lately, algorithms for BAI problems have been developed that minimise sample complexity while providing statistical guarantees on the correct arm selection. As we observe, these algorithms can be computationally prohibitive. We exploit the fact that the reward process for each arm is well approximated by a Compound Poisson process to arrive at algorithms that are faster, with a small increase in sample complexity. We analyze the problem in an asymptotic regime as rarity of reward occurrence reduces to zero, and reward amounts increase to infinity. This helps illustrate the benefits of the proposed algorithm. It also sheds light on the underlying structure of the optimal BAI algorithms in the rare event setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2017

Good Arm Identification via Bandit Feedback

In this paper, we consider and discuss a new stochastic multi-armed band...
research
02/26/2018

Best Arm Identification for Contaminated Bandits

We propose the Contaminated Best Arm Identification variant of the Multi...
research
03/13/2023

Differential Good Arm Identification

This paper targets a variant of the stochastic multi-armed bandit proble...
research
11/28/2022

On the Sample Complexity of Representation Learning in Multi-task Bandits with Global and Local structure

We investigate the sample complexity of learning the optimal arm for mul...
research
02/22/2018

Collaboratively Learning the Best Option, Using Bounded Memory

We consider multi-armed bandit problems in social groups wherein each in...
research
02/27/2015

Non-stochastic Best Arm Identification and Hyperparameter Optimization

Motivated by the task of hyperparameter optimization, we introduce the n...
research
11/23/2021

Best Arm Identification with Safety Constraints

The best arm identification problem in the multi-armed bandit setting is...

Please sign up or login with your details

Forgot password? Click here to reset