Papers › Effective Diversity in Population Based Reinforcement Learning

Effective Diversity in Population Based Reinforcement Learning

3 Feb 2020NeurIPS 2020 12arXiv:2002.00632archive 2025-07-28

Jack Parker-Holder, Aldo Pacchiano, Krzysztof Choromanski, Stephen Roberts

Exploration is a key problem in reinforcement learning, since agents can only learn from data they acquire in the environment. With that in mind, maintaining a population of agents is an attractive method, as it allows data be collected with a diverse set of behaviors. This behavioral diversity is often boosted via multi-objective loss functions. However, those approaches typically leverage mean field updates based on pairwise distances, which makes them susceptible to cycling behaviors and increased redundancy. In addition, explicitly boosting diversity often has a detrimental impact on optimizing already fruitful behaviors for rewards. As such, the reward-diversity trade off typically relies on heuristics. Finally, such methods require behavioral representations, often handcrafted and domain specific. In this paper, we introduce an approach to optimize all members of a population simultaneously. Rather than using pairwise distance, we measure the volume of the entire population in a behavioral manifold, defined by task-agnostic behavioral embeddings. In addition, our algorithm Diversity via Determinants (DvD), adapts the degree of diversity during training using online learning techniques. We introduce both evolutionary and gradient-based instantiations of DvD and show they effectively improve exploration without reducing performance when better exploration is not required.

PaperPDFConference PDFCodeCode 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="2002.00632")

Code

Syntology Ran 10 of 12 code samples harvested from 2 repositories linked to this paper; 2 have no recorded run. Of those that ran: 1 ran · violated contract; 2 ran · our draft was wrong; 1 ran · fixture could not drive it; 6 ran with no contract checked.

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

jparkerholder/DvD_ES officialmentioned in paper report
holounic/DvD-TD3 mentioned on GitHubpytorch 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

12 samples harvested; 10 ran; 0 honoured the contract we drafted; 2 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.

1ran · violated contract
2ran · our draft was wrong
1ran · fixture could not drive it
6ran
2unverified

Licence: 9 of the 12 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 2 repositories linked to this paper, official or community; each sample names its own and says which. “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.

get_det jparkerholder/DvD_ES/es.py official repository ran · fixture could not drive it Apache-2.0 (permissive) · 9f4ef0e29eb8bd25 · report
get_experiment jparkerholder/DvD_ES/experiments.py official repository ran · our draft was wrong Apache-2.0 (permissive) · 808b1cbcf8ffbd49 · report
normalize2 jparkerholder/DvD_ES/es.py official repository ran · violated contract fingerprinted Apache-2.0 (permissive) · 954aa28753459d3b · report
Actor holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran fingerprinted no licence file found · pointer only · 01cff9d67cdcaecf · report
BaseActorCritic holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran no licence file found · pointer only · 347f0fe517e50968 · report
Buffer holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran no licence file found · pointer only · aeecae3f15ea94c6 · report
Critic holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran no licence file found · pointer only · b97e9e0f24a99b33 · report
DiversityLoss holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran fingerprinted no licence file found · pointer only · 71b8dc99038de04a · report
TD3 holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran no licence file found · pointer only · ea4ac6af2af793cd · report
unpack_batch holounic/DvD-TD3/td3/algorithm.py community (archive-listed) ran · our draft was wrong fingerprinted no licence file found · pointer only · a72924a3e9838a33 · report
DvDTD3 holounic/DvD-TD3/td3/algorithm.py community (archive-listed) unverified no licence file found · pointer only · 34d3b149455f4fee · report
soft_update holounic/DvD-TD3/td3/algorithm.py community (archive-listed) unverified no licence file found · pointer only · ea8c4add89ea88fb · report

Tasks

DiversityPoint ProcessesReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

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