Papers › Efficient and Exact Multimarginal Optimal Transport with Pairwise Costs
Efficient and Exact Multimarginal Optimal Transport with Pairwise Costs
Bohan Zhou, Matthew Parno
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In this paper, we address the numerical solution to the multimarginal optimal transport (MMOT) with pairwise costs. MMOT, as a natural extension from the classical two-marginal optimal transport, has many important applications including image processing, density functional theory and machine learning, but yet lacks efficient and exact numerical methods. The popular entropy-regularized method may suffer numerical instability and blurring issues. Inspired by the back-and-forth method introduced by Jacobs and L\'{e}ger, we investigate MMOT problems with pairwise costs. First, such problems have a graphical representation and we prove equivalent MMOT problems that have a tree representation. Second, we introduce a noval algorithm to solve MMOT on a rooted tree, by gradient based method on the dual formulation. Last, we obtain accurate solutions which can be used for the regularization-free applications.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections