The Information-Geometric Perspective of Compositional Data Analysis
Not on the map. Why?
Abstract (arXiv)
Information geometry uses the formal tools of differential geometry to describe the space of probability distributions as a Riemannian manifold with an additional dual structure. The formal equivalence of compositional data with discrete probability distributions makes it possible to apply the same description to the sample space of Compositional Data Analysis (CoDA). The latter has been formally described as a Euclidean space with an orthonormal basis featuring components that are suitable combinations of the original parts. In contrast to the Euclidean metric, the information-geometric description singles out the Fisher information metric as the only one keeping the manifold's geometric structure invariant under equivalent representations of the underlying random variables. Well-known concepts that are valid in Euclidean coordinates, e.g., the Pythogorean theorem, are generalized by information geometry to corresponding notions that hold for more general coordinates. In briefly reviewing Euclidean CoDA and, in more detail, the information-geometric approach, we show how the latter justifies the use of distance measures and divergences that so far have received little attention in CoDA as they do not fit the Euclidean geometry favored by current thinking. We also show how entropy and relative entropy can describe amalgamations in a simple way, while Aitchison distance requires the use of geometric means to obtain more succinct relationships. We proceed to prove the information monotonicity property for Aitchison distance. We close with some thoughts about new directions in CoDA where the rich structure that is provided by information geometry could be exploited.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1; 2024: 0; 2025: 0; 2026: 3.
5 papers.
- 2022Non-linear Embeddings in Hilbert Simplex Geometrycited by 5
- 2023Bayes Hilbert Spaces for Posterior Approximationcited by 1
- 2026Generative Modeling of Discrete Data Using Geometric Latent Subspacescited by 0
- 2026Statistical Guarantees for Reasoning Probes on Looped Boolean Circuitscited by 0
- 2026Estimating Staged Event Tree Models via Hierarchical Clustering on the Simplexcited by 0
- 2026Estimating Staged Event Tree Models via Hierarchical Clustering on the Simplex16 Mar 2026
- 2026Statistical Guarantees for Reasoning Probes on Looped Boolean Circuits3 Feb 2026
- 2026Generative Modeling of Discrete Data Using Geometric Latent Subspaces29 Jan 2026
- 2023Bayes Hilbert Spaces for Posterior Approximation18 Apr 2023
- 2022Non-linear Embeddings in Hilbert Simplex Geometry22 Mar 2022