Enhancing Transmission Efficiency in Non-IID Federated Learning by Integrating Quantization into an Existing Trustworthiness Model
Bibliographic record
Abstract
Federated Learning (FL) is a distributed machine learning paradigm that enables multiple clients to collaboratively train a model without sharing their data, thus preserving privacy. In this approach, data is not transmitted between the client and the base station. Instead, a model is sent to each device, where it is trained locally, and then retransmitted back to the base station. Each iteration of this process is known as a communication round. However, FL faces challenges, especially when data is not independently and identically distributed (Non-IID). Non-IID data means that the data across clients can vary significantly in distribution, leading to situations where certain classes or features are overrepresented in some clients and underrepresented in others. This lack of uniformity quickly leads to biased model updates and reduced performance. To address this, previous studies have introduced trustworthiness metrics to ensure more reliable model aggregation, minimizing accuracy losses associated with Non-IID data. Another significant challenge is the high transmission load, as model updates between clients and the base station are resource-intensive. Model parameters are transmitted between clients and base stations, which can strain communication channels and slow down the entire process, especially when dealing with larger models and datasets. This communication overhead is a bottleneck that limits the scalability of FL, particularly in resource-constrained environments. Our research addresses these challenges by integrating quantization into the trustworthiness model specifically in a Non-IID scenario. Quantization reduces the precision of model parameters to minimize data transmission, resulting in more efficient communication. We applied different levels of quantization intensity to a model trained on the CIFAR-10 dataset and found that certain methods can significantly reduce transmission overhead without substantial accuracy loss. Our findings suggest that combining quantization with trustworthiness metrics can significantly enhance the efficiency and potentially improve the adoption of Federated Learning in resource-constrained environments.
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.009 | 0.043 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.002 | 0.003 |
| 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".