FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning
Emmanouil Kritharakis, Antonios Makris, Dusan Jakovetic, Konstantinos Tserpes

TL;DR
FedGreed is a robust aggregation method for federated learning that effectively defends against Byzantine attacks without prior knowledge of the attack fraction, ensuring reliable model training even with heterogeneous data.
Contribution
It introduces FedGreed, a loss-based aggregation strategy that operates under arbitrary adversarial presence and non-IID data, with proven convergence guarantees.
Findings
Outperforms standard and robust baselines in adversarial scenarios
Effective under non-IID data distributions
Demonstrates convergence and bounded optimality gaps
Abstract
Federated Learning (FL) enables collaborative model training across multiple clients while preserving data privacy by keeping local datasets on-device. In this work, we address FL settings where clients may behave adversarially, exhibiting Byzantine attacks, while the central server is trusted and equipped with a reference dataset. We propose FedGreed, a resilient aggregation strategy for federated learning that does not require any assumptions about the fraction of adversarial participants. FedGreed orders clients' local model updates based on their loss metrics evaluated against a trusted dataset on the server and greedily selects a subset of clients whose models exhibit the minimal evaluation loss. Unlike many existing approaches, our method is designed to operate reliably under heterogeneous (non-IID) data distributions, which are prevalent in real-world deployments. FedGreed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
