Geometry-Aware Optimal Transport: Fast Intrinsic Dimension and Wasserstein Distance Estimation
arXiv:2602.04335v1 Announce Type: new Abstract: Solving large scale Optimal Transport (OT) in machine learning typically relies on sampling measures to obtain a tractable discrete problem. While the discrete solver’s accuracy is controllable, the rate of convergence of the discretization error is governed by the intrinsic dimension of our data. Therefore, the true bottleneck is the knowledge and control of the sampling error. In this work, we tackle this issue by introducing novel estimators for both sampling error and […]