An efficient bandit algorithm for general weight assignments

Date
2017
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Proceedings of the IEEE 25th Signal Processing and Communications Applications Conference, SIU 2017
Print ISSN
Electronic ISSN
Publisher
IEEE
Volume
Issue
Pages
Language
Turkish
Journal Title
Journal ISSN
Volume Title
Series
Abstract

In this paper, we study the adversarial multi armed bandit problem and present a generally implementable efficient bandit arm selection structure. Since we do not have any statistical assumptions on the bandit arm losses, the results in the paper are guaranteed to hold in an individual sequence manner. The introduced framework is able to achieve the optimal regret bounds by employing general weight assignments on bandit arm selection sequences. Hence, this framework can be used for a wide range of applications.

Course
Other identifiers
Book Title
Citation
Published Version (Please cite this version)