Index-> contents reference index search external Previous Next Home home-> resume publications pub_abstract white_paper packages software journals ssh_key fedora_package bikelist rock_climb picture mdot_bike_wish links pub_abstract-> newton_step tmb rkhs_bayes dismod_pde sskm l1_rks implicit_ad ckbs bayes_inverse mcmc_smooth semiblind neuron ConsumeO2 StochasticNonlinear SmoothVariance randompar markov sammii relative gps smoother prolate update nltrack network burg semi gamma match nsmooth error line_search bayes_inverse Headings-> Abstract

Approximating the Bayesian inverse for nonlinear dynamical systems

Abstract
We are given a sequence of measurement vectors and a possibly nonlinear relation to a corresponding sequence of state vectors. We are also given a possibly nonlinear model for the dynamics of the state vectors. The goal is to estimate (invert) for the state vectors when there is noise in both the measurements and the dynamics of the state. In general, obtaining the minimum variance (Bayesian) estimate of the state vectors is difficult because it requires evaluations of high dimensional integrals with no closed analytic form. We use a block tridiagonal Cholesky algorithm to simulate from the Laplace approximation for the posterior of the state vectors. These simulations are used as a proposal density for the random-walk Metropolis algorithm to obtain samples from the actual posterior. This provides a means to approximate the minimum variance estimate, as well as confidence intervals, for the state vector sequence. Simulations of a fed-batch bio-reactor model are used to demonstrate that this approach obtains better estimates and confidence intervals than the iterated Kalman smoother.  citation
Input File: bayes_inverse.omh