Robust Bayesian reinforcement learning through tight lower bounds

Details Robust Bayesian reinforcement learning through tight lower bounds Robust Bayesian reinforcement learning through tight lower bounds

2011-06-18

arxiv.org/abs/1106.3651v2

Computer Science

Learning

Corrected version. 12 pages, 3 figures, 1 table

Scientific paper

In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinforcement learning problems. While utility bounds are known to exist for this problem, so far none of them were particularly tight. In this paper, we show how to efficiently calculate a lower bound, which corresponds to the utility of a near-optimal memoryless policy for the decision problem, which is generally different from both the Bayes-optimal policy and the policy which is optimal for the expected MDP under the current belief. We then show how these can be applied to obtain robust exploration policies in a Bayesian reinforcement learning setting.

Affiliated with

Also associated with

No associations

Rating

Robust Bayesian reinforcement learning through tight lower bounds 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 Robust Bayesian reinforcement learning through tight lower bounds, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Bayesian reinforcement learning through tight lower bounds will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-465741