A Shapley value-enhanced evaluation technique for effective aggregation in Federated Learning
Bibliographic record
Abstract
5G networks make it possible to transfer real-time sensory data between millions of devices, forming the internet of things. A typical method to utilize these data is to train a machine learning algorithm to extract the features. Federated learning (FL) is a platform for a coalition of clients to train a model collaboratively without sharing their data to preserve data privacy. Data and model poisoning attacks, free-riding attacks, and model divergence due to clients' non-independent and identically distributed (non-IID) datasets are some challenges in conventional federated learning. The lack of an evaluation method in federated averaging (FedAvg) in FL makes it impossible to identify malicious users or amend the divergence of the global model. In this study, we propose a Shapley-based aggregation algorithm called Shapley averaging (ShapAvg) to aggregate the global model more effectively by evaluating the clients' models. In this algorithm, each client's weight in the weighted average will be proportional to its contribution to the global model performance. The results show that the proposed method outperforms FedAvg when using non-IID datasets and in case of data poisoning or free-riding attacks.
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.008 | 0.016 |
| Meta-epidemiology (narrow) | 0.002 | 0.000 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".