Pith. sign in

REVIEW 1 cited by

The NetHack Learning Environment

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2006.13760 v2 pith:CDX67MIL submitted 2020-06-24 cs.LG cs.AIcs.CLcs.NEstat.ML

classification cs.LGcs.AIcs.CLcs.NEstat.ML
keywords environmentnethacklearningagentschallengingcomplexenvironmentsexisting
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Progress in Reinforcement Learning (RL) algorithms goes hand-in-hand with the development of challenging environments that test the limits of current methods. While existing RL environments are either sufficiently complex or based on fast simulation, they are rarely both. Here, we present the NetHack Learning Environment (NLE), a scalable, procedurally generated, stochastic, rich, and challenging environment for RL research based on the popular single-player terminal-based roguelike game, NetHack. We argue that NetHack is sufficiently complex to drive long-term research on problems such as exploration, planning, skill acquisition, and language-conditioned RL, while dramatically reducing the computational resources required to gather a large amount of experience. We compare NLE and its task suite to existing alternatives, and discuss why it is an ideal medium for testing the robustness and systematic generalization of RL agents. We demonstrate empirical success for early stages of the game using a distributed Deep RL baseline and Random Network Distillation exploration, alongside qualitative analysis of various agents trained in the environment. NLE is open source at https://github.com/facebookresearch/nle.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Episodic Novelty Through Temporal Distance

    cs.LG 2025-01 conditional novelty 6.0 of 10

    An episodic intrinsic reward based on a contrastively learned temporal distance quasimetric improves exploration in sparse-reward Contextual MDPs.

Pith tools