Density-Reweighted Entropic Optimal Transport: Decoupling Geometry from Sampling Density
Not on the map. Why?
Abstract (arXiv)
Dataset alignment is a central step in data analysis across science and engineering, where the goal is to match observations between datasets. Entropic Optimal Transport (EOT) offers a computationally tractable framework for this task by encoding cross-dataset affinities in a transport plan. However, when two datasets are sampled from geometrically similar low-dimensional structures with substantially different sampling densities, the EOT plan may match points by relative sampling density rather than geometric proximity, yielding geometrically misleading correspondences. To address this issue, we propose a density-reweighted EOT framework in which the influence of sampling density on the transport plan can be discounted to a desired degree, ranging from standard EOT to alignment driven purely by underlying geometry. Under suitable regularity conditions, we establish convergence of the reweighted EOT plan to a family of population-level plans whose dependence on sampling density is made explicit. Through simulations, we show that our approach recovers geometrically faithful correspondences, improving over related EOT-based frameworks when datasets exhibit substantial sampling density disparity.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 34 references that are in the map. First posted on arXiv 17 Aug 2026.
Builds on
15 of 34 references.
References · 15
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Optimal Transport for Domain Adaptationcited by 463
- 2017Learning Generative Models with Sinkhorn Divergencescited by 314
- 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 282
- 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 223
- 2020Robust Optimal Transport with Applications in Generative Modeling and Domain Adaptationcited by 87
- 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
- 2023Recent Advances in Optimal Transport for Machine Learningcited by 66
- 2019Sinkhorn Divergences for Unbalanced Optimal Transportcited by 55
- 2022Unbalanced Optimal Transport, from Theory to Numericscited by 46
- 2021Accurate Point Cloud Registration with Robust Optimal Transportcited by 38
- 2019On the Efficiency of Entropic Regularized Algorithms for Optimal Transportcited by 35
Built on by
Not cited yet.