mlsanityData to 14 Oct 2026

Information Geometry and Classical Cram'er-Rao Type Inequalities

arXiv 2104.01061 ↗First posted 2 Apr 2021cs.IT cs.LG eess.SPcited by 1

Not on the map. Why?

Abstract (arXiv)

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, Iα-divergence (or relative α-entropy), generalized Csisz'ar divergence, Bayesian KL divergence, and Bayesian Iα-divergence.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 4 of its 85 references that are in the map. First posted on arXiv 2 Apr 2021.

Builds on

4 of 85 references.

References · 4

  1. 2015Natural Neural Networkscited by 44
  2. 2017Quantum query complexity of entropy estimationcited by 11
  3. 2020Generalized Bayesian Cram'er-Rao Inequality via Information Geometry of Relative α-Entropycited by 2
  4. 2013Spontaneous Clustering via Minimum γ-divergencecited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.