A decentralized Sinkhorn algorithm approximates Wasserstein barycenters using local gossip protocols, event-triggered transmissions, and b-bit quantization, with proven convergence to a neighborhood of the centralized entropic solution under mild assumptions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2representative citing papers
PINS combines an outer proximal-point loop over shifted entropic OT problems with inner Sinkhorn warm-up and sparse-Newton refinement to reach unregularized OT solutions with global convergence and lower error than Sinkhorn baselines.
citing papers explorer
-
Geometry-Aware Decentralized Sinkhorn for Wasserstein Barycenters
A decentralized Sinkhorn algorithm approximates Wasserstein barycenters using local gossip protocols, event-triggered transmissions, and b-bit quantization, with proven convergence to a neighborhood of the centralized entropic solution under mild assumptions.
-
PINS: Proximal Iterations with Sparse Newton and Sinkhorn for Optimal Transport
PINS combines an outer proximal-point loop over shifted entropic OT problems with inner Sinkhorn warm-up and sparse-Newton refinement to reach unregularized OT solutions with global convergence and lower error than Sinkhorn baselines.