Boosting Communication Efficiency in Federated Learning for Multiagent-Based Multimicrogrid Energy Management
Bibliographic record
Abstract
Privacy of user is becoming increasingly significant in constructing efficient multiagent energy management systems for multimicrogrid (MMG). As an emerging privacy-protection method, federated learning (FL) has been used to prevent data breaches in the MMG-related field. However, with the ever-growing participants, the underlying communication burden existing in FL is evident. Besides, since the neural network layers collectively determine an agent's performance, the possible difference in layer convergence speeds would cause the inconsistency problem, that is, the FL may degrade the convergence rate of those fast-convergent layers, which weakens the overall performance of the agent. To address these issues, a communication-efficient FL (CEFL) algorithm is proposed in this study. Considering the cooperative relationship among layers, a layer evaluation (LE) mechanism is developed in CEFL to evaluate layer contribution through the Shapley value (SV), a profit distribution approach for coalitions. In this way, only partial layers with the highest contributions are selected to be uploaded to the server. In addition, instead of average parameters aggregation, a communication-efficient parameter aggregation method is proposed in CEFL to update the parameters of the global model (GM), in which an aggregation model (AM) is developed to receive parameters for aggregation. The performance of the proposed CEFL is verified by the numerical analysis of MMGs with 3-8 MGs participating. Furthermore, experiments investigate the influence of the hyperparameter in the CEFL and also demonstrate performance improvements, compared with the other four state-of-the-art algorithms.
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.002 | 0.005 |
| 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.002 |
| 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".