Log In Sign Up

Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover

by   Yikun Bai, et al.

The optimal transport problem studies how to transport one measure to another in the most cost-effective way and has wide range of applications from economics to machine learning. In this paper, we introduce and study an information constrained variation of this problem. Our study yields a strengthening and generalization of Talagrand's celebrated transportation cost inequality. Following Marton's approach, we show that the new transportation cost inequality can be used to recover old and new concentration of measure results. Finally, we provide an application of this new inequality to network information theory. We show that it can be used to recover almost immediately a recent solution to a long-standing open problem posed by Cover regarding the capacity of the relay channel.


page 1

page 2

page 3

page 4


Transportation Proof of an inequality by Anantharam, Jog and Nair

Anantharam, Jog and Nair recently put forth an entropic inequality which...

Exponents for Concentration of Measure and Isoperimetry in Product Spaces

In this paper, we provide variational formulas for the asymptotic expone...

Strong c-concavity and stability in optimal transport

The stability of solutions to optimal transport problems under variation...

Generalized Talagrand Inequality for Sinkhorn Distance using Entropy Power Inequality

In this paper, we study the connection between entropic optimal transpor...

Cortical Morphometry Analysis based on Worst Transportation Theory

Biomarkers play an important role in early detection and intervention in...

Central Limit Theorems for General Transportation Costs

We consider the problem of optimal transportation with general cost betw...