Literature DB >> 35874116

Pseudo-Riemannian geometry encodes information geometry in optimal transport.

Ting-Kam Leonard Wong1, Jiaowen Yang2.   

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 ( α ) -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.
© The Author(s) 2021.

Entities:  

Keywords:  Bregman divergence; Information geometry; Logarithmic divergence; Ma–Trudinger–Wang tensor; Optimal transport; Pseudo-Riemannian geometry; c-Divergence

Year:  2021        PMID: 35874116      PMCID: PMC9296067          DOI: 10.1007/s41884-021-00053-7

Source DB:  PubMed          Journal:  Inf Geom        ISSN: 2511-249X


Introduction

Let and be Borel probability measures on Polish spaces M and respectively. Given a real-valued cost function c defined on , the Monge–Kantorovich optimal transport problem iswhere is the set of probability measures on whose first and second marginals are and respectively. For systematic mathematical expositions of optimal transport theory we refer the reader to the textbooks [46, 48, 49]. Under suitable conditions on the cost function c and the measures , the optimal coupling can be shown to be deterministic, i.e., concentrates on the graph of a measurable map , called the optimal transport map. The transport cost can then be used to compare probability measures. For example, when and , where d is a metric and , then is the Wasserestein metric of order p. Optimal transport has deep and elegant links with probability, geometry and analysis. Thanks to recent breakthroughs in algorithmic development, optimal transport was also shown to be remarkably useful in statistics and machine learning [44]. In this paper we let M and be n-dimensional smooth manifolds (). In many cases of interest these are open domains in Euclidean space. Also we assume that is smooth. Following the geometric approach of Kim and McCann [21] and McCann [32], consider the cross-differencedefined for pairs of the product space . Intuitively, it compares the costs of the matching with that of . Note that if both and belong to the graph G of an optimal transport map (for some pair ), by the c-cyclical monotonicity of G we have . In [21, 32] it was shown that this cross-difference defines a pseudo-Riemannian geometry on which controls the geometry – including the regularity – of the optimal coupling. The pseudo-Riemannian metric (a non-degenerate 2-tensor), given by , has signature (n, n) where the Hessian is taken with respect to the 2n-dimensional variable . The details of this construction are recalled in Sect. 2.2. In this paper we show that the pseudo-Riemannian framework also encodes the dualistic structure of statistical manifold, and use this relation to elucidate several aspects of information geometry. Before describing the relation with information geometry, let us discuss briefly the context of the papers [21, 32] in more detail. A fundamental problem in optimal transport is to study when the Monge–Kantorovich problem (1) admits a Monge (i.e., deterministic) solution, and, if so, the regularity (continuity and smoothness) of the optimal transport map. While existence of a Monge solution is implied by a twist condition on the cost function, regularity involves analyzing nonlinear partial differential equations of which the Monge–Ampère equation is a classic example. Significant progress was achieved by Ma, Trudinger and Wang [31] and Trudinger and Wang [47] who introduced a fourth order differential condition on the cost c and showed that it is sufficient for continuity and regularity estimates of the transport map (under suitable conditions on and and their supports). Loeper [29] showed that this condition is also necessary and also observed that for a Riemannian manifold M with , the Ma–Trudinger–Wang (MTW) tensor on the diagonal of is proportional to the Riemannian sectional curvature (see Example 9). 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). Further progress, including a characterization of the graph G in terms of a calibration form [22], is surveyed in [32]. 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

To describe the relation between the pseudo-Riemannian framework and information geometry, we first recall the concept of divergence which is a fundamental concept in information geometry [1, 5]. For simplicity we assume that the objects considered (manifolds, functions, etc) are all smooth.

Definition 1

