Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning
Kimin Lee, Kibok Lee, Jinwoo Shin, Honglak Lee
TL;DR
This work tackles the generalization gap in deep reinforcement learning when test environments present unseen visual patterns. It introduces Network Randomization, which perturbs inputs with a randomly initialized single-layer CNN at training time and combines a policy objective with a feature-matching loss to encourage invariant representations; Monte Carlo inference is used at test time to stabilize decisions. Across CoinRun, DeepMind Lab, and Surreal robotics, the method outperforms regularization and data augmentation baselines, achieving notable gains in unseen environments and revealing more compact, task-relevant activations. The approach is simple, simulator-light, and has potential implications for sim-to-real transfer, adversarial robustness, and dynamics generalization.
Abstract
Deep reinforcement learning (RL) agents often fail to generalize to unseen environments (yet semantically similar to trained agents), particularly when they are trained on high-dimensional state spaces, such as images. In this paper, we propose a simple technique to improve a generalization ability of deep RL agents by introducing a randomized (convolutional) neural network that randomly perturbs input observations. It enables trained agents to adapt to new domains by learning robust features invariant across varied and randomized environments. Furthermore, we consider an inference method based on the Monte Carlo approximation to reduce the variance induced by this randomization. We demonstrate the superiority of our method across 2D CoinRun, 3D DeepMind Lab exploration and 3D robotics control tasks: it significantly outperforms various regularization and data augmentation methods for the same purpose.
