AI Paper Atlas

Research map / Learning theory and algorithms / Optimal transport

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

Gonzalo Mena, Jonathan Niles-Weed

NeurIPS 2019 · Learning theory and algorithms › Optimal transport · approach: Sinkhorn and entropic OT algorithms · 41 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the new empirical-process analysis for entropic OT on subgaussian measures, including unbounded measuresEmpirical entropic OT · Subgaussian measures in R^dexpected absolute estimation error: K_d (1 + σ^{⌈5d/2⌉ + 6})/√n; Genevay et al.: K_{D,d} (1 + 1/ε^{⌊d/2⌋}) e^{D²/ε}/√nImproved
Draw Q_n by adding Gaussian noise to the same P_n samples instead of using independent samplesEntropic OT entropy estimator · Gaussian-mixture entropy estimation simulationconvergence speedImproved
Increase dimension or decrease the regularization parameterEmpirical entropic OT · Gaussian-mixture simulationestimation qualityHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy