REVIEW 1 cited by
Distributed Optimization with Quantization for Computing Wasserstein Barycenters
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We study the problem of the decentralized computation of entropy-regularized semi-discrete Wasserstein barycenters over a network. Building upon recent primal-dual approaches, we propose a sampling gradient quantization scheme that allows efficient communication and computation of approximate barycenters where the factor distributions are stored distributedly on arbitrary networks. The communication and algorithmic complexity of the proposed algorithm are shown, with explicit dependency on the size of the support, the number of distributions, and the desired accuracy. Numerical results validate our algorithmic analysis.
Forward citations
Cited by 1 Pith paper
-
Decentralised convex optimisation with probability-proportional-to-size quantization
The authors propose PPS quantization for distributed optimization and derive accelerated methods with large deviation bounds.
Discussion (0). Continue with ORCID to comment.