(Divergence) Let M be an n-dimensional manifold. A divergence on M is a function such that the following properties hold: only if . In local coordinates , we have where is strictly positive definite and varies smoothly in . Note that g defines a Riemannian metric on M. In (3) and throughout the paper the Einstein summation convention is used. The classic example is the case where M is a finite-dimensional parameterized family of probability densities (such as an exponential family, see [1, Chapter 2]), and is the Kullback–Leibler divergence (relative entropy). Then the corresponding Riemannian metric is the Fisher information metric given byFollowing Eguchi [12], a divergence induces a dualistic structure on M consisting of a Riemannian metric g, defined by (3), and a pair of torsion-free affine connections which are dual with respect to the metric g (the expressions are given in Sect. 3.1). The connections are defined in terms of third order derivatives of on the diagonal (which may be regarded as the graph of the identity map , see Example 1 below), and the duality means that for any vector fields X, Y and Z we have the following extension of the metric property:Note that the average of and is the Levi–Civita connection of g.1 When is a Bregman divergence the induced dualistic structure is dually flat, i.e., both and are flat [34]. Moreover, the two affine coordinate systems are related by a Legendre transformation [1, Chapter 6]. In the context of exponential family, this reduces to the convex duality between the natural and expectation parameters. Dual connections also appear in the context of affine differential geometry [35]. There are other geometric structures in information geometry, including statistical manifolds admitting torsion [18], quantum information geometry [54] as well as infinite dimensional statistical manifolds [45], but in this paper we focus on the dualistic structure . In Sect. 2.1 we review the framework of c-divergence, a divergence on the graph of optimal transport derived from the optimal transport map f and the corresponding Kantorovich potentials. Introduced by Pal and the first author in [42, 51], this framework includes the Bregman divergence as well as the -divergence studied in the series of papers [41, 42, 50–52]. The -divergence has many interesting properties; here we only note that its dualistic structure is dually projectively flat with constant sectional curvature and leads naturally to a generalized exponential families [51]. In fact, any divergence in the sense of Definition 1 can be regarded as a c-divergence by letting (see Example 1). Given the optimal transport map f, we regard the graph as an embedded submanifold of the product manifold , and the c-divergence as a divergence on G. This gives a dualistic structure on G. In Sect. 3 we study the relations between the two geometries and . Our main result, informally stated, reads as follows.

Theorem 1

The information-geometric Riemannian metric g is the restriction of the pseudo-Riemannian metric h to G. Moreover, the Levi–Civita connection of h induces via natural horizontal and vertical projection maps. Similar statements hold for the curvature. This result encodes the dualistic geometry of information geometry, in complete generality, in the pseudo-Riemannian framework. Intuitively, this is a consequence of the fact that the cross-difference (2) is equal to the symmetrization of the c-divergence on the graph G of the transport map (see Proposition 1). As a by-product, we obtain a new information-geometric interpretation of the MTW tensor on G (Corollary 1). Let us note that Theorem 1 is not the first result that relates the geometry of optimal transport to information geometry. In [20] Khan and Zhang computed the MTW tensor for the logarithmic cost function corresponding to the -divergence, and found that it has a particularly simple form. This result motivated our work on this paper. In the follow up work [19], they considered convex costs on of the form , and showed that the MTW tensor is a multiple of the orthogonal holomorphic bisectional curvature of a Kähler manifold equipped with the Sasaki metric. On the other hand, in this paper we consider an arbitrary divergence and derive its dualistic structure using the original pseudo-Riemannian framework of Kim and McCann. Thus in this sense our results are more general. As in classical differential geometry, spaces of constant sectional curvatures are of special interest. In our context there are two kinds of sectional curvatures: the cross curvature of a cost function on (optimal transport) and the (primal and dual) sectional curvatures of the dualistic structure on G (information geometry). Their relations are studied in Sect. 4. In particular, constant cross curvature implies constant information-geometric curvature. From this point of view, the dually flat geometry of Bregman divergence, which corresponds to the quadratic transport, follows immediately from the flatness of the pseudo-Euclidean space. The -divergence, and its associated logarithmic cost function, lead to constant negative curvature.2 In this setting we provide an intrinsic interpretation of the information-geometric curvature in terms of the divergence between a pair of primal-dual geodesics. Finally, in Sect. 5 we conclude and discuss some avenues for future research, including relations with the entropically relaxed optimal transport problem. We end the introduction with a brief discussion of the relevant literature. The relations between optimal transport and information geometry have been the inspiration of many recent papers. Apart from our line of works which centers on the c-divergence and -divergence corresponding to the Dirichlet transport [41-43], other perspectives have been considered in the literature and the following discussion is far from exhaustive. For example, the papers [2, 3] study divergences defined using the entropically relaxed transport problem (see Example 4). The porous medium equation, which played an important role in the development of optimal transport, is studied in [37] using tools of information geometry. Relations between the Wasserstein metric and the Fisher–Rao metric are studied in [2, 9, 27, 33] among many others. Finite dimensional submanifolds of the Wasserstein space as well as their geometric and statistical properties are studied in a series of papers by Li and his collaborators; see [8, 26, 28] and the references therein.

c-Divergence and the pseudo-Riemannian framework

This section sets the stage of the paper. In Sect. 2.1 we review the c-divergence introduced by Pal and the first author in [42, 51]. It is worth noting that any divergence in the sense of Definition 1 can be regarded as a c-divergence via a suitable choice of the cost function (see Example 1). Then, in Sect. 2.2, we introduce the pseudo-Riemannian framework of Kim and McCann [21, 32]. For motivations and background in optimal transport we refer the reader to [42, 51] and their references.

c-Divergence

