Plato: An Open-Source Research Framework for Production Federated Learning
Bibliographic record
Abstract
As existing works on federated learning (FL) have not typically shared their implementations as open-source, and existing open-source FL frameworks fell short of evaluating FL mechanisms appropriately, in the past two years, we have designed and implemented Plato, a new open-source research framework for scalable federated learning research from scratch. Development on Plato started in November 2020, and so far involved more than 50 person-month of research and development time. Plato is designed and built with several key objectives in mind: it is scalable to a large number of clients; extensible to accommodate a wide variety of datasets, models, and FL algorithms; and agnostic to deep learning frameworks such as TensorFlow and PyTorch. In Plato, clients communicate with servers over industry-standard WebSockets, while servers may either run in the same GPU-enabled physical machine as its clients — suitable for an emulation research testbed — or deployed in a cloud datacenter. We provided a large variety of popular datasets and models, as well as algorithms proposed in the literature as examples.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.011 | 0.030 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.005 | 0.010 |
| Open science | 0.007 | 0.009 |
| Research integrity | 0.003 | 0.005 |
| Insufficient payload (model declined to judge) | 0.019 | 0.013 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".