Privacy Preserving Randomized Gossip Algorithms

Dmitry Grishchenko; Filip Hanzely; Jakub Kone\v{c}n\'y; Nicolas Loizou; Peter Richt\'arik

REVIEW

Privacy Preserving Randomized Gossip Algorithms

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1706.07636 v1 pith:J4RD3WL6 submitted 2017-06-23 math.OC

Privacy Preserving Randomized Gossip Algorithms

Filip Hanzely , Jakub Kone\v{c}n\'y , Nicolas Loizou , Peter Richt\'arik , Dmitry Grishchenko This is my paper

classification math.OC

keywords algorithmsgossiprandomizedaverageboundscomplexityconsensusdifferent

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original 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.

Privacy Preserving Randomized Gossip Algorithms

discussion (0)