Taming the Noise in Reinforcement Learning via Soft Updates
Model free reinforcement learning algorithms such as Q learning perform poorly in the early stages of learning in noisy environments, because much effort is spent on unlearning biased estimates of the state action function. The bias comes from selecting, among several noisy estimates, the apparent optimum, which may actually be suboptimal. We propose G learning, a new off policy learning algorithm that regularizes the noise in the space of optimal actions by penalizing deterministic policies at the beginning of the learning. Moreover, it enables naturally incorporating prior distributions over optimal actions when available. The stochastic nature of G learning also makes it more cost effective than Q learning in noiseless but exploration risky domains. We illustrate these ideas in several examples where G learning results in significant improvements of the learning rate and the learning cost.
UAI