## Information Geometry – An Affine Geometry of Exponential Families (Lecture 2)

Underlying information geometry is the question of what it means to put a geometry on a set of probability distributions. Ultimately, we will be viewing sets of probability distributions as manifolds with metrics and connections having statistical relevance. (Metrics and connections are Riemannian geometric concepts determining, among other things, how distance is measured and what curves should be thought of as “straight lines”, that is, curves with zero acceleration.) As a warm up exercise, we ask a considerably simpler question: Can we impose an affine geometry on (a significantly large subset of) the set of all probability distributions such that all exponential families of distributions appear as affine subspaces? (Definitions will be given presently.) Our only motivation for wishing to do this, beyond being a warm up exercise for considering what a “geometry” actually is, is that such a geometry leads to a simple geometric test for determining if a given family is exponential or not. On the one hand then, this geometry does have a use, albeit a relatively straightforward one, and there must be something a bit geometrically special about exponential families because there are other collections of families who could not have been shoehorned into an affine structure. On the other hand, it should not be interpreted as *the *geometry of probability distributions. There are other geometries to consider too.

In a vector space, an affine subspace is what results by taking a linear subspace and translating its origin to another point. The simplest example is a straight line. Recall that a straight line in a vector space is defined to be a curve of the form where and are two vectors from the space. What if we are given a set ? How can we define what a straight line is in ?

We could arbitrarily decree that certain collections of points in form straight lines but if these straight lines don’t “fit together” in a nice way, we wouldn’t have a systematic structure to work with, and our definition would not be a useful one. That said, there is not just a single structure which is the right structure for “straight lines”; the message is merely that some structure is required for our definition to be useful. (An example of structure for straight lines is that, in a vector space, two straight lines are either parallel or they intersect at precisely one point; this is because the geometry is Euclidean. There are non-Euclidean geometries in which straight lines have different properties.)

One way to define straight lines (in a useful way) on is to impose a (useful) vector space structure on then apply the aforementioned definition of a straight line on a vector space. A vector space has an origin though, so if represents a set of probability distributions, which probability distribution should we choose to be the origin? Sadly, there is no distinguished probability distribution which would serve well as an origin. (We will see presently there is a way round this though!) An alternative would be to make into a manifold, define a statistically meaningful connection on the manifold and then use this connection to form curves of zero acceleration which we could think of as straight lines (especially if we restrict attention to submanifolds which are flat with respect to the connection). It is this latter approach which will be pursued in subsequent lectures, but it is overkill for now.

Observe that the definition of a straight line in a vector space doesn’t actually depend on the choice of origin. This should be clear from a simple diagram but it is instructive to write this down rigorously. If is a straight line in the vector space formed from with the origin at then remains a straight line in the vector space formed from with the origin at . Although the vector space operations have changed – in the first vector space whereas in the second vector space – any set of the form in the first vector space can be written in the same form in the second vector space. [If this is not clear, use and to denote vector space addition and scalar multiplication in the second vector space and show that for any there exist such that . Hint: If denotes the origin of the second vector space then and .]

Roughly speaking, an affine space is a vector space who cannot remember where his origin is. The affine space captures all the structure it possibly can from the absent-minded vector space. It can capture the property of straight lines because we have just seen that these can be defined in a way which does not depend on where the origin actually is.

The sophisticated way to proceed would be to define a collection of coordinate charts, each chart mapping to a vector space, and every pair of charts related by an affine transformation. This would give us an affine geometry on . Instead though, we will proceed in a conceptually simpler but more arduous way. (In a subsequent lecture we will return to the sophisticated approach because that approach generalises to manifolds and other structures.)

Concretely, let be the set of all strictly positive and continuous functions on . It includes, for example, the functions which are the probability densities for Gaussian random variables with mean and variance . How can we put a (sensible) affine structure onto such that, among other things, the Gaussian random variables lie in a two-dimensional affine subspace of ? And firstly, what *is* an affine structure on a set? (We could have made larger by including all measurable functions but this is merely a distraction. The fact that contains functions which do not integrate to and are therefore not probability densities is a convenience which will turn out later not to affect things in any significant way.)

Taking away the origin from a vector space means vector space addition and scalar multiplication are no longer defined; they change as the origin changes, as we saw earlier. Intuitively, what does not change is our ability to define direction. For example, we can say that is arrived at by starting at and moving three steps North and two steps East. Precisely, we express this by saying that the statement does not depend on where the origin is; change the origin and both sides change by the same amount. The basic idea (which may or may not work) is that although individual points in an affine space cannot be thought of as vectors, perhaps their difference can be. [It is more efficient to guess that this might work then check that it really does than try to guarantee beforehand it will work.]

