Privacy Preserving Randomized Gossip Algorithms
arXiv:1706.07636
Abstract
In this work we present three different randomized gossip algorithms 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 all methods, and perform extensive numerical experiments.
38 pages
References in corpus (6)
- Even Faster Accelerated Coordinate Descent Using Non-Uniform Sampling
- Stochastic Dual Ascent for Solving Linear Systems
- Smooth minimization of nonsmooth functions with parallel coordinate descent methods
- Stochastic Dual Coordinate Ascent with Adaptive Probabilities
- Linearly Convergent Randomized Iterative Methods for Computing the Pseudoinverse
- Randomized Quasi-Newton Updates are Linearly Convergent Matrix Inversion Algorithms
Cited by in corpus (6)
- Stochastic, Distributed and Federated Optimization for Machine Learning
- A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion
- Hiding in the Crowd: A Massively Distributed Algorithm for Private Averaging with Malicious Adversaries
- Randomized Iterative Methods for Linear Systems: Momentum, Inexactness and Gossip
- Differentially Private Distributed Computation via Public-Private Communication Networks
- Greed Works: An Improved Analysis of Sampling Kaczmarz-Motzkin