Papers › ZPD Teaching Strategies for Deep Reinforcement Learning from Demonstrations

ZPD Teaching Strategies for Deep Reinforcement Learning from Demonstrations

26 Oct 2019arXiv:1910.12154archive 2025-07-28

Daniel Seita, David Chan, Roshan Rao, Chen Tang, Mandi Zhao, John Canny

Learning from demonstrations is a popular tool for accelerating and reducing the exploration requirements of reinforcement learning. When providing expert demonstrations to human students, we know that the demonstrations must fall within a particular range of difficulties called the "Zone of Proximal Development (ZPD)". If they are too easy the student learns nothing, but if they are too difficult the student is unable to follow along. This raises the question: Given a set of potential demonstrators, which among them is best suited for teaching any particular learner? Prior work, such as the popular Deep Q-learning from Demonstrations (DQfD) algorithm has generally focused on single demonstrators. In this work we consider the problem of choosing among multiple demonstrators of varying skill levels. Our results align with intuition from human learners: it is not always the best policy to draw demonstrations from the best performing demonstrator (in terms of reward). We show that careful selection of teaching strategies can result in sample efficiency gains in the learner's environment across nine Atari games

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1910.12154")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: community (archive-listed): 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

DanielTakeshi/dqn mentioned on GitHubpytorch report
RevanMacQueen/LearningFromHumans mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from RevanMacQueen/LearningFromHumans. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

convert_str_to_type RevanMacQueen/LearningFromHumans/lfh/utils/config.py community (archive-listed) unverified MIT (permissive) · b2fbd25f4df143eb · report
make_atari RevanMacQueen/LearningFromHumans/lfh/envs/atari.py community (archive-listed) unverified MIT (permissive) · cf49e0670274da2b · report
make_env RevanMacQueen/LearningFromHumans/lfh/envs/atari.py community (archive-listed) unverified MIT (permissive) · 06128276029b84db · report
read_json RevanMacQueen/LearningFromHumans/lfh/utils/io.py community (archive-listed) unverified MIT (permissive) · 0c8ce2af5b547951 · report
read_pickle RevanMacQueen/LearningFromHumans/lfh/utils/io.py community (archive-listed) unverified MIT (permissive) · 7b7ecea431823fff · report
read_trajectory RevanMacQueen/LearningFromHumans/lfh/utils/io.py community (archive-listed) unverified MIT (permissive) · d6463150dc6452b4 · report
wrap_deepmind RevanMacQueen/LearningFromHumans/lfh/envs/atari.py community (archive-listed) unverified MIT (permissive) · bfecf5132a09da6a · report

Tasks

Atari GamesDeep Reinforcement LearningQ-LearningReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Q-Learning

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections