Title :
Cramer-Rao bounds and Monte Carlo calculation of the Fisher information matrix in difficult problems
Author_Institution :
Appl. Phys. Lab., Johns Hopkins Univ., Laurel, MD, USA
fDate :
June 30 2004-July 2 2004
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.
Keywords :
Bayes methods; Hessian matrices; Monte Carlo methods; approximation theory; estimation theory; information theory; optimisation; sampling methods; stochastic processes; Bayesian analysis; Cramer-Rao bounds; Fisher information matrix; Hessian matrix estimation; Monte Carlo calculation; optimization algorithm; perturbation stochastic approximation; resampling based method;
Conference_Titel :
American Control Conference, 2004. Proceedings of the 2004
Conference_Location :
Boston, MA, USA
Print_ISBN :
0-7803-8335-4