mlsanityData to 7 Oct 2026

Generalized Talagrand Inequality for Sinkhorn Distance using Entropy Power Inequality

arXiv 2109.08430 ↗First posted 17 Sep 2021cs.IT math.IT stat.MLcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we study the connection between entropic optimal transport and entropy power inequality (EPI). First, we prove an HWI-type inequality making use of the infinitesimal displacement convexity of optimal transport map. Second, we derive two Talagrand-type inequalities using the saturation of EPI that corresponds to a numerical term in our expression. We evaluate for a wide variety of distributions this term whereas for Gaussian and i.i.d. Cauchy distributions this term is found in explicit form. We show that our results extend previous results of Gaussian Talagrand inequality for Sinkhorn distance to the strongly log-concave case.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 27 references that are in the map. First posted on arXiv 17 Sep 2021.

Builds on

4 of 27 references.

References · 4

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Policy Optimization as Wasserstein Gradient Flowscited by 33
  3. 2018Uncoupled isotonic regression via minimum Wasserstein deconvolutioncited by 12
  4. 2020Information Constrained Optimal Transport: From Talagrand, to Marton, to Covercited by 8

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.