FedGreed sorts client updates by loss on a server-side trusted dataset and greedily averages the best prefix, claiming Byzantine robustness without knowing attacker count.
An overview of implementing security and privacy in federated learning,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
REJECT 1roles
background 1polarities
support 1representative citing papers
citing papers explorer
-
FedGreed: A Byzantine-Robust Loss-Based Aggregation Method for Federated Learning
FedGreed sorts client updates by loss on a server-side trusted dataset and greedily averages the best prefix, claiming Byzantine robustness without knowing attacker count.