Fed-BAC: Federated Bandit-Guided Additive Clustering in Hierarchical Federated Learning
Satwat Bashir, Tasos Dagiuklas, Muddesar Iqbal

TL;DR
Fed-BAC introduces a novel federated learning approach combining bandit algorithms and additive clustering to optimize client selection and cluster assignment, significantly improving accuracy and convergence speed in heterogeneous data environments.
Contribution
It proposes Fed-BAC, integrating bandit frameworks with additive clustering for enhanced personalization and efficiency in hierarchical federated learning.
Findings
Achieves up to +35.5 percentage points accuracy gain over HierFAVG.
Converges 1.5 to 4.8 times faster depending on dataset and target accuracy.
Requires only 80% client participation, improving fairness.
Abstract
Hierarchical federated learning (HFL) leverages edge servers for partial aggregation in edge computing. Yet existing FL methods lack mechanisms for jointly optimizing cluster assignment and client selection under data heterogeneity. This paper proposes Fed-BAC, which integrates additive cluster personalization with a two-level bandit framework: contextual bandits at the cloud learn server-to-cluster assignments, while Thompson Sampling at each edge server identifies high-contributing clients. The additive decomposition enables the sharing of knowledge between groups through a globally aggregated network, while cluster-specific networks capture distribution variations. Across three classification benchmarks (CIFAR-10, SVHN, Fashion-MNIST) under moderate () and severe () Dirichlet non-IID partitioning, Fed-BAC achieves distributed accuracy gains of up to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