We first adapt the definitions in [42, 51] to our differential-geometric setting. Let M and be n-dimensional smooth manifolds, and let be a (smooth) cost function. In many cases of interest we have . We denote generic points in M and by p and respectively. Let be smooth and c-concave, i.e., there exists such thatSuppose that the c-gradient of exists, i.e., for each there exists a unique such that . We assume that is a smooth diffeomorphism from M onto its range . Intuitively, f represents an optimal transport map, with respect to the cost c, for a given pair of probability measures on M and respectively. Note that we may let be the c-transform of which is given byFor an exposition of these concepts see [46, Section 1.6]. Let G be the graph of the optimal transport map, i.e.,Clearly G is an n-dimensional embedded submanifold of the product manifold . By construction, we haveWe regard the c-divergence, defined below, as a divergence on G.

Definition 2

(c-divergence) For , we defineWe call the c-divergence induced by the triple . See Fig. 1 for an illustration.
Fig. 1

Illustration of the c-divergence. The black curve shows the graph G of an optimal transport map. The colour represents the value of which is non-negative and zero only when belongs to the graph G. This value defines the divergence where and are respectively the horizontal and vertical projections of onto G

Illustration of the c-divergence. The black curve shows the graph G of an optimal transport map. The colour represents the value of which is non-negative and zero only when belongs to the graph G. This value defines the divergence where and are respectively the horizontal and vertical projections of onto G From (6) we see that is non-negative and vanishes only if . For it to be a divergence on G in the sense of Definition 1, we require that the cost function is non-degenerate in the sense of [21, Definition 2.2]; this means means that in local coordinates the matrix is invertible (see also the discussion in Sect. 2.2). This condition will be assumed throughout the paper.

Remark 1

Note that the c-divergence is defined on the graph G. We may identify G with M (or ) via the mapping (or ). In particular, M and f(M) may also be identified via the transport map . The last identification is used in [42, Definition 3.3] and [51, Definition 7].

Remark 2

(Interpretation of the c-divergence) Let and be probability measures satisfying (where is the pushforward of under f), so that (under mild integrability conditions on and ) is an optimal transport map for the pair . By Kantorovich’s duality, the value of the transport problem is given byNow let be a coupling of which may be suboptimal. Given on the support of , let ; see the projection maps introduced in Definition 3. We haveThus the expected c-divergence is the excess transport cost compared to the optimal coupling. Intuitively, the c-divergence measures the “distance” between and the graph G of optimal transport (see Fig. 1). Before giving specific examples, let us make the important observation that any divergence can be regarded as a c-divergence.

Example 1

(Any divergence is a c-divergence) Suppose and is an arbitrary divergence as in Definition 1. Consider the cost function given by the divergence. Then the identity transport has a graph – the diagonal of – which is c-cyclically monotone. This transport map is induced by the constant c-concave function whose c-transform is also zero. Since and both vanish, the c-divergence (7) is exactly the given divergence . While any divergence can be regarded as a c-divergence, the more interesting case for the purposes of this paper is where a given cost induces many c-cyclically monotone graphs (5) by varying the transport map f (which solves the optimal transport problem for different pairs of ). Clearly the existence of such graphs is closely related to the existence and regularity of optimal transport map. Instead of giving precise sufficient conditions (which can be found in [49, Chapter 12]), to focus on the geometric ideas we simply assume that f and the Kantorovich potentials are given.

Example 2

(Bregman divergence) Let and let be the quadratic cost (where p, are expressed in Euclidean coordinates). Note that for this cost the effective term for the transport is since each of the other two terms of the expansion depend only on one of the variables. This important example has been treated in [51, Section 2] and to illustrate the ideas we recall the argument. By Brenier’s theorem [6], the optimal transport map has the form , where is a convex function and is the gradient. Here we assume is smooth and the Hessian is positive definite. Then is c-concave, , and , where is the convex conjugate of . Since by convex duality, substituting into (7) and simplifying, we see that the c-divergence corresponding to the triple is the classic Bregman divergence:where . Note that in (8) we represented the divergence in terms of the primal coordinate system p. When expressed in the dual coordinate system q, we haveThe representation as a c-divergence recovers the self-dual representation of the Bregman divergence [1, (1.68)], namelyIts information geometry, which is dually flat [1, Chapter 1], is revisited in Example 7.

Example 3

(-divergence) This may be regarded as a nonlinear “deformation” of Example 2. Let , and let be a fixed parameter. Consider the logarithmic cost functionwhere is the Euclidean dot product. This reduces, after a suitable reparameterization, to the cost function of the Dirichlet transport studied in [43]. Remarkably, as shown in [43] and [51, Theorem 6], the optimal transport map is still explicit and has the formwhere is an -exponentially concave function on M (i.e., is concave) satisfying suitable regularity conditions (see [51, Condition 7]) that will be assumed implicitly. The representation (10) of the optimal transport map may be regarded as an analogue of Brenier’s theorem. By an argument similar to the one presented in Example 2, it can be shown that the c-divergence is the -divergence given byFor detailed studies of this divergence see [42, 43, 50–52]. Note that as the -divergence converges to the Bregman divergence of the convex function . In [42, 51] it was shown that the induced dualistic structure is dually projectively flat with constant sectional curvature (the converse is also true; for the precise statement see [51, Theorem 19]). Also see [39] which interprets the quadratic cost and (9) in terms of convex costs (Example 6) defined by exponential families. The regularity theory of this transport problem is recently addressed in [20] which motivated our study.

