Pure Exploration in Infinitely-Armed Bandit Models with Fixed-Confidence

03/13/2018
by   Maryam Aziz, et al.
0

We consider the problem of near-optimal arm identification in the fixed confidence setting of the infinitely armed bandit problem when nothing is known about the arm reservoir distribution. We (1) introduce a PAC-like framework within which to derive and cast results; (2) derive a sample complexity lower bound for near-optimal arm identification; (3) propose an algorithm that identifies a nearly-optimal arm with high probability and derive an upper bound on its sample complexity which is within a log factor of our lower bound; and (4) discuss whether our log^2(1/delta) dependence is inescapable for "two-phase" (select arms first, identify the best later) algorithms in the infinite setting. This work permits the application of bandit models to a broader class of problems where fewer assumptions hold.

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
06/20/2020

An Optimal Elimination Algorithm for Learning a Best Arm

We consider the classic problem of (ϵ,δ)-PAC learning a best arm where t...
research
06/03/2023

Asymptotically Optimal Pure Exploration for Infinite-Armed Bandits

We study pure exploration with infinitely many bandit arms generated i.i...
research
11/02/2021

Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification

We study the problem of the identification of m arms with largest means ...
research
02/16/2017

The Simulator: Understanding Adaptive Sampling in the Moderate-Confidence Regime

We propose a novel technique for analyzing adaptive sampling called the ...
research
02/15/2016

Maximin Action Identification: A New Bandit Framework for Games

We study an original problem of pure exploration in a strategic bandit m...
research
06/23/2019

Making the Cut: A Bandit-based Approach to Tiered Interviewing

Given a huge set of applicants, how should a firm allocate sequential re...

Please sign up or login with your details

Forgot password? Click here to reset