LGJun 25, 2023

FedSampling: A Better Sampling Strategy for Federated Learning

arXiv:2306.14245v115 citationsh-index: 55
Originality Incremental advance
AI Analysis

This addresses performance issues in federated learning for privacy-sensitive applications, but it is incremental as it builds on existing sampling methods.

The paper tackles the problem of inferior performance in federated learning due to uniform client sampling, especially with imbalanced data sizes across clients, by proposing FedSampling, a data uniform sampling strategy that improves performance as shown in experiments on four benchmark datasets.

Federated learning (FL) is an important technique for learning models from decentralized data in a privacy-preserving way. Existing FL methods usually uniformly sample clients for local model learning in each round. However, different clients may have significantly different data sizes, and the clients with more data cannot have more opportunities to contribute to model training, which may lead to inferior performance. In this paper, instead of client uniform sampling, we propose a novel data uniform sampling strategy for federated learning (FedSampling), which can effectively improve the performance of federated learning especially when client data size distribution is highly imbalanced across clients. In each federated learning round, local data on each client is randomly sampled for local model learning according to a probability based on the server desired sample size and the total sample size on all available clients. Since the data size on each client is privacy-sensitive, we propose a privacy-preserving way to estimate the total sample size with a differential privacy guarantee. Experiments on four benchmark datasets show that FedSampling can effectively improve the performance of federated learning.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes