Pith. sign in

REVIEW 1 cited by

Improving Generalization in Meta Reinforcement Learning using Learned Objectives

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 1910.04098 v2 pith:MUF5EAXK submitted 2019-10-09 cs.LG cs.AIcs.NEstat.ML

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

Biological evolution has distilled the experiences of many learners into the general learning algorithms of humans. Our novel meta reinforcement learning algorithm MetaGenRL is inspired by this process. MetaGenRL distills the experiences of many complex agents to meta-learn a low-complexity neural objective function that decides how future individuals will learn. Unlike recent meta-RL algorithms, MetaGenRL can generalize to new environments that are entirely different from those used for meta-training. In some cases, it even outperforms human-engineered RL algorithms. MetaGenRL uses off-policy second-order gradients during meta-training that greatly increase its sample efficiency.

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. Evolution and The Knightian Blindspot of Machine Learning

    cs.AI 2025-01 conditional novelty 6.0 of 10

    ML's formalisms, particularly RL's, exclude Knightian uncertainty, and evolution's diversify-and-filter mechanisms point toward a direct remedy.

Pith tools