Pith. sign in

REVIEW 3 cited by

Making Efficient Use of Demonstrations to Solve Hard Exploration Problems

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 1909.01387 v1 pith:IATTN4RE submitted 2019-09-03 cs.LG cs.AI

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

This paper introduces R2D3, an agent that makes efficient use of demonstrations to solve hard exploration problems in partially observable environments with highly variable initial conditions. We also introduce a suite of eight tasks that combine these three properties, and show that R2D3 can solve several of the tasks where other state of the art methods (both with and without demonstrations) fail to see even a single successful trajectory after tens of billions of steps of exploration.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Reinforcement Learning with Physics-Informed Symbolic Program Priors for Zero-Shot Wireless Indoor Navigation

    cs.LG 2025-06 conditional novelty 6.0 of 10

    Physics priors written as symbolic programs constrain a PPO agent's action choices, yielding better zero-shot wireless indoor navigation and 26%+ training-time savings on Gibson maps.

  2. Reinforcement Learning via Implicit Imitation Guidance

    cs.LG 2025-06 conditional novelty 6.0 of 10

    A reinforcement learning method that learns a state-dependent covariance from expert-policy action differences and uses it as exploration noise, improving sample efficiency on sparse-reward continuous control tasks.

  3. Mixture of Autoencoder Experts Guidance using Unlabeled and Incomplete Data for Exploration in Reinforcement Learning

    cs.LG 2025-07 conditional novelty 4.0 of 10

    MoE-GUIDE guides RL exploration by rewarding states that a mixture of autoencoders, trained on sparse state-only expert demonstrations, considers similar to expert data.

Pith tools