Learning from the Best: Smoothness-Driven Metrics for Data Quality in Imitation Learning
Soham Kulkarni, Raayan Dhar, Yuchen Cui

TL;DR
This paper introduces RINSE, a lightweight, smoothness-based demonstration scoring framework for improving imitation learning data quality, leading to significant success rate improvements on benchmarks and real-world tasks.
Contribution
RINSE provides a policy-architecture-agnostic, smoothness-based demonstration scoring method that enhances data selection and reweighting in imitation learning without costly policy training.
Findings
SAL filtering yields 16% higher success with one-sixth data on RoboMimic.
TED filtering achieves 20% improvement with half the data in real-world manipulation.
RINSE re-ranking improves success by 5.6% on LIBERO-10.
Abstract
In behavioral cloning (BC), policy performance is fundamentally limited by demonstration data quality. Real-world datasets contain trajectories of varying quality due to operator skill differences, teleoperation artifacts, and procedural inconsistencies, yet standard BC treats all demonstrations equally. Existing curation methods require costly policy training in the loop or manual annotation, limiting scalability. We propose RINSE (Ranking and INdexing Smooth Examples), a lightweight framework for scoring demonstrations based on trajectory smoothness that is policy-architecture-agnostic and operates on trajectory data alone, with TED additionally using a phase-boundary/contact signal. Grounded in motor control theory, which establishes smoothness as a hallmark of skilled movement, RINSE uses two complementary metrics: Spectral Arc Length (SAL), a spectral measure of frequency-domain…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
