|国家预印本平台
首页|Bayesian Robust Aggregation for Federated Learning

Bayesian Robust Aggregation for Federated Learning

Bayesian Robust Aggregation for Federated Learning

来源:Arxiv_logoArxiv
英文摘要

Federated Learning enables collaborative training of machine learning models on decentralized data. This scheme, however, is vulnerable to adversarial attacks, when some of the clients submit corrupted model updates. In real-world scenarios, the total number of compromised clients is typically unknown, with the extent of attacks potentially varying over time. To address these challenges, we propose an adaptive approach for robust aggregation of model updates based on Bayesian inference. The mean update is defined by the maximum of the likelihood marginalized over probabilities of each client to be `honest'. As a result, the method shares the simplicity of the classical average estimators (e.g., sample mean or geometric median), being independent of the number of compromised clients. At the same time, it is as effective against attacks as methods specifically tailored to Federated Learning, such as Krum. We compare our approach with other aggregation schemes in federated setting on three benchmark image classification data sets. The proposed method consistently achieves state-of-the-art performance across various attack types with static and varying number of malicious clients.

Aleksandr Karakulev、Usama Zafar、Salman Toor、Prashant Singh

Uppsala UniversityUppsala UniversityUppsala UniversityUppsala University

计算技术、计算机技术

Aleksandr Karakulev,Usama Zafar,Salman Toor,Prashant Singh.Bayesian Robust Aggregation for Federated Learning[EB/OL].(2025-05-05)[2025-05-23].https://arxiv.org/abs/2505.02490.点此复制

评论