A collision-based Monte Carlo algorithm approximates multi-marginal optimal transport by random pairwise index swaps, running in O(n K^2 Np) time and O(n K Np) memory.
Fast and robust earth mover’s distances
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Collision-based Dynamics for Multi-Marginal Optimal Transport
A collision-based Monte Carlo algorithm approximates multi-marginal optimal transport by random pairwise index swaps, running in O(n K^2 Np) time and O(n K Np) memory.