BDFT and its federated version, FedBDFT, are proposed, which fine-tune branch-wise classifiers and aggregate them through federated optimization and demonstrate its effectiveness for federated hierarchical classification with heterogeneous label granularities.
Abstract
Federated learning enables privacy-preserving collaboration across distributed devices without centralizing local data. However, clients may differ not only in data distributions but also in domain knowledge and annotation capabilities. In this paper, we introduce label granularity skew, a new form of statistical heterogeneity in federated hierarchical classification, in which clients provide taxonomy-consistent labels at different levels of detail within a shared class hierarchy. To model this heterogeneity, we generate client-specific local label hierarchies using a probabilistic relational neighbor classifier and construct a WordNet-guided hierarchy via silhouette score-based coarsening. Our analysis shows that strongly coupled hierarchical models are sensitive to incomplete supervision, while the conditional softmax classifier is more robust. Based on this insight, we propose Branch-wise Decoupled Fine-Tuning (BDFT) and its federated version, FedBDFT, which fine-tune branch-wise classifiers and aggregate them through federated optimization. Experiments on CIFAR-100, TinyImageNet, and ImageNet show that FedBDFT substantially improves robustness under severe label granularity skew, with average gains of 27.9% and 56.4% at skewness levels of 0.6 and 0.9, respectively. Zero-shot results further indicate that FedBDFT better preserves hierarchical representations for unseen fine-grained classes. These findings demonstrate its effectiveness for federated hierarchical classification with heterogeneous label granularities.
The proposed Joint Domain-Class Federated Learning (JDFL), a lightweight, optimizer-agnostic extension that makes this latent domain variation usable without sharing raw data, and introduces two complementary supervision strategies based on simple intuitions.
Sina Najafi, Mostafa Tavassolipour, S. P. Shariatpanahi· 0 citations
FedCC, a simple and effective algorithm for mitigating client misclassification that balances confidence in majority classes against uncertainty in under-represented ones, is proposed and significantly outperforms existing methods.
Wenxuan Ye, Onur Ayan, Xue-Li An et al.· 0 citations
SensCluster is proposed, a novel sensitivity-aware CFL framework that constructs compact client representations by selecting parameters that are most responsive to local feature distributions, and consistently outperforms state-of-the-art CFL methods across diverse feature skew scenarios.
Jiaqi Wang, Tobias Schlagenhauf, Setareh Maghsudi· Proceedings of the 32nd ACM...· 0 citations
In this work, we investigate the task of Federated Generalized Category Discovery (Fed-GCD), which aims to leverage labeled data from known classes to cluster unlabeled samples from both known and unknown classes through privacy-preserving collaboration among clients. Existing Fed-GCD methods predominantly emphasize im...
Wen-Jing Li, Nan Pu, Jessica Fan et al.· IEEE Transactions on Informa...· 0 citations
Results indicate that CACTUS can propagate backdoors through repeated DFL aggregation and show that ASR varies with network topology and increases with the malicious-node ratio.
As a distributed machine learning paradigm, federated learning enables collaborative training among multiple clients while preserving data privacy. However, in practical applications, it faces the challenge of domain shift caused by data heterogeneity, which limits the generalization performance of the global model on...
Qian Wang, Qun Li, Xue Li et al.· IEEE Transactions on Image P...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.