Differentiable Architecture Search for Reinforcement Learning
In this paper, we investigate the fundamental question: To what extent are gradient-based neural architecture search (NAS) techniques applicable to RL? Using the original DARTS as a convenient baseline, we discover that the discrete architectures found can achieve up to 250% performance compared to...
Saved in:
Main Authors | , , , , , , |
---|---|
Format | Journal Article |
Language | English |
Published |
03.06.2021
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | In this paper, we investigate the fundamental question: To what extent are
gradient-based neural architecture search (NAS) techniques applicable to RL?
Using the original DARTS as a convenient baseline, we discover that the
discrete architectures found can achieve up to 250% performance compared to
manual architecture designs on both discrete and continuous action space
environments across off-policy and on-policy RL algorithms, at only 3x more
computation time. Furthermore, through numerous ablation studies, we
systematically verify that not only does DARTS correctly upweight operations
during its supernet phrase, but also gradually improves resulting discrete
cells up to 30x more efficiently than random search, suggesting DARTS is
surprisingly an effective tool for improving architectures in RL. |
---|---|
DOI: | 10.48550/arxiv.2106.02229 |