Moreau Envelopes-Based Personalized Asynchronous Federated Learning: Improving Practicality in Network Edge Intelligence
Bibliographic record
Abstract
Federated learning is a promising approach for training models on distributed data, driven by increasing demand in various industries. However, federated learning framework faces several key challenges, including communication bottlenecks and client data heterogeneity. Personalized asynchronous federated learning addresses these challenges by customizing the model for individual users based on their local data while trading model updates asynchronously. In this paper, we propose the Personal-ized Moreau Envelopes-based Asynchronous Federated Learning (APFedMe). Our approach combines the strengths of Moreau En-velopes to handle optimization problems and asynchronous weight updates to improve communication efficiency while mitigating heterogeneity data challenges through a personalized learning environment. We evaluate our approach on several datasets and compare it with the baseline PFedMe method. Our experiments demonstrate that the proposed APFedMe outperforms other meth-ods in terms of convergence speed and communication efficiency. Overall, our work contributes to developing more effective and efficient federated learning methods that can be applied in various real-world scenarios.
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.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.004 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".