Reproducibility of Benchmarked Deep Reinforcement Learning Tasks for Continuous Control
Riashat Islam Thanks: Work done while interning at Maluuba, A Microsoft Company. Thanks: These two authors contributed equally. Affiliation: School of Computer Science Affiliation: McGill University Affiliation: Montreal, QC, Canada Email: Peter Henderson††Affiliation: School of Computer Science Affiliation: McGill University Affiliation: Montreal, QC, Canada Email: Maziar Gomrokchi Affiliation: School of Computer Science Affiliation: McGill University Affiliation: Montreal, QC, Canada Email: Doina Precup Affiliation: School of Computer Science Affiliation: McGill University Affiliation: Montreal, QC, Canada Email:
Abstract
Policy gradient methods in reinforcement learning have become increasingly prevalent for state-of-the-art performance in continuous control tasks. Novel methods typically benchmark against a few key algorithms such as deep deterministic policy gradients and trust region policy optimization. As such, it is important to present and use consistent baselines experiments. However, this can be difficult due to general variance in the algorithms, hyper-parameter tuning, and environment stochasticity. We investigate and discuss: the significance of hyper-parameters in policy gradients for continuous control, general variance in the algorithms, and reproducibility of reported results. We provide guidelines on reporting novel results as comparisons against baseline methods such that future researchers can make informed decisions when investigating novel methods.
原文 arXiv:1708.04133;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1708.04133v1