Search arXivSearch

arXiv · 2608.00649

Empirical optimal transport potentials: fast rates and a functional central limit theorem

Abstract

Optimal transport potentials are fundamental objects in statistics, economics, and machine learning: their gradients generate optimal transport maps, while the potentials themselves act as location-dependent dual prices and sensitivity variables. We study the estimation of the quadratic optimal transport potential when a fixed absolutely continuous reference distribution $μ$ is transported to an unknown distribution $ν$, accessed to via its empirical measure. Our main ingredient is a stability inequality that controls the $L^1(μ)$ distance, modulo additive constants, between a strongly convex potential $φ$ and a convex potential $\widetildeφ$ by a weak dual norm of $(\nabla\widetildeφ)_\#μ-(\nablaφ)_\#μ,$ together with a second-order Wasserstein remainder of logarithmic type. This separation between the leading empirical-process term and the Wasserstein remainder yields faster convergence for potentials than for the corresponding transport maps. Under smoothness and uniform convexity assumptions, the exact semidiscrete Brenier potential converges in $L^1(μ)$ at rate $n^{-1/2}$ for $d\leq3$, at rate $n^{-1/2}(\log n)^{5/2}$ for $d=4$, and at rate $n^{-2/d}(\log n)^{(d+2)/d}$ for $d\geq5$. The polynomial exponents are sharp. In dimensions $d\leq3$, we further establish a nondegenerate function-space central limit theorem and prove consistency of the nonparametric bootstrap. These results yield joint root-$n$ inference for every fixed finite collection of normalization-invariant weighted contrasts of the potential, including regional shadow premia in reference-based risk problems. Finally, we prove matching upper and lower bounds of order $\varepsilon\log(1/\varepsilon)$ for the normalization-invariant sum of the entropic dual potentials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alberto González-Sanz, Gilles Mordant, Shunan Sheng. 2026-08-01. Empirical optimal transport potentials: fast rates and a functional central limit theorem. https://arxiv.org/abs/2608.00649

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Functional independent component analysis by choice of norm: a framework for near-perfect classification

We develop a theory for functional independent component analysis in an infinite-dimensional framework using Sobolev spaces that accommodate smoother functions. The notion of penalized kurtosis is introduced motivated by Silverman's method for smoothing principal components. This approach allows for a classical definition of independent components obtained via projection onto the eigenfunctions of a smoothed kurtosis operator mapping a whitened functional random variable. We discuss the theoretical properties of this operator in relation to a generalized Fisher discriminant function and the relationship it entails with the Feldman-Hájek dichotomy for Gaussian measures, both of which are critical to the principles of functional classification. The proposed estimators are a particularly competitive alternative in binary classification of functional data and can eventually achieve the so-called near-perfect classification, which is a genuine phenomenon of high-dimensional data. Our methods are illustrated through simulations, various real datasets, and used to model electroencephalographic biomarkers for the diagnosis of depressive disorder.

math.ST

Trace-Class Results for MCMC Algorithms for Student-$t$ Regression Models

In this paper, we consider MCMC algorithms for Student-$t$ regression models. In three cases, we investigate the efficiency of Markov chains based on the algorithms in terms of whether trace-class results hold or not. First, we consider the case where the parameters follow a matrix-normal-inverse-Wishart distribution and show that the Markov operator associated with a standard data augmentation algorithm is trace-class. Second, we consider the case of an improper prior and univariate outcomes. In this case, the standard Markov operator is not trace-class but the Markov operator associated with a collapsed Gibbs algorithm is trace-class. Third, we consider the case of an improper prior and multivariate outcomes. We obtain a trace-class result for a parameter expanded data augmentation algorithm which is based on a univariate working parameter. Finally, we consider the problem of numerially estimating a convergence rate of the trace-class Markov operator in the second case.

math.ST

The Manifold Hypothesis under Unknown Gaussian Noise:Conditional Certificates and Consistent Dimension Estimation

We study what noisy data can establish about the Manifold Hypothesis under explicit identification and regularity conditions. A population residual certificate combines independent-view localization, Gaussian concentration, membership uncertainty, and population transfer. Existing rectifiability criteria then yield a covered-scale consequence. For a local smooth manifold with positive Hölder density, the actual-ball covariance limit identifies the spectral crossing with geometric dimension. We prove almost-sure eventual recovery under repeated observations. Reusing accurate localization averages improves the sufficient point-sample condition from $Nr^{d+4}\gg\log N$ to $Nr^d\gg\log N$, with replication $kr^2\gg\log N$. A two-mass certificate controls incorrect geometric-dimension emissions under declared class bounds. For single observations with unknown Gaussian noise, affine-support or known coordinate-bound restrictions provide noise intervals and consistent Gaussian correlation-dimension estimators. Ahlfors regularity identifies this exponent with Hausdorff dimension and with the geometric dimension of a homogeneous smooth class. Exact Cantor calculations delineate the limits of integer spectral counts and adjacent-radius slopes. We credit established local PCA, rectifiability, concentration, binomial inference, and deconvolution results before specifying our constructions. Reproducible experiments distinguish point estimation, finite-scale coverage, and certificate emission.

math.ST