LGCRMay 2, 2022

Performance Weighting for Robust Federated Learning Against Corrupted Sources

arXiv:2205.01184v19 citationsh-index: 40
Originality Incremental advance
AI Analysis

This work addresses the critical issue of data corruption in federated learning, which is essential for maintaining model performance and privacy in real-world distributed applications, though it is incremental as it builds on existing robust aggregation methods.

The paper tackled the problem of federated learning's vulnerability to data corruption attacks from malicious clients by proposing a performance-based weighting method using a distributed validation dataset, demonstrating its effectiveness with geometric mean aggregation against label shuffling and flipping attacks.

Federated Learning has emerged as a dominant computational paradigm for distributed machine learning. Its unique data privacy properties allow us to collaboratively train models while offering participating clients certain privacy-preserving guarantees. However, in real-world applications, a federated environment may consist of a mixture of benevolent and malicious clients, with the latter aiming to corrupt and degrade federated model's performance. Different corruption schemes may be applied such as model poisoning and data corruption. Here, we focus on the latter, the susceptibility of federated learning to various data corruption attacks. We show that the standard global aggregation scheme of local weights is inefficient in the presence of corrupted clients. To mitigate this problem, we propose a class of task-oriented performance-based methods computed over a distributed validation dataset with the goal to detect and mitigate corrupted clients. Specifically, we construct a robust weight aggregation scheme based on geometric mean and demonstrate its effectiveness under random label shuffling and targeted label flipping attacks.

Foundations

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

Your Notes