Pith. sign in

REVIEW 12 cited by

A Tutorial on Meta-Reinforcement Learning

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2301.08028 v4 pith:7RAXB4LP submitted 2023-01-19 cs.LG

Jacob Beck , Risto Vuorio , Evan Zheran Liu , Zheng Xiong , Luisa Zintgraf , Chelsea Finn , Shimon Whiteson This is my paper
classification cs.LG
keywords meta-rllearningtaskdistributionproblemalgorithmsdatadeep
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While deep reinforcement learning (RL) has fueled multiple high-profile successes in machine learning, it is held back from more widespread adoption by its often poor data efficiency and the limited generality of the policies it produces. A promising approach for alleviating these limitations is to cast the development of better RL algorithms as a machine learning problem itself in a process called meta-RL. Meta-RL is most commonly studied in a problem setting where, given a distribution of tasks, the goal is to learn a policy that is capable of adapting to any new task from the task distribution with as little data as possible. In this survey, we describe the meta-RL problem setting in detail as well as its major variations. We discuss how, at a high level, meta-RL research can be clustered based on the presence of a task distribution and the learning budget available for each individual task. Using these clusters, we then survey meta-RL algorithms and applications. We conclude by presenting the open problems on the path to making meta-RL part of the standard toolbox for a deep RL practitioner.

Discussion (0). Sign in to comment.

Forward citations

Cited by 12 Pith papers

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

  1. Long-Horizon Model-Based Offline Reinforcement Learning Without Explicit Conservatism

    cs.LG 2025-12 conditional novelty 7.0 of 10

    NEUBAY uses Bayesian posteriors over world models with long-horizon planning to match or exceed conservative offline RL methods without explicit conservatism.

  2. A Unified Causal-Origin Taxonomy of Distributional Shifts in Reinforcement Learning

    cs.LG 2026-06 conditional novelty 6.5 of 10

    Distributional shift in RL is classified by which POMDP generative component changes (internal agent vs external environment) and by whether the time boundary is explicit, implicit, or hybrid.

  3. Learning Adaptive Multi-Task Guidance, Navigation, and Control via Hypernetworks

    cs.RO 2026-07 conditional novelty 6.0 of 10

    A hypernetwork maps continuous physics-informed task embeddings to shared actor-critic weights, mastering four orbital GNC tasks and composing novel ones without retraining, with sim-to-real on a floating platform.

  4. Towards Scalable Multi-Task Reinforcement Learning with Large Decision Models

    cs.LG 2026-06 unverdicted novelty 6.0 of 10

    A multi-task multi-modal transformer policy pretrained on offline trajectories from thousands of RL environments matches task-specific reference policies on approximately 1000 environments spanning robotics, driving, ...

  5. A Meta Reinforcement Learning Approach to Goals-Based Wealth Management

    cs.LG 2026-05 unverdicted novelty 6.0 of 10

    MetaRL pre-trained on GBWM problems delivers near-optimal dynamic strategies in 0.01s achieving 97.8% of DP optimal utility and handles larger problems where DP fails.

  6. Towards Long-Lived Robots: Continual Learning VLA Models via Reinforcement Fine-Tuning

    cs.RO 2026-02 unverdicted novelty 6.0 of 10

    LifeLong-RFT applies chunking-level on-policy reinforcement learning with Quantized Action Consistency Reward, Continuous Trajectory Alignment Reward, and Format Compliance Reward to fine-tune VLA models, achieving a ...

  7. Generalised Linear Models in Deep Bayesian RL with Learnable Basis Functions

    cs.LG 2025-12 unverdicted novelty 6.0 of 10

    GLiBRL uses GLMs with learnable basis functions for exact Bayesian inference in deep BRL, derives a closed-form link between L2 task distances and kernel task similarity, and reports up to 1.8x gains over prior meta-R...

  8. Action Chunking with Transformers for Image-Based Spacecraft Guidance and Control

    cs.RO 2025-09 conditional novelty 6.0 of 10

    ACT imitation learning from 100 meta-RL demonstrations beats the meta-RL baseline on simulated ISS docking, using about 6,300 interactions instead of 40 million.

  9. ReBRAC-v2: The Return of the King

    cs.LG 2026-08 conditional novelty 5.0 of 10

    A fixed-recipe offline RL method combining normalizing-flow actors, categorical critics, staged training, and test-time refinement beats recent flow-based baselines by 22.5 points averaged over ten OGBench categories.

  10. Certificate-Guided Evaluation of Reinforcement Learning Generalization

    cs.AI 2026-05 unverdicted novelty 5.0 of 10

    A logic-driven framework defines inductive reach-avoid tasks and uses neural certificates to certify RL generalization, with empirical results linking fewer violations to more solved test tasks.

  11. The Rise and Potential of Large Language Model Based Agents: A Survey

    cs.AI 2023-09 accept novelty 4.0 of 10

    The paper surveys the origins, frameworks, applications, and open challenges of AI agents built on large language models.

  12. Meta-Learning and Meta-Reinforcement Learning -- Tracing the Path towards DeepMind's Adaptive Agent

    cs.AI 2026-02 unverdicted novelty 2.0 of 10

    A survey provides a task-based formalization of meta-learning and meta-RL while chronicling algorithms that lead to DeepMind's Adaptive Agent.

Pith tools