Abstract

Optimal transport and information geometry both study geometric structures on spaces of probability distributions. Optimal transport characterizes the cost-minimizing movement from one distribution to another, while information geometry originates from coordinate invariant properties of statistical inference. Their relations and applications in statistics and machine learning have started to gain more attention. In this paper we give a new differential-geometric relation between the two fields. Namely, the pseudo-Riemannian framework of Kim and McCann, which provides a geometric perspective on the fundamental Ma–Trudinger–Wang (MTW) condition in the regularity theory of optimal transport maps, encodes the dualistic structure of statistical manifold. This general relation is described using the framework of c-divergence under which divergences are defined by optimal transport maps. As a by-product, we obtain a new information-geometric interpretation of the MTW tensor on the graph of the transport map. This relation sheds light on old and new aspects of information geometry. The dually flat geometry of Bregman divergence corresponds to the quadratic cost and the pseudo-Euclidean space, and the logarithmic L^{(alpha )}-divergence introduced by Pal and the first author has constant sectional curvature in a sense to be made precise. In these cases we give a geometric interpretation of the information-geometric curvature in terms of the divergence between a primal-dual pair of geodesics.

Highlights

  • Let μ and ν be Borel probability measures on Polish spaces M and M respectively

  • In this paper we show that the pseudo-Riemannian framework encodes the dualistic structure of statistical manifold, and use this relation to elucidate several aspects of information geometry

  • [18], quantum information geometry [54] as well as infinite dimensional statistical manifolds [45], but in this paper we focus on the dualistic structure (g, ∇, ∇∗)

Read more

Summary

Introduction

Let μ and ν be Borel probability measures on Polish spaces M and M respectively. Given a real-valued cost function c defined on M × M , the Monge–Kantorovich optimal transport problem is. It compares the costs of the matching ( p → q , p0 → q0) with that of ( p → q0, p0 → q ) Note that if both ( p, q ) and ( p0, q0) belong to the graph G of an optimal transport map (for some pair (μ, ν)), by the c-cyclical monotonicity of G we have δ( p, q , p0, q0) ≥ 0. In [21,32] it was shown that this cross-difference defines a pseudo-Riemannian geometry on M × M which controls the geometry – including the regularity – of the optimal coupling. Kim and McCann [21] showed that these conditions can be interpreted in terms of the Riemann curvature tensor in their pseudo-Riemannian framework (see Remark 4). For more details about the regularity of optimal transport maps we refer the reader to [49, Chapter 12], [21, Section 5] as well as [11]

Summary of main results
Pseudo-Riemannian framework
Connecting the two geometries
Preliminaries
Metrics and connections
Curvature tensors
Divergence between geodesics
Costs with constant sectional curvature
The logarithmic cost function
Consequences of constant cross curvature
Conclusion and future directions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.