Papers › Teacher algorithms for curriculum learning of Deep RL in continuously parameterized...

Teacher algorithms for curriculum learning of Deep RL in continuously parameterized environments

16 Oct 2019arXiv:1910.07224archive 2025-07-28

Rémy Portelas, Cédric Colas, Katja Hofmann, Pierre-Yves Oudeyer

We consider the problem of how a teacher algorithm can enable an unknown Deep Reinforcement Learning (DRL) student to become good at a skill over a wide range of diverse environments. To do so, we study how a teacher algorithm can learn to generate a learning curriculum, whereby it sequentially samples parameters controlling a stochastic procedural generation of environments. Because it does not initially know the capacities of its student, a key challenge for the teacher is to discover which environments are easy, difficult or unlearnable, and in what order to propose them to maximize the efficiency of learning over the learnable ones. To achieve this, this problem is transformed into a surrogate continuous bandit problem where the teacher samples environments in order to maximize absolute learning progress of its student. We present a new algorithm modeling absolute learning progress with Gaussian mixture models (ALP-GMM). We also adapt existing algorithms and provide a complete study in the context of DRL. Using parameterized variants of the BipedalWalker environment, we study their efficiency to personalize a learning curriculum for different learners (embodiments), their robustness to the ratio of learnable/unlearnable environments, and their scalability to non-linear and high-dimensional parameter spaces. Videos and code are available at https://github.com/flowersteam/teachDeepRL.

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.07224")

Code

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

By repository: official repository: 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.

flowersteam/teachDeepRL officialmentioned in papermentioned on GitHubtfMIT report
facebookresearch/dcd mentioned on GitHubpytorchNOASSERTION 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 flowersteam/teachDeepRL. “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.

Rotate2D flowersteam/teachDeepRL/teachDRL/gym_flowers/envs/bipedal_walker_continuous.py official repository unverified MIT (permissive) · 06521a4018d88f64 · report
get_vars flowersteam/teachDeepRL/teachDRL/spinup/algos/ddpg/core.py official repository unverified MIT (permissive) · a2580d7c4a763348 · report
mlp flowersteam/teachDeepRL/teachDRL/spinup/algos/ddpg/core.py official repository unverified MIT (permissive) · e68b07bcdded00fa · report
param_dict_to_param_vec flowersteam/teachDeepRL/teachDRL/teachers/teacher_controller.py official repository unverified MIT (permissive) · a80e3eef65a4a0a4 · report
param_vec_to_param_dict flowersteam/teachDeepRL/teachDRL/teachers/teacher_controller.py official repository unverified MIT (permissive) · 30f260501f2782b6 · report
placeholder flowersteam/teachDeepRL/teachDRL/spinup/algos/ddpg/core.py official repository unverified MIT (permissive) · 17b03c462ce92576 · report
proportional_choice flowersteam/teachDeepRL/teachDRL/teachers/algos/alp_gmm.py official repository unverified MIT (permissive) · 762e08fee0c22ebd · report

Tasks

Deep Reinforcement LearningReinforcement Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: ALP-GMM

ALP-GMM

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