Empirical Policy Iteration for Approximate Dynamic Programming

We propose a simulation based algorithm, Empirical Policy Iteration (EPI) algorithm, for finding the optimal policy function of an MDP with infinite horizon discounted cost criteria when the transition kernels are unknown. Unlike simulation based algorithms using stochastic approximation techniques which give only asymptotic convergence results, we give provable, non-asymptotic performance guarantees in terms of sample complexity results: given is an element of > 0 and delta > 0 we specify the minimum number of simulation samples n(is an element of, delta) needed in each iteration and the minimum number of iterations k(is an element of, delta) that are sufficient for the EPI to yield, with a probability at least 1-delta, an approximate value function that is at least is an element of close to the optimal value function.