WFSL: Warmup-Based Federated Sequential Learning
Bibliographic record
Abstract
Federated learning (FL) gained importance in sensitive Internet of Things (IoT) environments by creating a privacy-preserving ecosystem where participants share machine-learning models instead of raw data. However, FL shifts data control away from the server, exposing it to non-independent and identically distributed (non-IID) problems caused by biased clients (IoT devices). This hinders the learning process by increasing execution time and cost. Current solutions alter the FL structure or compromise privacy by offloading clients’ raw data to an external server. To mitigate these limitations, this article proposes a solution to the non-IID problem by introducing an initialization phase, orchestrated by the server, that constructs high-quality initial models. These models can boost FL accuracy and convergence, regardless of whether IoT participants exhibit non-IID properties. Our proposed initialization scheme involves clients training over the same model sequentially, lessening the impact of aggregation, a primary cause of model degradation in federated approaches. Furthermore, a regulator algorithm deployed on the server maintains model integrity and mitigates catastrophic forgetting, enhanced by a client selection process that emphasizes the compatibility of IoT clients to cooperate effectively. Moreover, we devise an optimization scheme based on clustering and genetic algorithms to reduce the selection time while ensuring optimal performance in IoT networks. Experiments on MNIST, KDD, and CIFAR10 data sets show promising results in terms of initial model resiliency against catastrophic forgetting and non-IID settings. Additionally, our findings suggest that our approach can significantly enhance FL training in IoT applications by achieving 40% higher initialization accuracy and a 20% average improvement in end results compared to conventional methods, all while reducing computation time by 80% compared to similar approaches.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.015 | 0.009 |
| Research integrity | 0.000 | 0.002 |
| Insufficient payload (model declined to judge) | 0.000 | 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; both teacher heads agree on what is shown here.
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".