Approximate modified policy iteration and its application to the game of Tetris
Abstract
Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three implementations of approximate MPI (AMPI) that are extensions of the well-known approximate DP algorithms:~fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide error propagation analysis that unify those for approximate policy and value iteration. We develop the finite-sample analysis of these algorithms, which highlights the influence of their parameters. In the classification-based version of the algorithm (CBMPI), the analysis shows that MPI's main parameter controls the balance between the estimation error of the classifier and the overall value function approximation. We illustrate and evaluate the behavior of these new algorithms in the Mountain Car and Tetris problems. Remarkably, in Tetris, CBMPI outperforms the existing DP approaches by a large margin, and competes with the current state-of-the-art methods while using fewer samples.
Domains
Mathematics [math] Optimization and Control [math.OC] Computer Science [cs] Machine Learning [cs.LG] Computer Science [cs] Numerical Analysis [cs.NA] Computer Science [cs] Operations Research [cs.RO] Computer Science [cs] Computational Complexity [cs.CC] Mathematics [math] Statistics [math.ST] Computer Science [cs] Information Retrieval [cs.IR]
Origin : Files produced by the author(s)
