Adaptive Learning of Uncontrolled Restless Bandits with Logarithmic Regret

Mathematics – Optimization and Control

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

In this paper we consider the problem of learning the optimal policy for the uncontrolled restless bandit problem. In this problem only the state of the selected arm can be observed, the state transitions are independent of control and the transition law is unknown. We propose a learning algorithm which gives logarithmic regret uniformly over time with respect to the optimal finite horizon policy with known transition law under some assumptions on the transition probabilities of the arms and the structure of the optimal stationary policy for the infinite horizon average reward problem.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Adaptive Learning of Uncontrolled Restless Bandits with Logarithmic Regret 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 Adaptive Learning of Uncontrolled Restless Bandits with Logarithmic Regret, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Adaptive Learning of Uncontrolled Restless Bandits with Logarithmic Regret will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-36196

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.