Information Geometry and Classical Cram\'{e}r-Rao Type Inequalities
Kumar Vijay Mishra, M. Ashok Kumar

TL;DR
This paper explores how information geometry can be used to derive various classical and Bayesian Cramér-Rao type inequalities through divergence functions and dualistic geometric structures.
Contribution
It generalizes the framework for deriving CR inequalities using information geometry to include $ ext{α}$-divergences, generalized divergences, and Bayesian variants.
Findings
Derived $ ext{α}$-CR inequality from $I_ ext{α}$-divergence.
Extended CR inequalities to Bayesian and generalized divergence contexts.
Unified geometric approach to multiple CR inequalities.
Abstract
We examine the role of information geometry in the context of classical Cram\'er-Rao (CR) type inequalities. In particular, we focus on Eguchi's theory of obtaining dualistic geometric structures from a divergence function and then applying Amari-Nagoaka's theory to obtain a CR type inequality. The classical deterministic CR inequality is derived from Kullback-Leibler (KL)-divergence. We show that this framework could be generalized to other CR type inequalities through four examples: -version of CR inequality, generalized CR inequality, Bayesian CR inequality, and Bayesian -CR inequality. These are obtained from, respectively, -divergence (or relative -entropy), generalized Csisz\'ar divergence, Bayesian KL divergence, and Bayesian -divergence.
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.
