Robust Federated Learning with Multi-Step Aggregation
In this paper we address the problem of robust federated learning, where the coordinator needs to robustly aggregate locally trained models to minimize the impact of malicious agents. We start by analyzing the state-of-the-art robust aggregation techniques and highlighting their weaknesses, which we exploit to propose a novel attack strategy. We then counteract the proposed attack with a novel multi-step aggregation technique, which cascades three robust aggregation steps. We provide theoretical results characterizing the robustness of the proposed aggregation, and showing that how it outperforms the state of the art. Additionally, we characterize the convergence of a federated algorithm employing our proposed aggregation. We corroborate our theoretical results with experiments for a classification task.
Authors
- Nicola Bastianello (ORCID: https://orcid.org/0000-0002-5634-8802)
- Changxin Liu (ORCID: https://orcid.org/0000-0002-0819-5303)
- Abbas Pasdar
Institutions
- University of Padua (IT)
- East China University of Science and Technology (CN)
- KTH Royal Institute of Technology (SE)
Publication Details
- Journal
- IFAC-PapersOnLine
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1016/j.ifacol.2025.07.065
- Primary Topic
- Privacy-Preserving Technologies in Data
- Type
- article
- Field-Weighted Citation Impact
- 0.00