Reliable Federated Learning for Age Sensitive Mobile Edge Computing Systems
Bibliographic record
Abstract
The conventional approach for Federated Learning (FL) is to train a global model by averaging local models trained on local data sets. However, given the limited computing resources at the mobile-edge nodes, unreliable models may be received from the Edge Nodes (ENs), which can lead to a significant performance degradation in the FL. Thus, this paper proposes a reliable and age sensitive FL framework that captures the dynamic nature of the local data and computing resources at each participating EN. Specifically, we formulate two optimization problems to select the optimal subset of ENs that can upload their local models in each round of the global model training, given a limited learning cost budget. The first problem aims at selecting the most reliable ENs that should cooperate to complete the FL process, while considering stationary data distributions at different ENs. The second problem aims at minimizing the average age of information experienced by each EN while selecting the most reliable ENs, given fast changing data distributions. Efficient solutions are proposed for the two problems with a worst-case linear complexity. Our Results, leveraging a real-world dataset, depict the efficiency of our solutions in obtaining a better performance compared to conventional FL 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.007 |
| 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.002 | 0.004 |
| Open science | 0.002 | 0.003 |
| 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".