Privacy Preserving Randomized Gossip Algorithms

Filip Hanzely; Jakub Konečný; Nicolas Loizou; Peter Richtárik; Dmitry Grishchenko

Privacy Preserving Randomized Gossip Algorithms

Filip Hanzely, Jakub Konečný, Nicolas Loizou, Peter Richtárik, Dmitry Grishchenko

School of Mathematics

Research output: Working paper

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.

Original language	English
Publisher	ArXiv
Publication status	Published - 23 Jun 2017

Keywords

math.OC

Access to Document

1706.07636v1Other version, 2.61 MB

Cite this

@techreport{67a26cc818b849d2810fe8f036c611c9,

title = "Privacy Preserving Randomized Gossip Algorithms",

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.",

keywords = "math.OC",

author = "Filip Hanzely and Jakub Kone{\v c}n{\'y} and Nicolas Loizou and Peter Richt{\'a}rik and Dmitry Grishchenko",

note = "38 pages",

year = "2017",

month = jun,

day = "23",

language = "English",

publisher = "ArXiv",

type = "WorkingPaper",

institution = "ArXiv",

}

TY - UNPB

T1 - Privacy Preserving Randomized Gossip Algorithms

AU - Hanzely, Filip

AU - Konečný, Jakub

AU - Loizou, Nicolas

AU - Richtárik, Peter

AU - Grishchenko, Dmitry

N1 - 38 pages

PY - 2017/6/23

Y1 - 2017/6/23

N2 - 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.

AB - 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.

KW - math.OC

M3 - Working paper

BT - Privacy Preserving Randomized Gossip Algorithms

PB - ArXiv

ER -

Privacy Preserving Randomized Gossip Algorithms

Abstract

Keywords

Access to Document

Fingerprint

Cite this