Distributed Computation of Wasserstein Barycenters over Networks
2018 IEEE Conference on Decision and Control (CDC)(2018)
摘要
We propose a new \cu{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 can reach the barycenter of all distributions held in the network by using local interactions compliant with the topology of the graph. We provide an estimate for 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.
更多查看译文
关键词
distributed computation,class-optimal algorithm,probability distribution,local interactions compliant,undirected fixed networks,Wasserstein barycenters,graph topology
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络