Pith. sign in

REVIEW 6 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). Sign in to comment.

Forward citations

Cited by 6 Pith papers

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

  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. SID: Sliding into Distribution for Robust Few-Demonstration Manipulation

    cs.RO 2026-05 unverdicted novelty 6.0 of 10

    SID achieves approximately 90% success on six real-world manipulation tasks with only two demonstrations under out-of-distribution initializations, with less than 10% performance drop under distractors and disturbances.

  3. 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.

  4. Octo: An Open-Source Generalist Robot Policy

    cs.RO 2024-05 unverdicted novelty 6.0 of 10

    Octo is an open-source transformer-based generalist robot policy pretrained on 800k trajectories that serves as an effective initialization for finetuning across diverse robotic platforms.

  5. TSD: A Physics-Inspired Trajectory Saliency Detector for Efficient Imitation Learning

    cs.RO 2026-06 unverdicted novelty 5.0 of 10

    TSD applies two physics metrics to identify salient trajectory segments for dataset compression and expansion in robotic imitation learning, yielding comparable performance with 25% less data on average.

  6. ReGIL: Retrieval-Guided Imitation Learning from a Single Demonstration

    cs.RO 2026-06 unverdicted novelty 5.0 of 10

    ReGIL retrieves segments from a single demonstration to compute local temporal-alignment rewards and guide policy training, achieving >75% success on three real-robot tasks with <1 hour of online data.

Pith tools