Pith. sign in

REVIEW 5 cited by

EXTRACT: Efficient Policy Learning by Extracting Transferable Robot Skills from Offline Data

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 2406.17768 v3 pith:WRUUFWJV submitted 2024-06-25 cs.RO cs.AIcs.LG

classification cs.ROcs.AIcs.LG
keywords extractskillslearntasksdatalearningofflineprior
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Most reinforcement learning (RL) methods focus on learning optimal policies over low-level action spaces. While these methods can perform well in their training environments, they lack the flexibility to transfer to new tasks. Instead, RL agents that can act over useful, temporally extended skills rather than low-level actions can learn new tasks more easily. Prior work in skill-based RL either requires expert supervision to define useful skills, which is hard to scale, or learns a skill-space from offline data with heuristics that limit the adaptability of the skills, making them difficult to transfer during downstream RL. Our approach, EXTRACT, instead utilizes pre-trained vision language models to extract a discrete set of semantically meaningful skills from offline data, each of which is parameterized by continuous arguments, without human supervision. This skill parameterization allows robots to learn new tasks by only needing to learn when to select a specific skill and how to modify its arguments for the specific task. We demonstrate through experiments in sparse-reward, image-based, robot manipulation environments that EXTRACT can more quickly learn new tasks than prior works, with major gains in sample efficiency and performance over prior skill-based RL. Website at https://www.jessezhang.net/projects/extract/.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. TOPReward: Token Probabilities as Hidden Zero-Shot Rewards for Robotics

    cs.RO 2026-02 conditional novelty 6.0 of 10

    The log-probability a VLM assigns to 'True' for 'does this video prefix complete the task?' is used as a zero-shot dense progress reward that outperforms GVL on open-source models.

  2. STRAP: Robot Sub-Trajectory Retrieval for Augmented Policy Learning

    cs.RO 2024-12 conditional novelty 6.0 of 10

    Sub-trajectory retrieval with vision foundation models and dynamic time warping improves few-shot robot imitation learning over state-based and full-trajectory retrieval.

  3. Dual-Process Atomic Skill Learning: Decoupling Semantic Reasoning and Real-Time Control

    cs.RO 2026-07 conditional novelty 5.0 of 10

    Asynchronous dual-frequency hierarchical imitation learning with VQ skills and training-only latent diffusion improves compositional language-conditioned robot control and reduces skill codebook collapse.

  4. N2M: Bridging Navigation and Manipulation by Learning Pose Preference from Rollout

    cs.RO 2025-09 conditional novelty 5.0 of 10

    N2M predicts preferable base poses for manipulation policies from ego-centric point clouds, learned from rollouts, lifting success from 3% to 54% in the PnPCounterToCab task.

  5. SLAC: Safe and Efficient Real-Robot Reinforcement Learning via Unsupervised Simulation Pre-Training

    cs.RO 2025-06 conditional novelty 5.0 of 10

    SLAC learns a latent action space in a low-fidelity simulator and uses it for real-world reinforcement learning, solving whole-body mobile manipulation tasks in under an hour without demonstrations.

Pith tools