Pith. sign in

REVIEW 3 cited by

Skill-based Meta-Reinforcement Learning

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 2204.11828 v1 pith:TLAWSX45 submitted 2022-04-25 cs.LG cs.AI

classification cs.LGcs.AI
keywords learningtaskslong-horizonsolvedatasetsofflinepriorbehaviors
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

While deep reinforcement learning methods have shown impressive results in robot learning, their sample inefficiency makes the learning of complex, long-horizon behaviors with real robot systems infeasible. To mitigate this issue, meta-reinforcement learning methods aim to enable fast learning on novel tasks by learning how to learn. Yet, the application has been limited to short-horizon tasks with dense rewards. To enable learning long-horizon behaviors, recent works have explored leveraging prior experience in the form of offline datasets without reward or task annotations. While these approaches yield improved sample efficiency, millions of interactions with environments are still required to solve complex tasks. In this work, we devise a method that enables meta-learning on long-horizon, sparse-reward tasks, allowing us to solve unseen target tasks with orders of magnitude fewer environment interactions. Our core idea is to leverage prior experience extracted from offline datasets during meta-learning. Specifically, we propose to (1) extract reusable skills and a skill prior from offline datasets, (2) meta-train a high-level policy that learns to efficiently compose learned skills into long-horizon behaviors, and (3) rapidly adapt the meta-trained policy to solve an unseen target task. Experimental results on continuous control tasks in navigation and manipulation demonstrate that the proposed method can efficiently solve long-horizon novel target tasks by combining the strengths of meta-learning and the usage of offline datasets, while prior approaches in RL, meta-RL, and multi-task RL require substantially more environment interactions to solve the tasks.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Distill Skills into Weights, Not Prompts: Abstract Skills as Privileged Signals for On-Policy Self-Distillation

    cs.LG 2026-08 conditional novelty 6.0 of 10

    SKALD shows that distilling skill-conditioned teacher predictions into a question-only student improves math reasoning more than GRPO alone, with gains concentrated on rollout groups where rewards are uniform.

  2. Exploratory Retrieval-Augmented Planning For Continual Embodied Instruction Following

    cs.AI 2025-09 conditional novelty 6.0 of 10

    ExRAP couples LLM planning with a temporal knowledge-graph memory and information-based exploration, improving success and efficiency for continual embodied instruction following.

  3. NBDI: A Simple and Effective Termination Condition for Skill Extraction from Task-Agnostic Demonstrations

    cs.LG 2025-01 conditional novelty 6.0 of 10

    NBDI learns skill termination from state-action novelty (ICM prediction error) on task-agnostic demonstrations, improving downstream RL performance in maze and manipulation benchmarks.

Pith tools