Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Abstract:In this work we present a randomized gossip algorithm for solving the average consensus problem while at the same time protecting the information about the initial private values stored at the nodes. We give iteration complexity bounds for the method and perform extensive numerical experiments.
* NeurIPS 2018, Privacy Preserving Machine Learning Workshop (camera
ready version). The full-length paper, which includes a number of additional
algorithms and results (including proofs of statements and experiments), is
available in arXiv:1706.07636