mlsanityData to 7 Oct 2026

Minimum intrinsic dimension scaling for entropic optimal transport

arXiv 2306.03398 ↗First posted 6 Jun 2023math.ST cs.LG math.PRcited by 11

Not on the map. Why?

Abstract (arXiv)

Motivated by the manifold hypothesis, which states that data with a high extrinsic dimension may yet have a low intrinsic dimension, we develop refined statistical bounds for entropic optimal transport that are sensitive to the intrinsic dimension of the data. Our bounds involve a robust notion of intrinsic dimension, measured at only a single distance scale depending on the regularization parameter, and show that it is only the minimum of these single-scale intrinsic dimensions which governs the rate of convergence. We call this the Minimum Intrinsic Dimension scaling (MID scaling) phenomenon, and establish MID scaling with no assumptions on the data distributions so long as the cost is bounded and Lipschitz, and for various entropic optimal transport quantities beyond just values, with stronger analogs when one distribution is supported on a manifold. Our results significantly advance the theoretical state of the art by showing that MID scaling is a generic phenomenon, and provide the first rigorous interpretation of the statistical effect of entropic regularization as a distance scale.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 19 of its 58 references that are in the map. First posted on arXiv 6 Jun 2023.

Builds on

19 of 58 references.

References · 19

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Computational Optimal Transportcited by 765
  3. 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 526
  4. 2015Optimal Transport for Domain Adaptationcited by 457
  5. 2018Statistical Aspects of Wasserstein Distancescited by 202
  6. 2017Large-Scale Optimal Transport and Mapping Estimationcited by 120
  7. 2021Entropic estimation of optimal transport mapscited by 87
  8. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  9. 2018Error estimates for spectral convergence of the graph Laplacian on random geometric graphs towards the Laplace--Beltrami operatorcited by 70
  10. 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 67
  11. 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
  12. 2019Sinkhorn Barycenters with Free Support via Frank-Wolfe Algorithmcited by 27
7 more
  1. 2023Minimax estimation of discontinuous optimal transport maps: The semi-discrete casecited by 20
  2. 2022An improved central limit theorem and fast convergence rates for entropic transportation costscited by 18
  3. 2022Convergence Rates for Regularized Optimal Transport via Quantizationcited by 11
  4. 2020A Study of Performance of Optimal Transportcited by 5
  5. 2021Multivariate rank via entropic optimal transport: sample efficiency and generative modelingcited by 4
  6. 2022Stability and Sample Complexity of Divergence Regularized Optimal Transportcited by 4
  7. 2023On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detectioncited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 3; 2024: 3; 2025: 3; 2026: 2.

11 papers.