REVIEW 2 cited by
The Art of Imitation: Learning Long-Horizon Manipulation Tasks from Few Demonstrations
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
Signed reviews
read the original abstract
Task Parametrized Gaussian Mixture Models (TP-GMM) are a sample-efficient method for learning object-centric robot manipulation tasks. However, there are several open challenges to applying TP-GMMs in the wild. In this work, we tackle three crucial challenges synergistically. First, end-effector velocities are non-Euclidean and thus hard to model using standard GMMs. We thus propose to factorize the robot's end-effector velocity into its direction and magnitude, and model them using Riemannian GMMs. Second, we leverage the factorized velocities to segment and sequence skills from complex demonstration trajectories. Through the segmentation, we further align skill trajectories and hence leverage time as a powerful inductive bias. Third, we present a method to automatically detect relevant task parameters per skill from visual observations. Our approach enables learning complex manipulation tasks from just five demonstrations while using only RGB-D observations. Extensive experimental evaluations on RLBench demonstrate that our approach achieves state-of-the-art performance with 20-fold improved sample efficiency. Our policies generalize across different environments, object instances, and object positions, while the learned skills are reusable.
Forward citations
Cited by 2 Pith papers
-
Robotic Task Ambiguity Resolution via Natural Language Interaction
A fine-tuned vision-language model can detect ambiguous robot commands, ask for clarification, and resolve the ambiguity enough to boost real-robot manipulation success from 69.6% to 97.1%.
-
The Unreasonable Effectiveness of Discrete-Time Gaussian Process Mixtures for Robot Policy Learning
A mixture of per-timestep Gaussian processes, fit to five demonstrations, outperforms diffusion and GMM baselines on few-shot robot manipulation benchmarks and supports inference-time constraint updating.
Discussion (0). Continue with ORCID to comment.