TL;DR
This paper introduces CMFL, a decentralized federated learning framework with a committee mechanism that enhances robustness against Byzantine attacks while ensuring convergence, outperforming traditional methods in accuracy and speed.
Contribution
The paper proposes a novel serverless federated learning framework with a committee system for gradient screening, providing convergence guarantees and improved robustness.
Findings
CMFL achieves faster convergence than typical federated learning.
CMFL provides better robustness against Byzantine attacks.
Theoretical analysis confirms convergence under various strategies.
Abstract
Federated learning allows multiple participants to collaboratively train an efficient model without exposing data privacy. However, this distributed machine learning training method is prone to attacks from Byzantine clients, which interfere with the training of the global model by modifying the model or uploading the false gradient. In this paper, we propose a novel serverless federated learning framework Committee Mechanism based Federated Learning (CMFL), which can ensure the robustness of the algorithm with convergence guarantee. In CMFL, a committee system is set up to screen the uploaded local gradients. The committee system selects the local gradients rated by the elected members for the aggregation procedure through the selection strategy, and replaces the committee member through the election strategy. Based on the different considerations of model performance and defense, two…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
