We present a general framework for Bayesian estimation of incompletely observed multivariate diffusion processes. Observations are assumed to be discrete in time, noisy and incomplete. We assume the drift and diffusion coefficient depend on an unknown parameter. A data-augmentation algorithm for drawing from the posterior distribution is presented which is based on simulating diffusion bridges conditional on a noisy incomplete observation at an intermediate time. The dynamics of such filtered bridges are derived and it is shown how these can be simulated using a generalised version of the guided proposals introduced in Schauer, Van der Meulen and Van Zanten (2017, Bernoulli 23(4A)).
Besides potentially difficult simulation of diffusion bridges, there is another well known problem related to MCMC-algorithm for the problem considered. In case there are unknown parameters in the diffusion coefficient @math , any MCMC-scheme that includes the latent diffusion bridges leads to a scheme that is reducible. The reason for this is that a continuous sample path fixes the diffusion coefficient by means of its quadratic variation process. This phenomenon was first discussed in @cite_6 and a solution to it was proposed in both @cite_20 and @cite_8 within the projection-simulation setup. The resulting algorithm is referred to as the innovation scheme, as the innovations of the bridges are used as auxiliary data, instead of the discretised bridges themselves. A slightly more general solution was recently put forward in @cite_3 using the simulation-projection setup.
@cite_20 @cite_3 @cite_6 @cite_8
2148381455 2436131410 2088413985 2134589175
This paper provides methods for carrying out likelihood based inference for diffusion driven models, for example discretely observed multivariate diffusions, continuous time stochastic volatility models and counting process models. The diffusions can potentially be non-stationary. Although our methods are sampling based, making use of Markov chain Monte Carlo methods to sample the posterior distribution of the relevant unknowns, our general strategies and details are different from previous work along these lines. The methods we develop are simple to implement and simulation efficient. Importantly, unlike previous methods, the performance of our technique is not worsened, in fact it improves, as the degree of latent augmentation is increased to reduce the bias of the Euler approximation. In addition, our method is not subject to a degeneracy that afflicts previous techniques when the degree of latent augmentation is increased. We also discuss issues of model choice, model checking and filtering. The techniques and ideas are applied to both simulated and real data. Estimation of parameters of a diffusion based on discrete time observations poses a difficult problem due to the lack of a closed form expression for the likelihood. From a Bayesian computational perspective it can be casted as a missing data problem where the diffusion bridges in between discrete-time observations are missing. The computational problem can then be dealt with using a Markov-chain Monte-Carlo method known as data-augmentation. If unknown parameters appear in the diffusion coefficient, direct implementation of data-augmentation results in a Markov chain that is reducible. Furthermore, data-augmentation requires efficient sampling of diffusion bridges, which can be difficult, especially in the multidimensional case. We present a general framework to deal with with these problems that does not rely on discretisation. The construction generalises previous approaches and sheds light on the assumptions necessary to make these approaches work. We define a random-walk type Metropolis-Hastings sampler for updating diffusion bridges. Our methods are illustrated using guided proposals for sampling diffusion bridges. These are Markov processes obtained by adding a guiding term to the drift of the diffusion. We give general guidelines on the construction of these proposals and introduce a time change and scaling of the guided proposal that reduces discretisation error. Numerical examples demonstrate the performance of our methods. In this paper, we introduce a new Markov chain Monte Carlo approach to Bayesian analysis of discretely observed diffusion processes. We treat the paths between any two data points as missing data. As such, we show that, because of full dependence between the missing paths and the volatility of the diffusion, the rate of convergence of basic algorithms can be arbitrarily slow if the amount of the augmentation is large. We offer a transformation of the diffusion which breaks down dependency between the transformed missing paths and the volatility of the diffusion. We then propose two efficient Markov chain Monte Carlo algorithms to sample from the posterior-distribution of the transformed missing observations and the parameters of the diffusion. We apply our results to examples involving simulated data and also to Eurodollar short-rate data. Diffusion processes governed by stochastic differential equations (SDEs) are a well-established tool for modelling continuous time data from a wide range of areas. Consequently, techniques have been developed to estimate diffusion parameters from partial and discrete observations. Likelihood-based inference can be problematic as closed form transition densities are rarely available. One widely used solution involves the introduction of latent data points between every pair of observations to allow a Euler-Maruyama approximation of the true transition densities to become accurate. In recent literature, Markov chain Monte Carlo (MCMC) methods have been used to sample the posterior distribution of latent data and model parameters; however, naive schemes suffer from a mixing problem that worsens with the degree of augmentation. A global MCMC scheme that can be applied to a large class of diffusions and whose performance is not adversely affected by the number of latent values is therefore explored. The methodology is illustrated by estimating parameters governing an auto-regulatory gene network, using partial and discrete data that are subject to measurement error.