AI & ML
Cramer-Rao Type Bounds for Generalized Exponential Families
arXiv stat.TH0 views
arXiv:2610.27679v1 Announce Type: new Abstract: It is well known that the sufficient statistics of an exponential family attain the usual Cramer-Rao Lower Bound (CRLB) for their expected value. In this paper, we extend this result to a broader family of distributions that includes exponential families and power-law families, with Student t-distributions as special case. To derive the generalized Cramer-Rao inequality, we first apply Eguchi's theory to Bregman divergence to obtain a Riemannian metric and then follow the approach of Amari and Nagaoka. Since this approach applies only to models with finite support, we use Cauchy-Schwarz inequality to extend it to models with countably infinite or continuous support. The resulting generalized CRLB provides a finite-sample lower bound related to the asymptotic covariance matrix of the Minimum Bregman Divergence Estimator (MBDE). We show that the sufficient statistic of the generalized family attains the generalized CRLB. Moreover, although the generalized CRLB does not, in general, coincide with the asymptotic covariance matrix of the MBDE, the covariance matrix of an estimator attaining the generalized CRLB coincides with the corresponding matrix for the joint distribution of the sample.
Source:https://arxiv.org/abs/2610.27679PreviousThe Complexity Kink: A Prompt-Side Structural Complexity Index for Code-Generation ReliabilityNextCentral Limit Theorems for Optimal Transport Functionals
Related posts
Hybrid retrieval with reciprocal rank fusion: notes from a RAG prototype
0dev.to
It is in co-creating, together. As humans do.
0dev.to
C64 Basic Dungeon Crawler: Stairs, Levels and Levelling Up (Part 11)
0Hacker News
Anthropic's internal AI use, at retail prices, now exceeds its employee pay
0Hacker News
Launch HN: Momentic (YC W24) – Agents that catch bugs by using your app
0Hacker News

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX