On Step Sizes, Stochastic Shortest Paths, and Survival Probabilities in Reinforcement Learning
This document has been relocated to http://scholarsmine.mst.edu/engman_syseng_facwork/262
There were 8 downloads as of 28 Jun 2016.
Reinforcement learning (RL) is a simulation-based technique useful in solving Markov decision processes if their transition probabilities are not easily obtainable or if the problems have a very large number of states. We present an empirical study of (i) the effect of step-sizes (learning rules) in the convergence of RL algorithms, (ii) stochastic shortest paths in solving average reward problems via RL, and (iii) the notion of survival probabilities (downside risk) in RL. We also study the impact of step sizes when function approximation is combined with RL. Our experiments yield some interesting insights that will be useful in practice when RL algorithms are implemented within simulators.