摘要：AbstractThe computation of Bayesian estimates of system parameters and functions of them on the basis of observed system performance data is a common problem within system identifcation. This is a previously studied issue where stochastic simulation approaches have been examined using the popular Metropolis-Hastings (MH) algorithm. This prior study has identified a recognised difficulty of tuning theproposal distributionso that the MH method provides realisations with sufficient mixing to deliver efficient convergence. This paper proposes and empirically examines a method of tuning the proposal using ideas borrowed from the numerical optimisation literature around efficient computation of Hessians so that gradient and curvature information of the target posterior can be incorporated in the proposal.
