In plain words: In agents that score each action and pick the best, the top choice flips in many states after a few training steps. This churn shows up across many games and algorithms and may act as built-in exploration, so random actions matter less than assumed.
Abstract
We identify and study the phenomenon of policy churn, that is, the rapid change of the greedy policy in value-based reinforcement learning. Policy churn operates at a surprisingly rapid pace, changing the greedy action in a large fraction of states within a handful of learning updates (in a typical deep RL set-up such as DQN on Atari). We characterise the phenomenon empirically, verifying that it is not limited to specific algorithm or environment properties. A number of ablations help whittle down the plausible explanations on why churn occurs to just a handful, all related to deep learning. Finally, we hypothesise that policy churn is a beneficial but overlooked form of implicit exploration that casts $ε$-greedy exploration in a fresh light, namely that $ε$-noise plays a much smaller role than expected.
Tom Schaul, André Barreto, John Quan, Georg Ostrovski
arXiv:2206.00730 · cs.LG, cs.AI, stat.ML · submitted Jun 1, 2022 · updated Oct 20, 2022
abstract · pdf · html · Published at NeurIPS 2022