Nonparametric Contextual Bandits in an Unknown Metric Space

08/03/2019 ∙ by Nirandika Wanigasekara, et al. ∙ 6

Consider a nonparametric contextual multi-arm bandit problem where each arm a ∈ [K] is associated to a nonparametric reward function f_a: [0,1] →R mapping from contexts to the expected reward. Suppose that there is a large set of arms, yet there is a simple but unknown structure amongst the arm reward functions, e.g. finite types or smooth with respect to an unknown metric space. We present a novel algorithm which learns data-driven similarities amongst the arms, in order to implement adaptive partitioning of the context-arm space for more efficient learning. We provide regret bounds along with simulations that highlight the algorithm's dependence on the local geometry of the reward functions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 8

page 29

page 30

page 31

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.