A Monte Carlo AIXI Approximation

Details A Monte Carlo AIXI Approximation A Monte Carlo AIXI Approximation

2009-09-04

arxiv.org/abs/0909.0801v2

Computer Science

Artificial Intelligence

51 LaTeX pages, 11 figures, 6 tables, 4 algorithms

Scientific paper

This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. Our approach is based on a direct approximation of AIXI, a Bayesian optimality notion for general reinforcement learning agents. Previously, it has been unclear whether the theory of AIXI could motivate the design of practical algorithms. We answer this hitherto open question in the affirmative, by providing the first computationally feasible approximation to the AIXI agent. To develop our approximation, we introduce a new Monte-Carlo Tree Search algorithm along with an agent-specific extension to the Context Tree Weighting algorithm. Empirically, we present a set of encouraging results on a variety of stochastic and partially observable domains. We conclude by proposing a number of directions for future research.

Affiliated with

Also associated with

No associations

Rating

A Monte Carlo AIXI Approximation 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 A Monte Carlo AIXI Approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Monte Carlo AIXI Approximation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35448