A Two-Level Dirichlet Framework for Heterogeneous Federated Network

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.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Network Science and Engineering
Published
2025-08-11
DOI
https://doi.org/10.1109/tnse.2025.3597541
Citations
1
Primary Topic
Graph theory and applications
Type
article
Field-Weighted Citation Impact
4.09
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Two-Level Dirichlet Framework for Heterogeneous Federated Network

Osama Wehbi, Azzam Mourad, Sarhad Arisdakessian, Hadi Otrok et al.
1 citations
IEEE Transactions on Network Science and Engineering
Graph theory and applications
4.09
article

A Two-Level Dirichlet Framework for Heterogeneous Federated Network

Osama Wehbi, Azzam Mourad, Sarhad Arisdakessian, Hadi Otrok, Mohsen Guizani, Omar Abdel Wahab
article en
1 citations

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.

IEEE Transactions on Network Science and EngineeringVol. 13
Khalifa University of Science and Technology (AE), Mohamed bin Zayed University of Artificial Intelligence (AE), Polytechnique Montréal (CA)
Openalex Percentile: Top 7%
Graph theory and applications
4.09
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.