A Two-Level Dirichlet Framework for Heterogeneous Federated Network
Bibliographic record
Abstract
Real-world federated learning (FL) deployments commonly confront heterogeneous data distributions across geographically dispersed or otherwise diverse client devices, posing major challenges for global model convergence and service performance. From a distributed information network and management perspective, effectively orchestrating model training under these non-IID conditions is crucial for preserving both training efficiency and system reliability. To evaluate FL algorithms under realistic conditions, researchers frequently perform synthetic non-IID partitioning of benchmark datasets, with Dirichlet-based label splits being one of the most common techniques. While this single-level Dirichlet partitioning successfully simulates label imbalance, it fails to capture the rich, subpopulation-level heterogeneity present in many real-life scenarios. This limitation arises because single-level Dirichlet partitioning only skews label distributions across clients, without considering the underlying feature-space variations that naturally emerge within subpopulations. In this paper, we propose a feature-aware two-level hierarchical Dirichlet distribution approach as an advanced alternative to the traditional Dirichlet partition in the realm of FL. Our method first clusters the dataset in a feature-embedding space, then applies two-tiered Dirichlet sampling at both the cluster and the within-cluster levels. Ultimately, this hierarchical Dirichlet technique has direct implications for the distributed network, offering a robust testbed for optimizing federated training workflows and maintaining system-wide performance in distributed learning applications. Experiments and simulations highlight that our approach yields more realistic data partitions, thereby stress-testing federated algorithms more thoroughly.
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.005 | 0.010 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".