Show simple item record

dc.contributor.authorHanzely, Filip
dc.contributor.authorKonečný, Jakub
dc.contributor.authorLoizou, Nicolas
dc.contributor.authorRichtarik, Peter
dc.contributor.authorGrishchenko, Dmitry
dc.date.accessioned2017-12-28T07:32:15Z
dc.date.available2017-12-28T07:32:15Z
dc.date.issued2017-06-23
dc.identifier.urihttp://hdl.handle.net/10754/626539
dc.description.abstractIn 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.
dc.publisherarXiv
dc.relation.urlhttp://arxiv.org/abs/1706.07636v1
dc.relation.urlhttp://arxiv.org/pdf/1706.07636v1
dc.rightsArchived with thanks to arXiv
dc.titlePrivacy preserving randomized gossip algorithms
dc.typePreprint
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.eprint.versionPre-print
dc.contributor.institutionUniversity of Edinburgh, UK
dc.contributor.institutionHigher School of Economics, Russia
dc.identifier.arxividarXiv:1706.07636
kaust.personRichtarik, Peter
dc.versionv1
refterms.dateFOA2018-06-13T12:20:41Z


Files in this item

Thumbnail
Name:
1706.07636v1.pdf
Size:
2.613Mb
Format:
PDF
Description:
Preprint

This item appears in the following Collection(s)

Show simple item record