Stochastic Bandit Based on Empirical Moments

Details Stochastic Bandit Based on Empirical Moments Stochastic Bandit Based on Empirical Moments

2011-05-14

arxiv.org/abs/1105.2879v1

Mathematics

Statistics Theory

Scientific paper

In the multiarmed bandit problem a gambler chooses an arm of a slot machine to pull considering a tradeoff between exploration and exploitation. We study the stochastic bandit problem where each arm has a reward distribution supported in a known bounded interval, e.g. [0,1]. For this model, policies which take into account the empirical variances (i.e. second moments) of the arms are known to perform effectively. In this paper, we generalize this idea and we propose a policy which exploits the first d empirical moments for arbitrary d fixed in advance. The asymptotic upper bound of the regret of the policy approaches the theoretical bound by Burnetas and Katehakis as d increases. By choosing appropriate d, the proposed policy realizes a tradeoff between the computational complexity and the expected regret.

Affiliated with

Also associated with

No associations

Rating

Stochastic Bandit Based on Empirical Moments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic Bandit Based on Empirical Moments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic Bandit Based on Empirical Moments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-579317