1 January 2017 in SIAM Journal on Numerical Analysis
In this paper the filtering of partially observed diffusions, with discrete-time observations, is considered. It is assumed that only biased approximations of the diffusion can be obtained for choice of an accuracy parameter indexed by l. A multilevel estimator is proposed consisting of a telescopic sum of increment estimators associated to the successive levels. The work associated to $\mathcal{O}(\varepsilon^2)$ mean-squared error between the multilevel estimator and average with respect to the filtering distribution is shown to scale optimally, for example, as $\mathcal{O}(\varepsilon^{-2})$ for optimal rates of convergence of the underlying diffusion approximation. The method is illustrated with some toy examples as well as estimation of interest rate based on real S&P 500 stock price data.
1 January 2014 in Journal of Statistical Software
The YUIMA Project: A Computational Framework for Simulation and Inference of Stochastic Differential Equations
17 March 2017 in Advances in Applied Probability
We consider the numerical approximation of the filtering problem in high dimensions, that is, when the hidden state lies in ℝd with large d. For low-dimensional problems, one of the most popular numerical procedures for consistent inference is the class of approximations termed particle filters or sequential Monte Carlo methods. However, in high dimensions, standard particle filters (e.g. the bootstrap particle filter) can have a cost that is exponential in d for the algorithm to be stable in an appropriate sense. We develop a new particle filter, called the space‒time particle filter, for a specific family of state-space models in discrete time. This new class of particle filters provides consistent Monte Carlo estimates for any fixed d, as do standard particle filters. Moreover, when there is a spatial mixing element in the dimension of the state vector, the space‒time particle filter will scale much better with d than the standard filter for a class of filtering problems. We illustrate this analytically for a model of a simple independent and identically distributed structure and a model of an L-Markovian structure (L≥ 1, L independent of d) in the d-dimensional space direction, when we show that the algorithm exhibits certain stability properties as d increases at a cost 𝒪(nNd2), where n is the time parameter and N is the number of Monte Carlo samples, which are fixed and independent of d. Our theoretical results are also supported by numerical simulations on practical models of complex structures. The results suggest that it is indeed possible to tackle some high-dimensional filtering problems using the space‒time particle filter that standard particle filters cannot handle.
16 October 2014 in Statistical Inference for Stochastic Processes
7 November 2016 in Statistics and Computing
1 January 2018 in SIAM Journal on Scientific Computing
In this article we consider static Bayesian parameter estimation for partially observed diffusions that are discretely observed. We work under the assumption that one must resort to discretizing the underlying diffusion process, for instance, using the Euler--Maruyama method. Given this assumption, we show how one can use Markov chain Monte Carlo (MCMC) and particularly particle MCMC [C. Andrieu, A. Doucet, and R. Holenstein, J. R. Stat. Soc. Ser. B Stat. Methodol., 72 (2010), 269--342] to implement a new approximation of the multilevel (ML) Monte Carlo (MC) collapsing sum identity. Our approach comprises constructing an approximate coupling of the posterior density of the joint distribution over parameter and hidden variables at two different discretization levels and then correcting by an importance sampling method. The variance of the weights are independent of the length of the observed data set. The utility of such a method is that, for a prescribed level of mean square error, the cost of this MLMC method is provably less than i.i.d. sampling from the posterior associated to the most precise discretization. However the method here comprises using only known and efficient simulation methodologies. The theoretical results are illustrated by inference of the parameters of two prototypical processes given noisy partial observations of the process: the first is an Ornstein--Uhlenbeck process and the second is a more general Langevin equation.