Show simple item record

A Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion

dc.contributor.authorHanzely, Filip
dc.contributor.authorKonečný, Jakub
dc.contributor.authorLoizou, Nicolas
dc.contributor.authorRichtarik, Peter
dc.contributor.authorGrishchenko, Dmitry
dc.date.accessioned2019-05-29T07:58:37Z
dc.date.available2019-05-29T07:58:37Z
dc.date.issued2019-01-27
dc.identifier.urihttp://hdl.handle.net/10754/653119
dc.description.abstractIn this work we present a randomized gossip algorithm for solving the averageconsensus problem while at the same time protecting the information about theinitial private values stored at the nodes. We give iteration complexity boundsfor the method and perform extensive numerical experiments.
dc.publisherarXiv
dc.relation.urlhttps://arxiv.org/pdf/1901.09367
dc.rightsArchived with thanks to arXiv
dc.titleA Privacy Preserving Randomized Gossip Algorithm via Controlled Noise Insertion
dc.typePreprint
dc.contributor.departmentApplied Mathematics and Computational Science
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer Science
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.eprint.versionPre-print
dc.contributor.institutionGoogle, USA
dc.contributor.institutionUniversity of Edinburgh, UK
dc.contributor.institutionMoscow Institute of Physics and Technology, Russia
dc.contributor.institutionUniversité Grenoble Alpes, France
dc.identifier.arxivid1901.09367
kaust.personHanzely, Filip
kaust.personRichtarik, Peter
dc.versionv1
refterms.dateFOA2019-05-29T07:58:46Z


Files in this item

Thumbnail
Name:
1901.09367.pdf
Size:
299.2Kb
Format:
PDF
Description:
Preprint
Download

This item appears in the following Collection(s)

Show simple item record