Pith. sign in

REVIEW 1 cited by

Imitation Learning from Imperfect Demonstration

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 1901.09387 v3 pith:ABAAPYMM submitted 2019-01-27 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords demonstrationsimperfectconfidencedemonstrationimitationlearnlearningoptimal
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Imitation learning (IL) aims to learn an optimal policy from demonstrations. However, such demonstrations are often imperfect since collecting optimal ones is costly. To effectively learn from imperfect demonstrations, we propose a novel approach that utilizes confidence scores, which describe the quality of demonstrations. More specifically, we propose two confidence-based IL methods, namely two-step importance weighting IL (2IWIL) and generative adversarial IL with imperfect demonstration and confidence (IC-GAIL). We show that confidence scores given only to a small portion of sub-optimal demonstrations significantly improve the performance of IL both theoretically and empirically.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Beyond Monotonic Progress: Retry-Supervised Value Learning for Robot Imitation

    cs.RO 2026-06 unverdicted novelty 6.0 of 10

    Sparse retry keypoints plus pairwise preference learning yield mistake-sensitive values that reweight mixed-quality demos and raise real-robot imitation success over progress-based baselines.

Pith tools