Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning

Kimin Lee, Kibok Lee, Jinwoo Shin, Honglak Lee
10/11/2019
cs.LGstat.ML

Official code: pokaxpoka/netrand (57 stars, MIT, last commit 2020-04-27).

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.

View on arXivView PDF

Code Implementations(1)

pokaxpoka/netrandOfficial100%
MIT

Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning / ICLR 2020

577C++, PythonFeb 14, 20206 years agoMIT

Cite this paper

@article{lee2019network,
  title  = {Network Randomization: A Simple Technique for Generalization in Deep Reinforcement Learning},
  author = {Kimin Lee and Kibok Lee and Jinwoo Shin and Honglak Lee},
  year   = {2019},
  eprint = {1910.05396},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1910.05396}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1910.05396.svg)](https://codeofpaper.com/paper/1910.05396)

Discussion