REVIEW 2 cited by
Mechanisms that Incentivize Data Sharing in Federated Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Federated learning is typically considered a beneficial technology which allows multiple agents to collaborate with each other, improve the accuracy of their models, and solve problems which are otherwise too data-intensive / expensive to be solved individually. However, under the expectation that other agents will share their data, rational agents may be tempted to engage in detrimental behavior such as free-riding where they contribute no data but still enjoy an improved model. In this work, we propose a framework to analyze the behavior of such rational data generators. We first show how a naive scheme leads to catastrophic levels of free-riding where the benefits of data sharing are completely eroded. Then, using ideas from contract theory, we introduce accuracy shaping based mechanisms to maximize the amount of data generated by each agent. These provably prevent free-riding without needing any payment mechanism.
Forward citations
Cited by 2 Pith papers
-
Compensation Design
Under monotone submodular platform value and private agent costs, the marginal-contribution payment rule admits pure Nash equilibria and a tight price of anarchy of 2+o(1), while Shapley-value payments can have no pur...
-
Adaptive collaboration for online personalized distributed learning with heterogeneous clients
An adaptive gradient-similarity criterion dynamically selects collaboration partners in personalized federated learning, provably recovering the oracle-optimal sample complexity of All-for-one without knowing client h...
Discussion (0). Sign in to comment.