Information Geometry for the Working Information Theorist
Not on the map. Why?
Abstract (arXiv)
Information geometry is a study of statistical manifolds, that is, spaces of probability distributions from a geometric perspective. Its classical information-theoretic applications relate to statistical concepts such as Fisher information, sufficient statistics, and efficient estimators. Today, information geometry has emerged as an interdisciplinary field that finds applications in diverse areas such as radar sensing, array signal processing, quantum physics, deep learning, and optimal transport. This article presents an overview of essential information geometry to initiate an information theorist, who may be unfamiliar with this exciting area of research. We explain the concepts of divergences on statistical manifolds, generalized notions of distances, orthogonality, and geodesics, thereby paving the way for concrete applications and novel theoretical investigations. We also highlight some recent information-geometric developments, which are of interest to the broader information theory community.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 16 of its 74 references that are in the map. First posted on arXiv 5 Oct 2023.
Builds on
16 of 74 references.
References · 16
- 2019Optimal transport mapping via input convex neural networkscited by 206
- 2014On the relation between optimal transport and Schr"odinger bridges: A stochastic control viewpointcited by 99
- 2018An elementary introduction to information geometrycited by 76
- 2013The Information Geometry of Mirror Descentcited by 54
- 2017Online Natural Gradient as a Kalman Filtercited by 25
- 2020A gradient descent perspective on Sinkhorncited by 24
- 2021Sparse Continuous Distributions and Fenchel-Young Lossescited by 14
- 2017Quantum query complexity of entropy estimationcited by 11
- 2022When Optimal Transport Meets Information Geometrycited by 10
- 2023Wasserstein Mirror Gradient Flow as the limit of the Sinkhorn Algorithmcited by 10
- 2020Information Constrained Optimal Transport: From Talagrand, to Marton, to Covercited by 8
- 2022Clustering above Exponential Families with Tempered Exponential Measurescited by 6
4 more
- 2022Conformal Mirror Descent with Logarithmic Divergencescited by 3
- 2020Generalized Bayesian Cram'er-Rao Inequality via Information Geometry of Relative α-Entropycited by 2
- 2020Cram'er-Rao Lower Bounds Arising from Generalized Csisz'ar Divergencescited by 1
- 2021Information Geometry and Classical Cram'er-Rao Type Inequalitiescited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.