Efficient Monte Carlo computation of Fisher information matrix using prior information
type: Item
instance of: scholarly article
title: Efficient Monte Carlo computation of Fisher information matrix using prior information
zbMATH Open document ID: 1464.62052
author: Sonjoy Das
author: James C. Spall
author: R. G. Ghanem
published in: Computational Statistics and Data Analysis
publication date: 2010-04-06T00:00:00Z
Mathematics Subject Classification ID: 62-08
zbMATH DE Number: 5689588
MaRDI profile type: Publication
full work available at URL: j.csda.2009.09.018
OpenAlex ID: W1990136720
cites work: CramÉr–Rao Bounds for Multiple Poles and Coefficients of Quasi-Polynomials in Colored Noise
cites work: Q4188569
cites work: Elements of Information Theory
cites work: Asymptotic Sampling Distribution for Polynomial Chaos Representation from Data: A Maximum Entropy and Fisher Information Approach
cites work: Assessing the accuracy of the maximum likelihood estimator: Observed versus expected Fisher information
cites work: Prediction Intervals for Artificial Neural Networks
cites work: An invariant form for the prior probability in estimation problems
cites work: On the resultant property of the Fisher information matrix of a vector ARMA process
cites work: Q4337018
cites work: An alternative inverse Gaussian distribution
cites work: An improved method for the computation of maximum likelihood estimates for multinomial overdispersion models
cites work: Linear Statistical Inference and its Applications
cites work: Estimation and tests of hypotheses for the initial mean and covariance in the kalman filter model
cites work: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation
cites work: Adaptive stochastic approximation by the simultaneous perturbation method
cites work: Introduction to Stochastic Search and Optimization
cites work: Feedback and Weighting Mechanisms for Improving Jacobian Estimates in the Adaptive Simultaneous Perturbation Algorithm
cites work: Filtering, predictive, and smoothing Cramér-Rao bounds for discrete-time nonlinear dynamic systems
cites work: Principal whitened gradient for information geometry
DOI: 10.1016/J.CSDA.2009.09.018
description: scientific article; zbMATH DE number 5689588