Gradient Manipulation in Distributed Stochastic Gradient Descent with Strategic Agents: Truthful Incentives with Convergence Guarantees
Ziqin Chen, Yongqiang Wang

TL;DR
This paper introduces a distributed payment mechanism for stochastic gradient descent that ensures truthful agent behavior and convergence, addressing strategic manipulation in collaborative learning.
Contribution
It presents the first fully distributed payment scheme guaranteeing both truthfulness and convergence without relying on a central server.
Findings
Guarantees truthful behavior of agents in distributed SGD.
Ensures convergence with general convexity assumptions.
Maintains finite strategic gains over infinite iterations.
Abstract
Distributed learning has gained significant attention due to its advantages in scalability, privacy, and fault tolerance.In this paradigm, multiple agents collaboratively train a global model by exchanging parameters only with their neighbors. However, a key vulnerability of existing distributed learning approaches is their implicit assumption that all agents behave honestly during gradient updates. In real-world scenarios, this assumption often breaks down, as selfish or strategic agents may be incentivized to manipulate gradients for personal gain, ultimately compromising the final learning outcome. In this work, we propose a fully distributed payment mechanism that, for the first time, guarantees both truthful behaviors and accurate convergence in distributed stochastic gradient descent. This represents a significant advancement, as it overcomes two major limitations of existing…
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.
