Loading [MathJax]/extensions/MathMenu.js
Cramer-Rao bounds and Monte Carlo calculation of the Fisher information matrix in difficult problems | IEEE Conference Publication | IEEE Xplore

Cramer-Rao bounds and Monte Carlo calculation of the Fisher information matrix in difficult problems


Abstract:

The Fisher information matrix summarizes the amount of information in the data relative to the quantities of interest. There are many applications of the information matr...Show More

Abstract:

The Fisher information matrix summarizes the amount of information in the data relative to the quantities of interest. There are many applications of the information matrix in modeling, systems analysis, and estimation, including confidence region calculation, input design, prediction bounds, and "noninformative" priors for Bayesian analysis. This paper reviews some basic principles associated with the information matrix, presents a resampling-based method for computing the information matrix together with some new theory related to efficient implementation, and presents some numerical results. The resampling-based method relies on an efficient technique for estimating the Hessian matrix, introduced as part of the adaptive ("second-order") form of the simultaneous perturbation stochastic approximation (SPSA) optimization algorithm.
Date of Conference: 30 June 2004 - 02 July 2004
Date Added to IEEE Xplore: 02 May 2005
Print ISBN:0-7803-8335-4
Print ISSN: 0743-1619
Conference Location: Boston, MA, USA

Contact IEEE to Subscribe

References

References is not available for this document.