Example 4

(Entropic regularization) From (7), a general c-divergence is, apart from a change of coordinates (via ), the same as the original cost function up to some linear terms that involve only p or . We show how this idea can be used to interpret the -divergence in the recent paper [3] which defines a “modified Sinkhorn divergence” for the entropically regularized transport problem. To be consistent with this paper we modify slightly the notations of [3]. Let be a finite set, and let be a non-negative cost on which vanishes on the diagonal. Given (probability distributions on ) and a coupling , consider the entropically regularized cost given bywhere is a regularization parameter and is the Shannon entropy of the coupling . We define the so-called C-function byLet and consider the cost function . In [3, Theorem 2] it is shown thatwhere is an injective shrinkage operator. Consider the function on . Thenand it is easy to see that on the range of . Thus, restricting c to , is c-concave and the corresponding optimal transport map is given by . The c-divergence is given bywhich is nothing but the -divergence in [3, Definition 1] apart from a multiplicative constant. Clearly the same approach extends to other regularizations as long as the analogue of (13) is well-defined.

Pseudo-Riemannian framework

Next we describe the pseudo-Riemannian framework of Kim and McCann [21] which gives a geometric interpretation of the regularity theory of optimal transport studied by Ma, Trudinger & Wang [31], Loeper [29] and many others. A general reference of pseudo-Riemannian geometry is [38]. Consider manifolds and the cost function c as above. Recall the cross-difference defined in (2). The pseudo-Riemannian metric h is given in terms of the Hessian of in the 2n-dimensional variables . More precisely, let and be local coordinates on M and respectively, and express the cost function in the form . Note that we use i to denote indices for M and for to be consistent with the index notations in [21]. We denoteand so on. By the product structure we have the canonical decompositionA generic tangent vector v at (with an abuse of notation where we identify the points with their coordinate representations) can be written in the formWe also write and as column vectors. Define the matrixwhere the matrices and are evaluated at . We assume throughout that c is non-degenerate, i.e., and are invertible. Using (15) and (16), we define a pseudo-Riemannian metric h byIt is easy to see that (17) is equivalent to the following intrinsic representation.

Lemma 1

Write the cross-difference in the form , where . Let X and Y be vector fields on . Thenwhere is the derivation (on M) applied to the function when x varies and y is kept fixed (similar for ). In [21] it is shown that h has signature (n, n), i.e., the matrix (16) (denoted also by h) has n positive eigenvalues and n negative eigenvalues. Given the pseudo-Riemannian metric h, one can consider geodesics with respect to its Levi–Civita connection as well as the Riemann curvature tensor ; these objects will be studied in the next section. In particular, the (unnormalized) sectional curvature gives a geometric interpretation of the Ma–Trudinger–Wang (MTW) tensor, introduced in [31], which plays a crucial role in the regularity theory of optimal transport maps. We will recall the definition of the MTW tensor in Remark 4. The following result explains intuitively why the dualistic structure and the pseudo-Riemannian framework are related. The details of this relation, which amounts to desymmetrizing (18), are worked out in Sect. 3.

Proposition 1

(Cross difference is symmetrization of c-divergence) Consider the c-divergence associated to and the graph G. Then for and in G, we haveThus on the cross difference is equal to the symmetrization of the c-divergence.

Proof

Let . Using the definition of c-divergence, we have

Remark 3

As an extension of (18), we may consider three pairs of points instead of two. Given , , on G, we haveThis identity was first observed in [42, Section 3.3]. In terms of optimal transport, this equals the excess transport cost (which can be positive or negative) of the coupling over , and reduces to the cross-difference when . Since a divergence is locally quadratic (see (3)), the left hand side of (19) may be called a “Pythagorean expression". Such expressions play an important role in information geometry. Specifically, both the Bregman and -divergence satisfy a generalized Pythagorean theorem [51, Theorem 16] which characterizes the sign of (19) in terms of the Riemannian angle of a primal-dual geodesic triangle.

Example 5

