Pith

open record

sign in

arxiv: 2009.01555 · v3 · pith:OOHVKMTU · submitted 2020-09-03 · cs.LG · stat.ML

Sample-Efficient Automated Deep Reinforcement Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:OOHVKMTUrecord.jsonopen to challenge →

classification cs.LG stat.ML
keywords learningsample-efficientacrossalgorithmsautomatedautorlchallengingdeep
0
0 comments X
read the original abstract

Despite significant progress in challenging problems across various domains, applying state-of-the-art deep reinforcement learning (RL) algorithms remains challenging due to their sensitivity to the choice of hyperparameters. This sensitivity can partly be attributed to the non-stationarity of the RL problem, potentially requiring different hyperparameter settings at various stages of the learning process. Additionally, in the RL setting, hyperparameter optimization (HPO) requires a large number of environment interactions, hindering the transfer of the successes in RL to real-world applications. In this work, we tackle the issues of sample-efficient and dynamic HPO in RL. We propose a population-based automated RL (AutoRL) framework to meta-optimize arbitrary off-policy RL algorithms. In this framework, we optimize the hyperparameters and also the neural architecture while simultaneously training the agent. By sharing the collected experience across the population, we substantially increase the sample efficiency of the meta-optimization. We demonstrate the capabilities of our sample-efficient AutoRL approach in a case study with the popular TD3 algorithm in the MuJoCo benchmark suite, where we reduce the number of environment interactions needed for meta-optimization by up to an order of magnitude compared to population-based training.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.