Fed-BAC: Federated Bandit-Guided Additive Clustering in Hierarchical Federated Learning

• URL: http://arxiv.org/abs/2605.11815v1
• Date: Tue, 12 May 2026 09:07:52 GMT
• Title: Fed-BAC: Federated Bandit-Guided Additive Clustering in Hierarchical Federated Learning
• Abstract summary: This paper proposes Fed-BAC, which integrates additive cluster personalization with a two-level bandit framework.<n>Fed-BAC achieves distributed accuracy gains of up to +35.5pp over HierFAVG and +8.4pp over IFCA.
• Score: 4.998584084394827
• License: http://creativecommons.org/licenses/by/4.0/
• 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 ($α= 0.5$) and severe ($α= 0.1$) Dirichlet non-IID partitioning, Fed-BAC achieves distributed accuracy gains of up to +35.5pp over HierFAVG and +8.4pp over IFCA, while requiring only 80% client participation, converging 1.5 to 4.8$\times$ faster depending on dataset and accuracy target, and improving cross-server fairness. These gains are further validated at 5$\times$ deployment scale on CIFAR-10. The advantage of Fed-BAC increases with heterogeneity severity, confirming that additive cluster personalization becomes increasingly valuable as data distributions diverge.

Related papers

• Label Granularity Skew in Federated Learning with Hierarchical Image Classification [1.1196974000738729]
  Federated learning enables privacy-preserving collaboration across distributed devices without centralizing local data.<n>Clients differ not only in data distributions but also in domain knowledge and annotation capabilities.<n>We introduce label granularity skew, a new form of statistical heterogeneity in federated hierarchical classification.
  arXiv  Detail & Related papers  (2026-08-10T08:01:50Z)
• Federated Hierarchical Clustering with Automatic Selection of Optimal Cluster Numbers [13.396894845465468]
  Federated Clustering (FC) is an emerging and promising solution in exploring data distribution patterns from distributed and privacy-protected data in an unsupervised manner.<n>We propose a novel FC framework named Fed-$k*$-HC, which can automatically determine an optimal number of clusters $k*$ based on the data distribution explored through hierarchical clustering.
  arXiv  Detail & Related papers  (2026-03-13T05:58:35Z)
• FedDAG: Clustered Federated Learning via Global Data and Gradient Integration for Heterogeneous Environments [11.797290397638962]
  Federated Learning (FL) enables a group of clients to collaboratively train a model without sharing individual data, but its performance drops when client data are heterogeneous.<n>This paper introduces a clustered FL framework, FedDAG, that employs a weighted, class-wise similarity metric that integrates both data and information.<n> Experiments on diverse benchmarks and data settings show that FedDAG consistently outperforms state-of-the-art clustered FL baselines in accuracy.
  arXiv  Detail & Related papers  (2026-02-26T21:20:19Z)
• FedEMA-Distill: Exponential Moving Average Guided Knowledge Distillation for Robust Federated Learning [1.1393603788068776]
  Federated learning (FL) often degrades when clients hold heterogeneous non-Independent and Identically Distributed (non-IID) data.<n>This paper proposes FedEMA-Distill, a server-side procedure that combines an exponential moving average (EMA) of the global model with ensemble knowledge distillation from client-uploaded prediction logits.
  arXiv  Detail & Related papers  (2026-02-15T01:40:45Z)
• One-Shot Hierarchical Federated Clustering [51.490181220883905]
  This paper introduces an efficient one-shot hierarchical Federated Clustering framework.<n>It performs client-end distribution exploration and server-end distribution aggregation.<n>It turns out that the complex cluster distributions across clients can be efficiently explored.
  arXiv  Detail & Related papers  (2026-01-10T02:58:33Z)
• Towards Federated Clustering: A Client-wise Private Graph Aggregation Framework [57.04850867402913]
  Federated clustering addresses the challenge of extracting patterns from decentralized, unlabeled data.<n>We propose Structural Privacy-Preserving Federated Graph Clustering (SPP-FGC), a novel algorithm that innovatively leverages local structural graphs as the primary medium for privacy-preserving knowledge sharing.<n>Our framework achieves state-of-the-art performance, improving clustering accuracy by up to 10% (NMI) over federated baselines while maintaining provable privacy guarantees.
  arXiv  Detail & Related papers  (2025-11-14T03:05:22Z)
• Timely Asynchronous Hierarchical Federated Learning: Age of Convergence [59.96266198512243]
  We consider an asynchronous hierarchical federated learning setting with a client-edge-cloud framework. The clients exchange the trained parameters with their corresponding edge servers, which update the locally aggregated model. The goal of each client is to converge to the global model, while maintaining timeliness of the clients.
  arXiv  Detail & Related papers  (2023-06-21T17:39:16Z)
• FedGT: Identification of Malicious Clients in Federated Learning with Secure Aggregation [69.75513501757628]
  FedGT is a novel framework for identifying malicious clients in federated learning with secure aggregation. We show that FedGT significantly outperforms the private robust aggregation approach based on the geometric median recently proposed by Pillutla et al.
  arXiv  Detail & Related papers  (2023-05-09T14:54:59Z)
• Efficient Distribution Similarity Identification in Clustered Federated Learning via Principal Angles Between Client Data Subspaces [59.33965805898736]
  Clustered learning has been shown to produce promising results by grouping clients into clusters. Existing FL algorithms are essentially trying to group clients together with similar distributions. Prior FL algorithms attempt similarities indirectly during training.
  arXiv  Detail & Related papers  (2022-09-21T17:37:54Z)
• Heterogeneous Federated Learning via Grouped Sequential-to-Parallel Training [60.892342868936865]
  Federated learning (FL) is a rapidly growing privacy-preserving collaborative machine learning paradigm. We propose a data heterogeneous-robust FL approach, FedGSP, to address this challenge. We show that FedGSP improves the accuracy by 3.7% on average compared with seven state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-01-31T03:15:28Z)
• FedGroup: Efficient Clustered Federated Learning via Decomposed Data-Driven Measure [18.083188787905083]
  We propose a novel clustered federated learning (CFL) framework FedGroup. We show that FedGroup can significantly improve absolute test accuracy by +14.1% on FEMNIST compared to FedAvg. We also evaluate FedGroup and FedGrouProx (combined with FedProx) on several open datasets.
  arXiv  Detail & Related papers  (2020-10-14T08:15:34Z)
• LSD-C: Linearly Separable Deep Clusters [145.89790963544314]
  We present LSD-C, a novel method to identify clusters in an unlabeled dataset. Our method draws inspiration from recent semi-supervised learning practice and proposes to combine our clustering algorithm with self-supervised pretraining and strong data augmentation. We show that our approach significantly outperforms competitors on popular public image benchmarks including CIFAR 10/100, STL 10 and MNIST, as well as the document classification dataset Reuters 10K.
  arXiv  Detail & Related papers  (2020-06-17T17:58:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.