This motivates us to try putting an affine structure onto by introducing an auxillary vector space to represent the difference of any two points in . For every pair we must associate a point . [Precisely, we must define a function . Writing is shorthand for . ]

Merely defining does not endow with sufficient structure though. It turns out that we get the full amount of structure possible on by requiring to behave in the following sensible ways: holds for all ; implies ; for all and there exists a such that . (Note that “” is vector space addition in whereas “” is the peculiar operation defined earlier.) [To derive this, assume that for some unknown and write down all the properties you can think of that are independent of , then check what you end up with is sensible.]

Returning to the job at hand, that of defining an affine structure on , what works is the following. For , define . Statisticians will recognise the right-hand side as the log-likelihood ratio which is ubiquitous in statistical inference. This fulfils our requirements as now shown. Let be the vector space of all continuous functions (where vector addition and scalar multiplication are defined pointwise). Firstly, as required. If then so . Given a and define . [This means .] Then , thus completing the verification that the above axioms for an affine structure are satisfied. Importantly, the choice of the log-likelihood ratio means that the family of Gaussian distributions is affine, as now explained.

A straight line in is a collection of points of the form . Indeed, this is the line passing through in the direction . Generalising this, we define an affine subspace in to be a subset of the form for some linear subspace of . Take a particular Gaussian density, say . Let be the three-dimensional subspace of spanned by the basis functions , and . That is to say, the elements of are the quadratic polynomials . Choose an element . The axioms of an affine space ensure there is a unique such that . Indeed, a calculation reveals that where and . That is to say, provided we do not care about the normalising factor required to make a density integrate to unity, we are content to claim that the Gaussian family of unnormalised densities is a three-dimensional affine subspace of . [The third dimension is because the scaling factor can be freely chosen.] Importantly, every (unnormalised) exponential family forms an affine subspace of , and conversely, every (finite dimensional) affine subspace of is an exponential family. With brute force, we could have made the Gaussian densities affine in many different ways; the key feature is that we found a way which worked for all exponential families simultaneously. This is only possible because exponential families have an inherent geometric structure, for example, it is a prerequisite for our approach that the intersection of two exponential families is an exponential family because we know that the intersection of two affine subspaces is affine.

Working with unnormalised densities is not uncommon. Here, it is used to overcome the fact that normalised densities do not form an affine subspace in the same way that a circle, representing normalised vectors in a plane, is not a linear subspace. In fact, some further unpleasantries have been covered up. The assignment may lead to being negative (or undefined if ). The effect is that the resulting density integrates to infinity. Should we wish to pursue this path, what would save us is the result that the set on which the densities have a finite integral is convex. This is sufficiently nice to work with. The alternative is to switch to Riemannian geometry which is powerful enough to allow the existence of extrinsically curved surfaces which are intrinsically flat, the cylinder being just one example. Indeed, in a subsequent lecture we will see that there are statistically meaningful connections with respect to which the exponential families are flat.

The next lecture will show how this affine geometry can be used to derive a test for determining if a family is exponential or not. The eager reader may wish to consider how we could have worked out in advance that we should use the definition to define the affine geometry. The first chapter of Murray and Rice’s book on Differential Geometry and Statistics may prove useful.

Hello, thanks a lot for that exposition. I have made several unsuccessful attempts to understand the definition of a tangent vector as defined in my differential geometry class.

In R^n, a tangent vector was defined as ‘ p+v ‘ with ‘v’ being the direction of the tangent vector at ‘p’.

Also am I right in saying that every point in Euclidean space is a tangent vector to it at the origin due the concept of “position vector”? I guess this is due that Euclidean space has an inherent notion of an “origin”. How would this change if I were to look at only the “affine” nature of Euclidean space?

The best way to think of a tangent vector is as something which represents a direction along which a directional derivative can be computed. In Euclidean space, given a function and a point , we are familiar with the directional derivative in the direction , where belongs to . On a manifold , we wish to do the same thing, that is, be able to specify a direction and compute a derivative in that direction of a function . It turns out we can do this, but the direction must now belong to the tangent space .

For Euclidean space, is isomorphic to and hence it is easy to “confuse” points and tangent vectors . But they should be treated as two very different things.