Pith. sign in

REVIEW 2 cited by

A Closer Look at Advantage-Filtered Behavioral Cloning in High-Noise 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 2110.04698 v2 pith:N7YB5IQP submitted 2021-10-10 cs.LG

classification cs.LG
keywords datasetslearningbenchmarkexperiencehigh-noiseidentifyofflinepolicies
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent Offline Reinforcement Learning methods have succeeded in learning high-performance policies from fixed datasets of experience. A particularly effective approach learns to first identify and then mimic optimal decision-making strategies. Our work evaluates this method's ability to scale to vast datasets consisting almost entirely of sub-optimal noise. A thorough investigation on a custom benchmark helps identify several key challenges involved in learning from high-noise datasets. We re-purpose prioritized experience sampling to locate expert-level demonstrations among millions of low-performance samples. This modification enables offline agents to learn state-of-the-art policies in benchmark tasks using datasets where expert actions are outnumbered nearly 65:1.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. WARP-RM: A Warp-Augmented Relative Progress Reward Model for Data Curation

    cs.RO 2026-06 unverdicted novelty 7.0 of 10

    WARP trains a reward model on time-warped successful demonstrations to produce frame-level progress estimates that upweight high-advantage chunks during behavior cloning, maintaining high success rates on suboptimal d...

  2. AMAGO-2: Breaking the Multi-Task Barrier in Meta-Reinforcement Learning with Transformers

    cs.LG 2024-11 conditional novelty 6.0 of 10

    Using two-hot classification for value prediction and binary-filtered imitation for policy updates makes multi-task meta-RL training scale-invariant to reward magnitudes, improving performance across five benchmarks w...

Pith tools