FedRandom: Sampling Consistent and Accurate Contribution Values in Federated Learning
Arno Geimer, Beltran Fiz Pontiveros, Radu State

TL;DR
FedRandom is a novel method that improves the stability and accuracy of contribution evaluation in federated learning by generating additional samples, addressing the inherent instability issues of existing strategies.
Contribution
FedRandom introduces a statistical estimation approach that produces more samples for consistent contribution assessment in federated learning.
Findings
Reduces the distance to ground truth by over 33% in many scenarios
Improves contribution stability in over 90% of cases
Effective across multiple datasets and data distributions
Abstract
Federated Learning is a privacy-preserving decentralized approach for Machine Learning tasks. In industry deployments characterized by a limited number of entities possessing abundant data, the significance of a participant's role in shaping the global model becomes pivotal given that participation in a federation incurs costs, and participants may expect compensation for their involvement. Additionally, the contributions of participants serve as a crucial means to identify and address potential malicious actors and free-riders. However, fairly assessing individual contributions remains a significant hurdle. Recent works have demonstrated a considerable inherent instability in contribution estimations across aggregation strategies. While employing a different strategy may offer convergence benefits, this instability can have potentially harming effects on the willingness of participants…
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.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Ethics and Social Impacts of AI · Mobile Crowdsensing and Crowdsourcing
