Core-Halo decomposition separates core updates from overlapping halo reads aligned to operator dependencies, enabling faithful decentralized implementation of fixed-point problems.
Fast linear iterations for distributed averaging.Systems & Control Letters, 53(1):65–78
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
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.
citing papers explorer
-
Core-Halo Decomposition: Decentralizing Large-Scale Fixed-Point Problems
Core-Halo decomposition separates core updates from overlapping halo reads aligned to operator dependencies, enabling faithful decentralized implementation of fixed-point problems.
-
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.