(Quadratic cost) Suppose and as in Example 2. It is easy to verify that the matrix of the pseudo-Riemannian metric is given bywhere I is the identity matrix. If is a tangent vector, then (20) gives . Consider the pseudo-Euclidean space with the metricIt is easy to verify that the mappingis an isometry from to . Note that is, up to isometries, the unique space form (complete connected pseudo-Riemannian manifold with constant curvature) with signature (n, n) and zero curvature; see [38, Corollary 8.24]. As we shall see in Example 7, the dually flat geometry of Bregman divergence follows directly from our framework and the flatness of the pseudo-Euclidean space.

Example 6

(General convex cost) Suppose again . Now let where is strictly convex. The solution to this transport problem is given by Gangbo and McCann [17]. The pseudo-Riemannian metric is given in Euclidean coordinates bywhere is the Hessian matrix of . Khan and Zhang [19] expressed the MTW tensor for this cost in terms of the bisectional curvature of a certain Kähler manifold.

Connecting the two geometries

We show that the pseudo-Riemannian framework encodes the dualistic structure in information geometry. In essence, the pseudo-Riemannian metric h on the product manifold induces, in a sense to be made precise, the dualistic structure of the c-divergence on the graph G regarded as a submanifold of .

Preliminaries

We begin with some notations and preliminary results. Consider again the graphequipped with the c-divergence given by (7). Fix local coordinate systems on M and on . Then is a coordinate system on . By an abuse of notation, the coordinates are related on G by . Projecting G to M (using ) and (using ) respectively, we may regard and as local coordinate systems of G. We call the primal coordinates and the dual coordinates on G. Note that they are related by the transport map f. See Fig. 2 for an illustration (also see Remark 1 and compare with [42, Figure 2]).
Fig. 2

The graph G of optimal transport as an n-dimensional submanifold of . The primal and dual coordinates correspond to projections onto M and respectively

The graph G of optimal transport as an n-dimensional submanifold of . The primal and dual coordinates correspond to projections onto M and respectively As mentioned in Sect. 1.1, the c-divergence , given by (7), induces a dualistic structure on G, where g is a Riemannian metric and and are torsion-free affine connections. Let us give the coordinate representation of these objects (see [1, Chapter 6] and [7, Chapter 11] for more details). Suppose we use the primal coordinate system on G. Writing as a function of , we haveHere and are the Christoffel symbols of and respectively. Also we define and , where is the inverse matrix of . For instance, if we have . Similarly, we can write down the coefficients in terms of the dual coordinates . We denote by the Jacobian matrix of the transition map . Its inverse is given by . Write as a function of (locally in ) and consider the matrix of cross derivatives given by (14). We denote its inverse (which exists since c is non-degenerate) by . This means thatwhere and its analogues are Kronecker deltas. Differentiating (23), we obtain the following useful identities that are also used in [21].

Lemma 2

Under the local coordinate system in , We have With these notations we are ready to express the dualistic structure of the c-divergence on G.

Lemma 3

Under the primal coordinate system of G, we havewhere mixed derivatives such as are evaluated at , so that the coefficients are functions of . Similarly, the coefficients of g and under the dual coordinate system are given as follows: Express the c-divergence (7) in terms of local coordinate. Then (25) and (26) follow from the definition (22) via direct differentiation. Computations for the special case where is an -divergence can be found in [42, 51]. Note that and in (25) and (26) are by construction symmetric even though this may not be apparent from the formulas. Next we consider the pseudo-Riemannian metric h introduced in Sect. 2.2. The following result is taken from [21, Lemma 4.1].

Lemma 4

Equip the product manifold with the pseudo-Riemannian metric h. Let be the Levi–Civita connection induced by h and let be its Christoffel symbols. In the local coordinates for M and for , the only non-vanishing Christoffel symbols arewhere the derivatives are evaluated at .

Metrics and connections

We are now ready to connect the two geometries, namely and . We first give two results concerning the metrics and the connections that are intuitive and easy to state; the curvature tensors will be studied in Sect. 3.3. First we consider the metrics. Recall that we have the canonical inclusion and decompositionwhere we again abuse notations and identify points with their coordinates. A generic element v of has the formwhere and is the Jacobian of the coordinate expression of f.

Theorem 2

(g as restriction of h to G) For any we haveThus the information-geometric Riemannian metric g is the restriction of h to G. Simply evaluate (17) where and v is given by (29), and compare with (25). (Also see (18).) Next consider the primal and dual connections , on G as well as the Levi–Civita connection on .

Definition 3

(Projection maps) We define projection maps byfor . The projection maps See Fig. 3 for an illustration. Motivated by this figure, we think of as the vertical projection and as the horizontal projection onto G. Note that if as in (28), then , (the differential map).
Fig. 3

The projection maps

Given a mapping (which in our case is the projection or ) and the connection on , we define an induced connection on G as follows. Let X, Y be given vector fields on G. For x of G fixed, we may extend X and Y to vector fields in a neighborhood in . So we may apply to near x in . Note that is not necessarily tangent to G. We definewhere is the differential of . Since X and Y are tangent to G, it can be verified easily that (32) defines unambiguously a torsion-free affine connection on G.

