Papers › Some Considerations on Learning to Explore via Meta-Reinforcement Learning

Some Considerations on Learning to Explore via Meta-Reinforcement Learning

3 Mar 2018ICLR 2018 1arXiv:1803.01118archive 2025-07-28

Bradly C. Stadie, Ge Yang, Rein Houthooft, Xi Chen, Yan Duan, Yuhuai Wu, Pieter Abbeel, Ilya Sutskever

We consider the problem of exploration in meta reinforcement learning. Two new meta reinforcement learning algorithms are suggested: E-MAML and E-RL². Results are presented on a novel environment we call `Krazy World' and a set of maze environments. We show E-MAML and E-RL² deliver better performance on tasks where exploration is important.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

episodeyang/e-maml officialmentioned in papertfSyntology: not harvested report
Zhiwei-Z/PrompLimitTest mentioned on GitHubtfMITSyntology: not harvested report
Zhiwei-Z/SeqPromp mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks (arXiv:1703.03400; that paper's own run record: 103 ran (of which 35 constructed an object rather than computing a result; 72 with no instrument failure: 6 honoured, 1 violated, 65 with no contract checked; 31 where Syntology's instrument failed) · 51 unverified); nothing checks that they implement this paper's method. report
Zhiwei-Z/prompzzw mentioned on GitHubtfMITSyntology: not harvested report
clrrrr/promp_plus mentioned on GitHubtfSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks (arXiv:1703.03400; that paper's own run record: 103 ran (of which 35 constructed an object rather than computing a result; 72 with no instrument failure: 6 honoured, 1 violated, 65 with no contract checked; 31 where Syntology's instrument failed) · 51 unverified); nothing checks that they implement this paper's method. report
jonasrothfuss/promp mentioned on GitHubtfMITSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to ProMP: Proximal Meta-Policy Search (arXiv:1810.06784; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified) and Improving Generalization in Meta-RL with Imaginary Tasks from Latent Dynamics Mixture (arXiv:2105.13524; that paper's own run record: 2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified); nothing checks that they implement this paper's method. report
mazpie/mime mentioned on GitHubpytorchNOASSERTIONSyntology: not harvested report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Meta Reinforcement LearningReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections