mlsanityData to 14 Oct 2026

Two-Sided Bounds for Entropic Optimal Transport via a Rate-Distortion Integral

arXiv 2604.14061 ↗First posted 15 Apr 2026cs.IT math.IT math.PRcited by 0

Not on the map. Why?

Abstract (arXiv)

We show that the maximum expected inner product between a random vector and the standard normal vector over all couplings subject to a mutual information constraint or regularization is equivalent to a truncated integral involving the rate-distortion function, up to universal multiplicative constants. The proof is based on a lifting technique, which constructs a Gaussian process indexed by a random subset of the type class of the probability distribution involved in the information-theoretic inequality, and then applying a form of the majorizing measure theorem.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 21 references that are in the map. First posted on arXiv 15 Apr 2026.

Builds on

2 of 21 references.

References · 2

  1. 2018Computational Optimal Transportcited by 780
  2. 2020Information Constrained Optimal Transport: From Talagrand, to Marton, to Covercited by 8

Built on by

Not cited yet.