The computational cost of blocking for sampling discretely observed diffusions

09/22/2020
by   Marcin Mider, et al.
0

Many approaches for conducting Bayesian inference on discretely observed diffusions involve imputing diffusion bridges between observations. This can be computationally challenging in settings in which the temporal horizon between subsequent observations is large, due to the poor scaling of algorithms for simulating bridges as observation distance increases. It is common in practical settings to use a blocking scheme, in which the path is split into a (user-specified) number of overlapping segments and a Gibbs sampler is employed to update segments in turn. Substituting the independent simulation of diffusion bridges for one obtained using blocking introduces an inherent trade-off: we are now imputing shorter bridges at the cost of introducing a dependency between subsequent iterations of the bridge sampler. This is further complicated by the fact that there are a number of possible ways to implement the blocking scheme, each of which introduces a different dependency structure between iterations. Although blocking schemes have had considerable empirical success in practice, there has been no analysis of this trade-off nor guidance to practitioners on the particular specifications that should be used to obtain a computationally efficient implementation. In this article we conduct this analysis (under the simplifying assumption that the underlying diffusion is a Gaussian process), and demonstrate that the expected computational cost of a blocked path-space rejection sampler scales asymptotically at an almost cubic rate with respect to the observation distance. Numerical experiments suggest applicability of both the results of our paper and the guidance we provide beyond the class of linear diffusions considered.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

08/02/2016

Blocking Collapsed Gibbs Sampler for Latent Dirichlet Allocation Models

The latent Dirichlet allocation (LDA) model is a widely-used latent vari...
03/25/2019

Simulating bridges using confluent diffusions

Diffusions are a fundamental class of models in many fields, including f...
07/23/2019

Efficient inference for stochastic differential mixed-effects models using correlated particle pseudo-marginal algorithms

We perform fully Bayesian inference for stochastic differential equation...
01/08/2021

Spatiotemporal blocking of the bouncy particle sampler for efficient inference in state space models

We propose a novel blocked version of the continuous-time bouncy particl...
05/31/2018

Skyblocking for Entity Resolution

In this paper, for the first time, we introduce the concept of skyblocki...
06/24/2020

The Boomerang Sampler

This paper introduces the Boomerang Sampler as a novel class of continuo...
10/25/2019

A Gibbs sampler for a class of random convex polytopes

We present a Gibbs sampler to implement the Dempster-Shafer (DS) theory ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.