SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 2108.13264 · NeurIPS · 2021

Deep Reinforcement Learning at the Edge of the Statistical Precipice

Rishabh Agarwal, Aaron Courville, Marc Bellemare, Pablo Castro

arXiv · PDF · Open in the Atlas

Code that ran

We lifted 5 functions out of this paper's own repositories and ran 5 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.

RepositoryRoleRan
google-research/rliable canonical 5 of 5
FunctionStatusWhere it lives
aggregate_mean Ran google-research/rliable/rliable/metrics.py
code served (permissive licence) · get_code("789e3d365ed83d4d")
aggregate_median Ran google-research/rliable/rliable/metrics.py
code served (permissive licence) · get_code("3a1dff5bddc6267d")
aggregate_optimality_gap Ran google-research/rliable/rliable/metrics.py
code served (permissive licence) · get_code("d5ecb22cd8033830")
mean_score_deviation Ran google-research/rliable/rliable/library.py
code served (permissive licence) · get_code("3a130a325421dbbf")
run_score_deviation Ran google-research/rliable/rliable/library.py
code served (permissive licence) · get_code("10c95803c98940ec")

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

Deep reinforcement learning (RL) algorithms are predominantly evaluated by comparing their relative performance on a large suite of tasks. Most published results on deep RL benchmarks compare point estimates of aggregate performance such as mean and median scores across tasks, ignoring the statistical uncertainty implied by the use of a finite number of training runs. Beginning with the Arcade Learning Environment (ALE), the shift towards computationally-demanding benchmarks has led to the practice of evaluating only a small number of runs per task, exacerbating the statistical uncertainty in point estimates. In this paper, we argue that reliable evaluation in the few-run deep RL regime cannot ignore the uncertainty in results without running the risk of slowing down progress in the field. We illustrate this point using a case study on the Atari 100k benchmark, where we find substantial discrepancies between conclusions drawn from point estimates alone versus a more thorough statistical analysis. With the aim of increasing the field's confidence in reported results with a handful of runs, we advocate for reporting interval estimates of aggregate performance and propose performance profiles to account for the variability in results, as well as present more robust and efficient aggregate metrics, such as interquartile mean scores, to achieve small uncertainty in results. Using such statistical tools, we scrutinize performance evaluations of existing algorithms on other widely used RL benchmarks including the ALE, Procgen, and the DeepMind Control Suite, again revealing discrepancies in prior comparisons. Our findings call for a change in how we evaluate performance in deep RL, for which we present a more rigorous evaluation methodology, accompanied with an open-source library rliable 2 , to prevent unreliable results from stagnating the field.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("2108.13264")
get_code_for_paper("2108.13264")
have("2108.13264")

Connect an agent — have() is free.