The reviewed record of science sign in
Pith

arxiv: 2205.10951 · v1 · pith:LJQ4ZRPH · submitted 2022-05-22 · cs.GT · cs.AI· cs.LG

Incentivizing Federated Learning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LJQ4ZRPHrecord.jsonopen to challenge →

classification cs.GT cs.AIcs.LG
keywords datalearningclientsfederatedcontributeincentivemodelthey
0
0 comments X
read the original abstract

Federated Learning is an emerging distributed collaborative learning paradigm used by many of applications nowadays. The effectiveness of federated learning relies on clients' collective efforts and their willingness to contribute local data. However, due to privacy concerns and the costs of data collection and model training, clients may not always contribute all the data they possess, which would negatively affect the performance of the global model. This paper presents an incentive mechanism that encourages clients to contribute as much data as they can obtain. Unlike previous incentive mechanisms, our approach does not monetize data. Instead, we implicitly use model performance as a reward, i.e., significant contributors are paid off with better models. We theoretically prove that clients will use as much data as they can possibly possess to participate in federated learning under certain conditions with our incentive mechanism

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Federated Learning by Utility-Constrained Stochastic Aggregation for Improving Rational Participation

    cs.LG 2026-05 unverdicted novelty 4.0

    FedUCA formalizes the server as an optimizer that uses utility-constrained stochastic aggregation to maximize client retention and global performance in heterogeneous federated learning.