Optimizing Federated Learning by Entropy-Based Client Selection

Andreas Lutz, Gabriele Steidl, Karsten Müller, Wojciech Samek
11/2/2024
cs.LGcs.AIcs.DC

No confident code implementation found for this paper.

Abstract

Although deep learning has revolutionized domains such as natural language processing and computer vision, its dependence on centralized datasets raises serious privacy concerns. Federated learning addresses this issue by enabling multiple clients to collaboratively train a global deep learning model without compromising their data privacy. However, the performance of such a model degrades under label skew, where the label distribution differs between clients. To overcome this issue, a novel method called FedEntOpt is proposed. In each round, it selects clients to maximize the entropy of the aggregated label distribution, ensuring that the global model is exposed to data from all available classes. Extensive experiments on multiple benchmark datasets show that the proposed method outperforms several state-of-the-art algorithms by up to 6% in classification accuracy under standard settings regardless of the model size, while achieving gains of over 30% in scenarios with low participation rates and client dropout. In addition, FedEntOpt offers the flexibility to be combined with existing algorithms, enhancing their classification accuracy by more than 40%. Importantly, its performance remains unaffected even when differential privacy is applied.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lutz2024optimizing,
  title  = {Optimizing Federated Learning by Entropy-Based Client Selection},
  author = {Andreas Lutz and Gabriele Steidl and Karsten Müller and Wojciech Samek},
  year   = {2024},
  eprint = {2411.01240},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.01240v3}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.01240.svg)](https://codeofpaper.com/paper/2411.01240)

Discussion