Methods › General › Hyperparameter Search › Population Based Training

Population Based Training

18 papers tagged archive 2025-07-28

Introduced by Max Jaderberg et al. in Population Based Training of Neural Networks

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

Population Based Training, or PBT, is an optimization method for finding parameters and hyperparameters, and extends upon parallel search methods and sequential optimisation methods. It leverages information sharing across a population of concurrently running optimisation processes, and allows for online propagation/transfer of parameters and hyperparameters between members of the population based on their performance. Furthermore, unlike most other adaptation schemes, the method is capable of performing online adaptation of hyperparameters -- which can be particularly important in problems with highly non-stationary learning dynamics, such as reinforcement learning settings. PBT is decentralised and asynchronous, although it could also be executed semi-serially or with partial synchrony if there is a binding budget constraint.

PaperSourceSee Code · elsheikh21/population-based-training-of-NNs

In Syntology about another paper, arXiv:2003.06212: repository known, no verified implementation (declared_code; repositories: 1 listed of 1 in the graph, strongest link: mentioned on GitHub). About another paper: this answer is about arXiv:2003.06212, while the archive credits arXiv:1711.09846.

Code Syntology holds under other names, as the lookup lists them (code_nearby); not a complete list, and none of them is this method.

Origin paper of this answer, arXiv:2003.06212 (its page on this site · its page on Syntology).

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

What each level means, quoted from Syntology's server card: V0 “imports”; V1 “executes against a synthesized fixture and returns a value of the recorded type”; V2 “two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs” “neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)”; V3 “paper-derived property tests pass on both of those same two generations.” The card adds: “No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results.” A level quoted in two parts is one definition the card writes as two clauses joined by a double hyphen, each clause quoted on its own (how these levels are quoted).

Papers archive 2025-07-28

archive papers tagged: 18 · with a code link: 10 · where Syntology ran a sample: 4 (4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (4 of 18 tagged: 4 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 18 of 18, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 shown of 32 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Data Augmentation5
Hyperparameter Optimization5
Reinforcement Learning4
Reinforcement Learning (RL)4
Classification2
Deep Reinforcement Learning2
Policy Gradient Methods2
3D Object Detection1
Adversarial Robustness1
Atari Games1
Decision Making1
Diversity1
Fairness1
General Classification1
Graph Classification1
Graph Learning1
Image Augmentation1
Image Generation1
Link Prediction1
Machine Translation1

Usage over time archive 2025-07-28

Papers per year tagged with Population Based Training: 2017 to 2023, peak 6 6 0 2017: 1 paper 2017 2018: 0 papers 2018 2019: 4 papers 2019 2020: 6 papers 2020 2021: 4 papers 2021 2022: 1 paper 2022 2023: 2 papers 2023
Papers per year the archive tags with this method, by the paper's archive date (18 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Hyperparameter SearchOptimization

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