GenusSink achieves near-linear time approximate generalized Sinkhorn for geodesic optimal transport on bounded-genus graphs by combining separator-based decompositions with Fourier and low-displacement-rank matrix-vector multiplications.
Gromov-wasserstein averaging of kernel and distance matrices
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Near-Linear Time Generalized Sinkhorn Algorithms for Bounded Genus Graphs
GenusSink achieves near-linear time approximate generalized Sinkhorn for geodesic optimal transport on bounded-genus graphs by combining separator-based decompositions with Fourier and low-displacement-rank matrix-vector multiplications.