Information Geometry on the $\ell^2$-Simplex via the $q$-Root Transform
Levin Maier

TL;DR
This paper develops an infinite-dimensional information geometry framework on the -simplex using the q-root transform, enabling new geometric structures, gradient flows, and connections related to Hamiltonian systems.
Contribution
It introduces the -probability simplex with a novel differentiable structure via the q-root transform, linking geometry, gradient flows, and Hamiltonian systems in infinite dimensions.
Findings
Defined the -simplex with a new differentiable structure
Constructed gradient flows related to the Fisher--Rao metric
Linked the flows to integrable Hamiltonian systems
Abstract
In this paper, we introduce \emph{-information geometry}, an infinite dimensional framework that shares key features with the geometry of the space of probability densities \( \mathrm{Dens}(M) \) on a closed manifold, while also incorporating aspects of measure-valued information geometry. We define the \emph{-probability simplex} with a noncanonical differentiable structure induced via the \emph{-root transform} from an open subset of the -sphere. This structure renders the -root map an \emph{isometry}, enabling the definition of \emph{Amari--\v{C}encov -connections} in this setting. We further construct \emph{gradient flows} with respect to the Fisher--Rao metric, which solve an infinite-dimensional linear optimization problem. These flows are intimately linked to an \emph{integrable Hamiltonian system} via a \emph{momentum map} arising…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Analysis and Transform Methods · Coding theory and cryptography · Advanced Data Compression Techniques
