Comparison of Accuracy for Methods to Approximate Fisher Information in the Scalar Case
Shenghan Guo

TL;DR
This paper compares two methods for approximating Fisher Information in scalar cases, analyzing their efficiency and accuracy using theoretical and numerical approaches.
Contribution
It provides a theoretical comparison of the gradient-based and Hessian-based methods for estimating Fisher Information in scalar, independent variable scenarios.
Findings
Hessian-based method generally more accurate in scalar cases
Asymptotic variances derived for both methods using CLT and Taylor expansion
Numerical results support theoretical conclusions
Abstract
The Fisher information matrix (FIM) has long been of interest in statistics and other areas. It is widely used to measure the amount of information and calculate the lower bound for the variance for maximum likelihood estimation (MLE). In practice, we do not always know the actual FIM. This is often because obtaining the first or second-order derivatives of the log-likelihood function is difficult, or simply because the calculation of FIM is too formidable. In such cases, we need to utilize the approximation of FIM. In general, there are two ways to estimate FIM. One is to use the product of gradient and the transpose of itself, and the other is to calculate the Hessian matrix and then take negative sign. Mostly people use the latter method in practice. However, this is not necessarily the optimal way. To find out which of the two methods is better, we need to conduct a theoretical…
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
TopicsStatistical Mechanics and Entropy · Target Tracking and Data Fusion in Sensor Networks · Bayesian Methods and Mixture Models
