Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

Details Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning

2009-12-26

arxiv.org/abs/0912.5029v1

Computer Science

Learning

13 pages, 1 figure, ICAART 2010

Scientific paper

There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most problems of interest, the optimal solution involves planning in an infinitely large tree. However, it is possible to obtain stochastic lower and upper bounds on the value of each tree node. This enables us to use stochastic branch and bound algorithms to search the tree efficiently. This paper proposes two such algorithms and examines their complexity in this setting.

Affiliated with

Also associated with

No associations

Rating

Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning 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 Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of stochastic branch and bound methods for belief tree search in Bayesian reinforcement learning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-122476