Theorem 3

We have and . Consider the coordinate system on as in Sect. 3.1. Write and . Let X and Y be vector fields on G, and let their local extensions in beBy Lemma 4, the covariant derivative is given byEvaluating at the point and using the primal coordinates on G, we haveBy Lemma 3, we have . So the last expression is equal to . Similarly, we have . Recall that . Using this decomposition, define mappings as follows. If , define byIn coordinates, if , then and . Geometrically, and are respectively the horizontal and vertical components of v in . Now for vector fields X, Y on G, we may rewrite the identify (33) in the form

Example 7

(Geometry of Bregman divergence) As an illustration of the relation between the two geometries, let us consider the dualistic geometry of Bregman divergence. From Example 2, this corresponds to the case where and c is the quadratic cost . In Euclidean coordinates, the matrix of the pseudo-Riemannian metric h, given by (20), is constant. By Lemma 4, the Christoffel symbols of the Levi–Civita connection all vanish, so the -geodesics are constant-velocity straight lines in . For the quadratic transport, the graph G has the formwhere is a convex function. (The results still hold if is only defined on an open convex domain in .) So is the dual coordinates obtained from the Legendre transformation [1, Chapter 1] or equivalently the Brenier map. From (34), the Christoffel symbols of (resp. ) in the primal (resp. dual) coordinates vanish. So the primal (resp. dual) geodesics on G are straight lines in the primal (resp. dual) coordinates. Thus we recover the classic dually flat geometry. Also, from the first equation in (25), since and , the Riemannian metric is given in primal coordinates by , the Hessian of .

Curvature tensors

Next we study the Riemann curvature tensors of on , and of and respectively on G. To fix the notations, we define the Riemann curvature tensor (say for the primal connection ) bywhere [X, Y] is the Lie bracket. In coordinates, we writeand , so that . We haveSee e.g. [1, Section 5.8]. The notations for (on G) and (on ) are analogous. Note that for the indices run through both and .

Lemma 5

In the coordinates , the coefficients of are zero unless the number of unbarred and barred indices is equal, in which case the coefficient can be inferred from andusing the symmetries of the curvature tensor. This is a computation (done in [21, Lemma 4.1]) involving Lemma 4, Lemma 2 and (37), which is straightforward once one is familiar with the notations. Note that our expressions differ from [21, (4.2)] by a sign; this is due to the difference in the tensorial notation (37). For later use we also record the symmetries of the coefficients:See for example [24, Proposition 7.4] whose notations are the same as ours. These symmetries hold in both the Riemannian and pseudo-Riemannian cases. Note that (39) gives all the coefficients of R that are possibly nonzero.

Lemma 6

In primal coordinates, we have In dual coordinates, we have The proof is similar to that of [21, Lemma 4.1]. Now we use Lemma 3, keeping in mind that in the primal case (say) is a function of . For example, we haveThe dual case is similar.

Definition 4

(Unnormalized sectional curvature) Let X, Y be tangent vectors at the same point of . We define the unnormalized sectional curvature of bySimilarly, we definewhen X and Y are tangent to G.

Remark 4

(The Ma–Trudinger–Wang tensor) At a point , let and where and . Following Kim and McCann [21], the Ma–Trudinger–Wang (MTW) tensor (see [16, (5)] where a different multiplicative constant is used) can be expressed intrinsically as the unnormalized (cross) sectional curvatureThe cost c is said to be weakly regular if whenever is a null tangent vector, i.e., [21, Definition 2.3]. Note that in this case we have ; this is why one considers the unnormalized sectional curvature instead of the usual one. We refer the reader to [21, 32, 49] and their references for how this condition comes into play in the regularity theory of optimal transport maps. In Corollary 1 we give a new information-geometric interpretation of this quantity. Now we are ready to state an interesting relation among the unnormalized sectional curvatures.

Theorem 4

Let . ThenIn particular, suppose the dualistic structure on G has constant information-geometric sectional curvature . By definition, this means thatfor X, Y tangent to G. Thenfor X, Y tangent to G. Write and . Using (42), Lemma 5 and the symmetries (39) of , we haveSince X and Y are tangent to G, from (29) we have and (similar for Y). In primal coordinate on G, we have and . We then computewhere the last identity follows from Lemma 6. Similarly, working in dual coordinates, we getThe result follows by averaging.

Divergence between geodesics

