提出首个无需中心服务器的分布式梯度诚实激励机制,保障学习收敛与行为诚实。
Gradient Manipulation in Distributed Stochastic Gradient Descent with Strategic Agents: Truthful Incentives with Convergence Guarantees
- 设计完全去中心化的支付机制,诱导各参与方诚实提交梯度。
- 证明在凸与强凸条件下可保证收敛,且策略性行为收益始终有限。
- 适用于存在自私节点的联邦学习场景,如隐私敏感的多方协作训练。
分布式学习因其可扩展性、隐私保护和容错能力受到广泛关注。在此范式中,多个代理通过仅与邻居交换参数的方式协同训练全局模型。然而,现有方法隐含假设所有代理在梯度更新时均诚实行为。在真实场景中,该假设常被打破——自私或策略性代理可能为自身利益操纵梯度,最终损害学习效果。本文首次提出一种全分布式支付机制,首次同时保证梯度更新的诚实性与准确收敛性,突破了现有机制两大局限:(1)依赖中心化服务器进行支付;(2)为保证诚实性牺牲收敛精度。我们还在一般凸和强凸条件下刻画了收敛速率,并证明:即使迭代次数趋于无穷,代理通过策略行为所能获得的累积收益仍为有限值——这一性质为多数现有机制所无法实现。在标准机器学习任务及基准数据集上的实验结果验证了该方法的有效性。
原文摘要 · Abstract (English)
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 truthfulness mechanisms for collaborative learning:(1) reliance on a centralized server for payment collection, and (2) sacrificing convergence accuracy to guarantee truthfulness. In addition to characterizing the convergence rate under general convex and strongly convex conditions, we also prove that our approach guarantees the cumulative gain that an agent can obtain through strategic behavior remains finite, even as the number of iterations approaches infinity--a property unattainable by most existing truthfulness mechanisms. Our experimental results on standard machine learning tasks, evaluated on benchmark datasets, confirm the effectiveness of the proposed approach.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。