UCB Algorithm for Exponential Distributions

Details UCB Algorithm for Exponential Distributions UCB Algorithm for Exponential Distributions

2012-04-07

arxiv.org/abs/1204.1624v1

Statistics

Machine Learning

10 pages. Introduces Multiplicative Upper Confidence Bound (MUCB) algorithms for Multi-Armed Bandit problems

Scientific paper

We introduce in this paper a new algorithm for Multi-Armed Bandit (MAB) problems. A machine learning paradigm popular within Cognitive Network related topics (e.g., Spectrum Sensing and Allocation). We focus on the case where the rewards are exponentially distributed, which is common when dealing with Rayleigh fading channels. This strategy, named Multiplicative Upper Confidence Bound (MUCB), associates a utility index to every available arm, and then selects the arm with the highest index. For every arm, the associated index is equal to the product of a multiplicative factor by the sample mean of the rewards collected by this arm. We show that the MUCB policy has a low complexity and is order optimal.

Affiliated with

Also associated with

No associations

Rating

UCB Algorithm for Exponential Distributions 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 UCB Algorithm for Exponential Distributions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and UCB Algorithm for Exponential Distributions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-37205