Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper is devoted to the study of the max K-armed bandit problem, which consists in sequentially allocating resources in order to detect extreme values. Our contribution is twofold. We first significantly refine the analysis of the ExtremeHunter algorithm carried out in Carpentier and Valko (2014), and next propose an alternative approach, showing that, remarkably, Extreme Bandits can be reduced to a classical version of the bandit problem to a certain extent. Beyond the formal analysis, these two approaches are compared through numerical experiments.

Original languageEnglish
Title of host publicationMachine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2017, Proceedings
EditorsMichelangelo Ceci, Jaakko Hollmen, Ljupco Todorovski, Celine Vens, Saso Dzeroski
PublisherSpringer Verlag
Pages389-404
Number of pages16
ISBN (Print)9783319712451
DOIs
Publication statusPublished - 1 Jan 2017
Externally publishedYes
EventEuropean Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2017 - Skopje, Macedonia, The Former Yugoslav Republic of
Duration: 18 Sept 201722 Sept 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10535 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceEuropean Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, ECML PKDD 2017
Country/TerritoryMacedonia, The Former Yugoslav Republic of
CitySkopje
Period18/09/1722/09/17

Fingerprint

Dive into the research topics of 'Max K-Armed Bandit: On the ExtremeHunter Algorithm and Beyond'. Together they form a unique fingerprint.

Cite this