The multi-armed bandit problem with covariates

Details The multi-armed bandit problem with covariates The multi-armed bandit problem with covariates

2011-10-27

arxiv.org/abs/1110.6084v1

Mathematics

Statistics Theory

Scientific paper

We consider a multi-armed bandit problem in a setting where each arm produces a noisy reward realization which depends on an observable random covariate. As opposed to the traditional static multi-armed bandit problem, this setting allows for dynamically changing rewards that better describe applications where side information is available. We adopt a nonparametric model where the expected rewards are smooth functions of the covariate and where the hardness of the problem is captured by a margin parameter. To maximize the expected cumulative reward, we introduce a policy called Adaptively Binned Successive Elimination (ABSE) that adaptively decomposes the global problem into suitably localized static bandit problems. This policy constructs an adaptive partition using a variant of the Successive Elimination (SE) policy. Our results include sharper regret bounds for the SE policy in a static bandit problem and minimax optimal regret bounds for the ABSE policy in the dynamic problem.

Affiliated with

Also associated with

No associations

Rating

The multi-armed bandit problem with covariates 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 The multi-armed bandit problem with covariates, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The multi-armed bandit problem with covariates will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-376118