Consider a Riemannian manifold with distance d. If and are two arc-length parameterized geodesics started at the same point when , thenwhere is the sectional curvature of the the plane spanned by and , and is the angle between the initial velocities (see for example [21, (4.9)]). This is the classical geometric interpretation of sectional curvature. In this section we extend this result to a c-divergence. Naturally, this involves the primal and dual geodesics rather than the Riemannian geodesics. The special case for -divergence is given in [53]. This result (and its proof) is closely related to, but different from, [21, Lemma 4.5] which extends (51) to the pseudo-Riemannian framework with a general cost function.

Theorem 5

Consider the graph G and equip it with the dualistic structure induced by a c-divergence . Let be a primal geodesic and be a dual geodesic with . Lettingwe have Theorem 5 may be regarded as an interpretation of the MTW tensor (44) on the graph G. It should be compared with the standard interpretation (see e.g. [11, (4.13)]) which involves the c-exponential map.

Corollary 1

(Information-geometric interpretation of the MTW tensor) In the context of Theorem 5, let , and, . Let and be respectively primal and dual geodesics whose initial velocities match with u and (when expressed in the respective coordinates). Then the MTW tensor can be expressed as Although the statement of Theorem 5 (as well as the proof) is very similar to [21, Lemma 4.5], the two results are not the same. In (52), both and are curves in G. On the other hand, in [21, Lemma 4.5] one is a “horizontal” curve and the other one is “vertical”. Before giving the proof of Theorem 5 let us give some examples. Another application to the -divergence is given in Corollary 2.

Example 8

(Bregman divergence) Consider the Bregman divergence as in (2). Let and be respectively the primal and dual coordinates. By Example 7, the primal and dual geodesics are given respectively by and . This giveswhich is consistent with the dual flatness. More about the constant curvature case is studied in Sect. 4.

Example 9

(Quadratic cost on a Riemannian manifold) Let M be a Riemannian manifold with geodesic distance . Consider the cost function on . Let be the identity transport, so that G is the diagonal of . The corresponding c-divergence is (see Example 1). Identifying M and G (as smooth manifolds) under the natural map , it is easily shown that the dualistic structure reduces to the Riemannian structure of M, i.e., g is the Riemannian metric of M and are equal to the Riemannian Levi–Civita connection of g. In particular, the primal and dual geodesics are simply Riemannian geodesics. By (51) and (53) we immediately get , where is the Riemannian sectional curvature of the plane spanned by (u, v) and . This recovers [29, Theorem 3.8]. Also see [21, Example 3.6].

Proof of Theorem 5

Again we use the primal coordinates for and the dual coordinates for . The first equality follows directly from (7). Computing the derivative (52), we haveBy Lemma 3, the primal and geodesic equations are given byPlugging into (54) and simplifying, we haveComparing this with (42) gives the result.

Costs with constant sectional curvature

The quadratic cost and Bregman divergence are flat when considered in both the pseudo-Riemannian and information-geometric frameworks (see Example 5 and Example 7). In this section we consider the case of constant (non-zero) sectional curvature, a concept we now make precise. Note that the unnormalized sectional curvature can be regarded as an operator on (see [21, Remark 4.2]). Since vanishes on , is determined by its action on .

Definition 5

Consider a real-valued cost function c on . c has constant cross curvature on if for any . c has constant sectional curvature on a graph G of optimal transport if (55) holds when X, Y are tangent to G. By Theorem 4, this is the case when G has constant information-geometric sectional curvature (see (46)). Note that when and , from the form of the metric h (see (16)) we always have . Thus (55) is equivalent to .

The logarithmic cost function

Our main examples for Definition 5 are the quadratic cost (Example 2) as well as the logarithmic cost (Example 3). As shown in [41, 51], the logarithmic cost arises naturally in stochastic portfolio theory [41]. See [43] for a probabilistic interpretation involving the Dirichlet perturbation model.

Lemma 7

Consider the logarithmic cost where and . Using the Euclidean coordinates (i.e., and ), we have: This is a straightforward but tedious computations. For the benefit of the reader we record some of the intermediate steps: In fact, as the following lemma shows, (56) is equivalent to the condition of constant cross curvature.

Lemma 8

A cost function c has constant cross curvature on , , if and only if (56) holds in some (and hence any) coordinate system . In particular, the logarithmic cost function (9) has constant cross curvature on . Fix a coordinate system . Let . Suppose and . Since and . Following the argument of (48), we haveSuppose c satisfies (56). Then (57) implies thatThus c has constant cross curvature on . Conversely, suppose c has constant cross curvature on . Then for and we haveNote that both coefficients and are invariant under the swap of indices i and l or the swap of and . Since (57) and (58) holds for arbitrary choice of , and , , the identity (56) must hold.

Consequences of constant cross curvature

Now we show that if c has constant cross curvature, then the statistical manifolds it generates have constant information-geometric sectional curvature.

Theorem 6

