Distributed Computation of Wasserstein Barycenters over Networks

03/08/2018
by   César A. Uribe, et al.
0

We propose a new class-optimal algorithm for the distributed computation of Wasserstein Barycenters over networks. Assuming that each node in a graph has a probability distribution, we prove that every node is able to reach the barycenter of all distributions held in the network by using local interactions compliant with the topology of the graph. We show the minimum number of communication rounds required for the proposed method to achieve arbitrary relative precision both in the optimality of the solution and the consensus among all agents for undirected fixed networks.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 12

11/06/2020

Communication-efficient Decentralized Local SGD over Undirected Networks

We consider the distributed learning problem where a network of n agents...
06/11/2018

Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters

We study the problem of decentralized distributed computation of a discr...
09/14/2021

Scalable Average Consensus with Compressed Communications

We propose a new decentralized average consensus algorithm with compress...
02/15/2021

Decentralized Distributed Optimization for Saddle Point Problems

We consider distributed convex-concave saddle point problems over arbitr...
11/19/2018

Distributed Learning of Average Belief Over Networks Using Sequential Observations

This paper addresses the problem of distributed learning of average beli...
07/09/2019

Randomized Constraints Consensus for Distributed Robust Mixed-Integer Programming

In this paper, we consider a network of processors aiming at cooperative...
12/15/2020

Distributed Wasserstein Barycenters via Displacement Interpolation

Consider a multi-agent system whereby each agent has an initial probabil...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.