Home > Research > Publications & Outputs > Augmented pseudo-marginal Metropolis-Hastings f...

Electronic data

  • 2009.05318

    Rights statement: The final publication is available at Springer via http://dx.doi.org/10.1007/s11222-022-10083-5

    Accepted author manuscript, 436 KB, PDF document

    Embargo ends: 15/02/23

    Available under license: CC BY-NC: Creative Commons Attribution-NonCommercial 4.0 International License

Links

Text available via DOI:

View graph of relations

Augmented pseudo-marginal Metropolis-Hastings for partially observed diffusion processes

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published
Article number21
<mark>Journal publication date</mark>30/06/2022
<mark>Journal</mark>Statistics and Computing
Volume32
Number of pages18
Publication StatusPublished
Early online date15/02/22
<mark>Original language</mark>English

Abstract

We consider the problem of inference for nonlinear, multivariate diffusion processes, satisfying Itô stochastic differential equations (SDEs), using data at discrete times that may be incomplete and subject to measurement error. Our starting point is a state-of-the-art correlated pseudo-marginal Metropolis-Hastings algorithm, that uses correlated particle filters to induce strong and positive correlation between successive likelihood estimates. However, unless the measurement error or the dimension of the SDE is small, correlation can be eroded by the resampling steps in the particle filter. We therefore propose a novel augmentation scheme, that allows for conditioning on values of the latent process at the observation times, completely avoiding the need for resampling steps. We integrate over the uncertainty at the observation times with an additional Gibbs step. Connections between the resulting pseudo-marginal scheme and existing inference schemes for diffusion processes are made, giving a unified inference framework that encompasses Gibbs sampling and pseudo marginal schemes. The methodology is applied in three examples of increasing complexity. We find that our approach offers substantial increases in overall efficiency, compared to competing methods.

Bibliographic note

The final publication is available at Springer via http://dx.doi.org/10.1007/s11222-022-10083-5