Redundancy Management in Federated Learning for Fast Communication
Bibliographic record
Abstract
One of the most critical challenges of federated learning (FL) is to send data efficiently and reliably over the noisy wireless channels between the clients and server to achieve target learning accuracy as fast as possible. To achieve this goal, we design effective error correction coded FL with managed retransmissions. Rather than using Shannon capacity as the performance measure to design the communication mechanisms for FL, our approach relies critically on learning accuracy. Our fundamental idea is based on the observation that Stochastic Gradient Decent (SGD) and its family can tolerate some errors in the course of training. Inspired by this, to reduce the communication burden without degrading the learning accuracy, our FL framework with Managed Redundancy (FL-MR) has two phases: (i) the No-Retransmission phase, where retransmissions are never performed even in case of erroneous decoding of data and (ii) the Select Retransmission phase, where only some carefully selected data packets are retransmitted. Our extensive simulation results demonstrate that the proposed coded FL system achieves target accuracies much faster than the baseline coded approach.
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.003 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
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".