The reviewed record of science sign in
Pith

arxiv: 2110.04698 · v2 · pith:N7YB5IQP · submitted 2021-10-10 · cs.LG

A Closer Look at Advantage-Filtered Behavioral Cloning in High-Noise Datasets

Reviewed by Pithpith:N7YB5IQPopen to challenge →

classification cs.LG
keywords datasetslearningbenchmarkexperiencehigh-noiseidentifyofflinepolicies
0
0 comments X
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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

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

    cs.RO 2026-06 unverdicted novelty 7.0

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