DeepAI AI Chat
Log In Sign Up

Empirical Optimal Transport between Different Measures Adapts to Lower Complexity

by   Shayan Hundrieser, et al.

The empirical optimal transport (OT) cost between two probability measures from random data is a fundamental quantity in transport based data analysis. In this work, we derive novel guarantees for its convergence rate when the involved measures are different, possibly supported on different spaces. Our central observation is that the statistical performance of the empirical OT cost is determined by the less complex measure, a phenomenon we refer to as lower complexity adaptation of empirical OT. For instance, under Lipschitz ground costs, we find that the empirical OT cost based on n observations converges at least with rate n^-1/d to the population quantity if one of the two measures is concentrated on a d-dimensional manifold, while the other can be arbitrary. For semi-concave ground costs, we show that the upper bound for the rate improves to n^-2/d. Similarly, our theory establishes the general convergence rate n^-1/2 for semi-discrete OT. All of these results are valid in the two-sample case as well, meaning that the convergence rate is still governed by the simpler of the two measures. On a conceptual level, our findings therefore suggest that the curse of dimensionality only affects the estimation of the OT cost when both measures exhibit a high intrinsic dimension. Our proofs are based on the dual formulation of OT as a maximization over a suitable function class ℱ_c and the observation that the c-transform of ℱ_c under bounded costs has the same uniform metric entropy as ℱ_c itself.


page 1

page 2

page 3

page 4


Sharp Convergence Rates for Empirical Optimal Transport with Smooth Costs

We revisit the question of characterizing the convergence rate of plug-i...

An improved central limit theorem and fast convergence rates for entropic transportation costs

We prove a central limit theorem for the entropic transportation cost be...

Learning Probability Measures with respect to Optimal Transport Metrics

We study the problem of estimating, in the sense of optimal transport me...

Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem

We prove several fundamental statistical bounds for entropic OT with the...

Transport Dependency: Optimal Transport Based Dependency Measures

Finding meaningful ways to determine the dependency between two random v...

Empirical Optimal Transport under Estimated Costs: Distributional Limits and Statistical Applications

Optimal transport (OT) based data analysis is often faced with the issue...

Sparse approximation of triangular transports on bounded domains

Let ρ and π be two probability measures on [-1,1]^d with positive and an...