A reproducing kernel Hilbert space embedding yields a sample-only objective for solving continuum-marginal optimal transport without spatial discretization.
Sinkhorn distances: Lightspeed computation of optimal transport
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative 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.
Graph Normalization is a convergent dynamical system that approximates MWIS by always reaching a binary maximum independent set via majorization-minimization and evolutionary game equivalence.
citing papers explorer
-
Continuum-marginal optimal transport: a mesh-free kernel method
A reproducing kernel Hilbert space embedding yields a sample-only objective for solving continuum-marginal optimal transport without spatial discretization.
-
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.
-
Graph Normalization: Fast Binarizing Dynamics for Differentiable MWIS
Graph Normalization is a convergent dynamical system that approximates MWIS by always reaching a binary maximum independent set via majorization-minimization and evolutionary game equivalence.