Pith. sign in

REVIEW 4 cited by

Behavior Retrieval: Few-Shot Imitation Learning by Querying Unlabeled Datasets

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 2304.08742 v2 pith:2P6KPV6F submitted 2023-04-18 cs.RO cs.AIcs.LG

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

Enabling robots to learn novel visuomotor skills in a data-efficient manner remains an unsolved problem with myriad challenges. A popular paradigm for tackling this problem is through leveraging large unlabeled datasets that have many behaviors in them and then adapting a policy to a specific task using a small amount of task-specific human supervision (i.e. interventions or demonstrations). However, how best to leverage the narrow task-specific supervision and balance it with offline data remains an open question. Our key insight in this work is that task-specific data not only provides new data for an agent to train on but can also inform the type of prior data the agent should use for learning. Concretely, we propose a simple approach that uses a small amount of downstream expert data to selectively query relevant behaviors from an offline, unlabeled dataset (including many sub-optimal behaviors). The agent is then jointly trained on the expert and queried data. We observe that our method learns to query only the relevant transitions to the task, filtering out sub-optimal or task-irrelevant data. By doing so, it is able to learn more effectively from the mix of task-specific and offline data compared to naively mixing the data or only using the task-specific data. Furthermore, we find that our simple querying approach outperforms more complex goal-conditioned methods by 20% across simulated and real robotic manipulation tasks from images. See https://sites.google.com/view/behaviorretrieval for videos and code.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Perfect Demo Makes Poor Teacher: Learning Robust Alignment from Critical Motion Segments

    cs.RO 2026-06 conditional novelty 6.0 of 10

    Fluent expert demonstrations under-supervise the short alignment phase that decides success, and a compact spatio-temporal dynamic feature (STAIR) recovers most of the deliberate-demonstration gain from fluent data alone.

  2. Data Retrieval with Importance Weights for Few-Shot Imitation Learning

    cs.RO 2025-09 conditional novelty 6.0 of 10

    Importance Weighted Retrieval scores prior robot data by the ratio of Gaussian kernel density estimates of the target and prior distributions, improving few-shot imitation learning.

  3. Goal-Oriented Skill Abstraction for Offline Multi-Task Reinforcement Learning

    cs.LG 2025-07 conditional novelty 6.0 of 10

    GO-Skill learns a discrete library of goal-oriented skills from offline multi-task data and selects them with a hierarchical policy, improving average episode returns on MetaWorld MT30 and MT50.

  4. Retrieve-Augmented Generation for Speeding up Diffusion Policy without Additional Training

    cs.LG 2025-07 conditional novelty 4.0 of 10

    RAGDP accelerates pretrained diffusion policies by initializing denoising from the nearest retrieved expert demonstration action, improving accuracy-versus-speed trade-offs without extra training.

Pith tools