Article Robust Aggregation for Federated Learning by Minimum γ-Divergence Estimation

10Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

Federated learning is a framework for multiple devices or institutions, called local clients, to collaboratively train a global model without sharing their data. For federated learning with a central server, an aggregation algorithm integrates model information sent from local clients to update the parameters for a global model. Sample mean is the simplest and most commonly used aggregation method. However, it is not robust for data with outliers or under the Byzantine problem, where Byzantine clients send malicious messages to interfere with the learning process. Some robust aggregation methods were introduced in literature including marginal median, geometric median and trimmed-mean. In this article, we propose an alternative robust aggregation method, named γ-mean, which is the minimum divergence estimation based on a robust density power divergence. This γ-mean aggregation mitigates the influence of Byzantine clients by assigning fewer weights. This weighting scheme is data-driven and controlled by the γ value. Robustness from the viewpoint of the influence function is discussed and some numerical results are presented.

Cite

CITATION STYLE

APA

Li, C. J., Huang, P. H., Ma, Y. T., Hung, H., & Huang, S. Y. (2022). Article Robust Aggregation for Federated Learning by Minimum γ-Divergence Estimation. Entropy, 24(5). https://doi.org/10.3390/e24050686

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free