Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration

Details Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration

2008-05-14

arxiv.org/abs/0805.2015v2

Statistics

Machine Learning

14 pages, presented at EWRL'08

Scientific paper

Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem, have been proposed recently. Finding good policies with such methods requires not only an appropriate classifier, but also reliable examples of best actions, covering the state space sufficiently. Up to this time, little work has been done on appropriate covering schemes and on methods for reducing the sample complexity of such methods, especially in continuous state spaces. This paper focuses on the simplest possible covering scheme (a discretized grid over the state space) and performs a sample-complexity comparison between the simplest (and previously commonly used) rollout sampling allocation strategy, which allocates samples equally at each state under consideration, and an almost as simple method, which allocates samples only as needed and requires significantly fewer samples.

Affiliated with

Also associated with

No associations

Rating

Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration 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 Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithms and Bounds for Rollout Sampling Approximate Policy Iteration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55625