Suppose the cost function c has constant cross curvature on . Then any graph G of optimal transport has constant information-geometric sectional curvature . Consequently, c has constant sectional curvature on G. By Lemma 8, c satisfies (56) in some coordinate system . Let G be a graph of optimal transport, and let X, Y be tangent to G. By (49), we haveHence G has constant information-geometric primal sectional curvature . From (50), the same holds for the dual sectional curvature. The last statement follows from Theorem 4.

Remark 5

It is clear that if c has constant cross curvature, then c is weakly regular (see Remark 4). Indeed, the MTW tensor satisfies whenever is a null vector. From this and Lemma 8 we recover the recent result of Khan and Zhang (see [19, p. 22]).

Remark 6

It is interesting to know if some converse of Theorem 6 holds: if all graphs of optimal transport have constant information geometric sectional curvature, does the corresponding cost also have constant cross curvature? Is the logarithmic cost (up to reparameterization and linear terms) the unique cost which has constant cross curvature? Finally, we specialize the above results to the -divergence to give an intrinsic interpretation of its information geometric sectional curvature. This representation is intrinsic because if a statistical manifold is dually projectively flat with constant sectional curvature , then locally one can define canonically a divergence of -type which is consistent with the ambient geometry [51, Theorem 19]. See [53] for more discussion and related results.

Corollary 2

Let be the -divergence which is the c-divergence of the logarithmic cost (9). Consider the context of Theorem 5, so that is a primal geodesic, is a dual geodesic and , we have Following the notations Theorem 5, Let and . By Theorem 5, we haveSince the logarithmic cost has constant cross curvature by Lemma 8, we haveConsider the coordinates . Writing and . From (17), we haveNow consider and as curves in G. Using the primal coordinate on G, we haveBy Lemma 3, we havePlugging this into (60), we obtain the desired result.

Conclusion and future directions

This paper uncovers a fundamental relation between optimal transport and information geometry, and we expect that this framework will be useful for extending results in information geometry using optimal transport and vice versa. Here we discuss several directions for further study. In this paper we studied the geometry of the basic Monge–Kantorovich optimal transport problem. Consider the entropically relaxed optimal transport problem (EOT)where is the relative entropy of from the product coupling , and is a regularization parameter. As we recover the Monge–Kantorovich problem (1). Since it is closely related to the Schrödinger bridge problem [25] and can be solved efficiently via the Sinkhorn algorithm [10], many researchers have worked on the EOT in recent years. It can be shown that the optimal coupling of (61) has the formwhere and are called Schrödinger potentials. Under suitable conditions and normalizations, it was recently shown in [36] that the Schrödinger potentials converge to the Kantorovich potentials as , i.e., , . Thus, when , we have heuristicallyThus the c-divergence arises naturally in the asymptotics of EOT. See in particular [40] where the c-divergence is used in a crucial way when studying an expansion of (61) as . It is interesting to see if the pseudo-Riemannian and information geometries play a role in these expansions. Also see [51, Section 4] where a generalized exponential family is defined using the logarithmic cost (9) and the expression . On the other hand, it may be possible to consider directly a geometry for the problem (61) where is fixed. Note that the optimal coupling (62) is no longer concentrated on a graph, but as it converges to the optimal coupling in (1). Thus, the corresponding information geometry, if any, lives on the product space rather than a submanifold G. This is close in spirit to [2] which considers the statistical manifold of optimal couplings. Another possible direction is to consider the geometry of dynamic optimal transport problems where the coupling is replaced by the law of a stochastic process, say , with initial distribution and final distribution . We believe that an improved understanding of these problems will be helpful in statistical applications of optimal transport and information geometry. In [53] and in Sect. 4 we studied the geometric meaning of information-geometric curvature in the case of constant sectional curvature. It is desirable to extend this result to arbitrary statistical manifolds. While Theorem 5 relates the time derivative of the divergence to the unnormalized sectional curvature , it is in general not intrinsic as there are infinitely many pseudo-Riemannian geometries which are compatible with a given dualistic structure . The inverse problem (of constructing h, c and ) is related to the construction of canonical divergence [4] in information geometry; see also [13-15]. Finally, let us remark that optimal transport problems such as the reflector antenna problem [30] and the 2-Wasserstein transport on Riemannian manifolds may lead to interesting new examples of statistical manifolds and divergences.
  2 in total

1.  Information-theoretic differential geometry of quantum phase transitions.

Authors:  Paolo Zanardi; Paolo Giorda; Marco Cozzini
Journal:  Phys Rev Lett       Date:  2007-09-07       Impact factor: 9.161

2.  Information Geometry for Regularized Optimal Transport and Barycenters of Patterns.

Authors:  Shun-Ichi Amari; Ryo Karakida; Masafumi Oizumi; Marco Cuturi
Journal:  Neural Comput       Date:  2019-03-18       Impact factor: 2.026

  2 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.