Statistical bounds for entropic optimal transport: sample complexity and the central limit theorem
We prove several fundamental statistical bounds for entropic OT with the squared Euclidean cost between subgaussian probability measures in arbitrary dimension. First, through a new sample complexity result we establish the rate of convergence of entropic OT for empirical measures. Our analysis impr...
Main Authors: | Mena, G, Weed, J |
---|---|
Format: | Conference item |
Language: | English |
Published: |
MIT Press
2019
|
Similar Items
-
Entropic optimal transport is maximum-likelihood deconvolution
by: Rigollet, Philippe, et al.
Published: (2020) -
Nonequilibrium Entropic Bounds for Darwinian Replicators
by: Jordi Piñero, et al.
Published: (2018-01-01) -
Multivariate central limit theorems for random clique complexes
by: Temčinas, T, et al.
Published: (2023) -
Limit theorems and statistics /
by: 402258 Trees, Harry Van
Published: (1970) -
Approximate Counting and Sampling via Local Central Limit Theorems
by: Jain, Vishesh, et al.
Published: (2022)