Feature Reinforcement Learning In Practice

Details Feature Reinforcement Learning In Practice Feature Reinforcement Learning In Practice

2011-08-18

arxiv.org/abs/1108.3614v1

Computer Science

Artificial Intelligence

Scientific paper

Following a recent surge in using history-based methods for resolving perceptual aliasing in reinforcement learning, we introduce an algorithm based on the feature reinforcement learning framework called PhiMDP. To create a practical algorithm we devise a stochastic search procedure for a class of context trees based on parallel tempering and a specialized proposal distribution. We provide the first empirical evaluation for PhiMDP. Our proposed algorithm achieves superior performance to the classical U-tree algorithm and the recent active-LZ algorithm, and is competitive with MC-AIXI-CTW that maintains a bayesian mixture over all context trees up to a chosen depth.We are encouraged by our ability to compete with this sophisticated method using an algorithm that simply picks one single model, and uses Q-learning on the corresponding MDP. Our PhiMDP algorithm is much simpler, yet consumes less time and memory. These results show promise for our future work on attacking more complex and larger problems.

Affiliated with

Also associated with

No associations

Rating

Feature Reinforcement Learning In Practice 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 Feature Reinforcement Learning In Practice, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Feature Reinforcement Learning In Practice will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180543