An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs
From MaRDI portal
Publication:6136231
Abstract: We prove a central limit theorem for the entropic transportation cost between subgaussian probability measures, centered at the population cost. This is the first result which allows for asymptotically valid inference for entropic optimal transport between measures which are not necessarily discrete. In the compactly supported case, we complement these results with new, faster, convergence rates for the expected entropic transportation cost between empirical measures. Our proof is based on strengthening convergence results for dual solutions to the entropic optimal transport problem.
Cites work
- scientific article; zbMATH DE number 1022658 (Why is no real title available?)
- scientific article; zbMATH DE number 7370595 (Why is no real title available?)
- A central limit theorem for Lp transportation cost on the real line with application to fairness assessment in machine learning
- Asymptotics for L₂ functionals of the empirical quantile process, with applications to tests of fit based on weighted Wasserstein distances
- Asymptotics for semidiscrete entropic optimal transport
- Bracketing smooth functions
- Central limit theorems for empirical transportation cost in general dimension
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Central limit theorems for the Wasserstein distance between the empirical and the true distributions
- Computational optimal transport. With applications to data sciences
- Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach
- Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs
- Empirical optimal transport on countable metric spaces: distributional limits and statistical applications
- Empirical regularized optimal transport: statistical theory and applications
- Entropic optimal transport is maximum-likelihood deconvolution
- Entropic optimal transport: convergence of potentials
- Entropy-regularized 2-Wasserstein distance between Gaussian measures
- I-divergence geometry of probability distributions and minimization problems
- Inference for empirical Wasserstein distances on finite spaces
- Large Sample Properties of Matching Estimators for Average Treatment Effects
- Mathematical foundations of infinite-dimensional statistical models
- Minimax estimation of smooth optimal transport maps
- Monge-Kantorovich depth, quantiles, ranks and signs
- Multivariate Rank-Based Distribution-Free Nonparametric Testing Using Measure Transportation
- Multivariate goodness-of-fit tests based on Wasserstein distance
- Multivariate ranks and quantiles using optimal transport: consistency, rates and nonparametric testing
- On universally consistent and fully distribution-free rank tests of vector independence
- Quantitative stability of regularized optimal transport and convergence of Sinkhorn's algorithm
- Robust Wasserstein profile inference and applications to machine learning
- Sharp asymptotic and finite-sample rates of convergence of empirical measures in Wasserstein distance
- Stability of Schrödinger potentials and convergence of Sinkhorn's algorithm
- Stability of entropic optimal transport and Schrödinger bridges
- Tackling algorithmic bias in neural-network classifiers using Wasserstein-2 regularization
- The Earth Mover's Correlation
- The Sinkhorn algorithm, parabolic optimal transport and geometric Monge-Ampère equations
- Two-sample goodness-of-fit tests on the flat torus based on Wasserstein distance and their relevance to structural biology
- Uncoupled isotonic regression via minimum Wasserstein deconvolution
- Wasserstein discriminant analysis
- Weak convergence and empirical processes. With applications to statistics
Cited in
(12)- Limit distributions and sensitivity analysis for empirical entropic optimal transport on countable spaces
- Diffeomorphic Registration Using Sinkhorn Divergences
- A unifying approach to distributional limits for empirical optimal transport
- Limit distribution theory for smooth \(p\)-Wasserstein distances
- Central limit theorems for semi-discrete Wasserstein distances
- Gromov-Wasserstein distances: entropic regularization, duality and sample complexity
- Monge-Kantorovich superquantiles and expected shortfalls with applications to multivariate risk measurements
- Central limit theorems for entropy-regularized optimal transport on finite spaces and statistical applications
- Stability and sample complexity of divergence regularized optimal transport
- A central limit theorem for Lp transportation cost on the real line with application to fairness assessment in machine learning
- Uniform confidence band for optimal transport map on one-dimensional data
- Statistical inference with regularized optimal transport
This page was built for publication: An Improved Central Limit Theorem and Fast Convergence Rates for Entropic Transportation Costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136231)
