An efficient bandit algorithm for general weight assignments [Genel Aǧirlik Atamalari için Verimli Bir Haydut Algoritmasi]

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. © 2017 IEEE