KAFL-HD: Knowledge Alignment in Asynchronous Federated Learning With Heterogeneous Data
Bibliographic record
Abstract
Asynchronous Federated Learning (AFL) can mitigate the straggler problem due to unbalanced training time of clients in Synchronous Federated Learning (SFL), thereby reducing the aggregation time and improving the training efficiency. However, AFL introduces training bias since different updating frequencies of heterogeneous clients can cause unequal knowledge contributions to the global model. Meanwhile, if the client data are heterogeneous, the local optimum may be drifted from the global one, which exacerbates the training bias problem. In order to solve the above issues, we propose a Knowledge Alignment framework for AFL with Heterogeneous Data, termed as KAFL-HD. Firstly, considering data heterogeneity, a data quality-aware aggregation method is proposed to estimate client contributions precisely, where both model staleness and data quality are utilized in aggregation weights. Secondly, a knowledge distillation method with staleness is designed to supplement more knowledge from slow clients to the global model. Thirdly, an adaptive learning rate adjustment method is proposed to customize the local learning rate based on the aggregation frequency and weight, which aligns the knowledge contributions of clients in the local training process. Furthermore, we provide theoretical analysis under a non-convex setting to show the convergence speed of KAFL-HD. Finally, comprehensive experiments are conducted, and the results show that KAFL-HD achieves the highest accuracy and fairness performance compared to the state-of-the-art baselines.
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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.004 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.027 | 0.006 |
| Research integrity | 0.000 | 0.003 |
| 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; a candidate call from one teacher head, 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".