mlsanityData to 14 Oct 2026

Incentivizing Honesty among Competitors in Collaborative Learning and Optimization

arXiv 2305.16272 ↗First posted 25 May 2023cs.LG cs.GT stat.MLcited by 6

Not on the map. Why?

Abstract (arXiv)

Collaborative learning techniques have the potential to enable training machine learning models that are superior to models trained on a single entity's data. However, in many cases, potential participants in such collaborative schemes are competitors on a downstream task, such as firms that each aim to attract customers by providing the best recommendations. This can incentivize dishonest updates that damage other participants' models, potentially undermining the benefits of collaboration. In this work, we formulate a game that models such interactions and study two learning tasks within this framework: single-round mean estimation and multi-round SGD on strongly-convex objectives. For a natural class of player actions, we show that rational clients are incentivized to strongly manipulate their updates, preventing learning. We then propose mechanisms that incentivize honest communication and ensure learning quality comparable to full cooperation. Lastly, we empirically demonstrate the effectiveness of our incentive scheme on a standard non-convex federated learning benchmark. Our work shows that explicitly modeling the incentives and actions of dishonest clients, rather than assuming them malicious, can enable strong robustness guarantees for collaborative learning.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 22 of its 37 references that are in the map. First posted on arXiv 25 May 2023.

Builds on

22 of 37 references.

References · 22

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  5. 2018LEAF: A Benchmark for Federated Settingscited by 792
  6. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  7. 2020Data Poisoning Attacks Against Federated Learning Systemscited by 275
  8. 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
  9. 2021Back to the Drawing Board: A Critical Evaluation of Poisoning Attacks on Production Federated Learningcited by 118
  10. 2018Byzantine Stochastic Gradient Descentcited by 81
  11. 2020Model-sharing Games: Analyzing Federated Learning Under Voluntary Participationcited by 60
  12. 2020Mitigating Bias in Federated Learningcited by 56
10 more
  1. 2021Incentive Mechanisms for Federated Learning: From Economic and Game Theoretic Perspectivecited by 47
  2. 2021Optimality and Stability in Federated Learning: A Game-theoretic Approachcited by 40
  3. 2022Mechanisms that Incentivize Data Sharing in Federated Learningcited by 39
  4. 2014Optimum Statistical Estimation with Strategic Data Sourcescited by 28
  5. 2017Learning Discrete Distributions from Untrusted Batchescited by 14
  6. 2022FL Games: A Federated Learning Framework for Distribution Shiftscited by 14
  7. 2020On the Sample Complexity of Adversarial Multi-Source PAC Learningcited by 11
  8. 2021Linear Speedup in Personalized Collaborative Learningcited by 9
  9. 2021Optimal Model Averaging: Towards Personalized Collaborative Learningcited by 7
  10. 2020Coopetition Against an Amazoncited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 3; 2025: 2; 2026: 1.

6 papers.