Searcharxiv⌕ Search

arXiv subjects

Frank van der Meulen

Publications and source records attributed to Frank van der Meulen.

At least 37 records · Page 2Linked to original sources

Continuous-discrete smoothing of diffusions

Suppose X is a multivariate diffusion process that is observed discretely in time. At each observation time, a transformation of the state of the process is observed with noise. The smoothing problem consists of recovering the path of the process, consistent with the observations. We derive a novel Markov Chain Monte Carlo algorithm to sample from the exact smoothing distribution. The resulting algorithm is called the Backward Filtering Forward Guiding (BFFG) algorithm. We extend the algorithm to include parameter estimation. The proposed method relies on guided proposals introduced in Schauer et al. (2017). We illustrate its efficiency in a number of challenging problems.

stat.CO↗

A piecewise deterministic Monte Carlo method for diffusion bridges

We introduce the use of the Zig-Zag sampler to the problem of sampling conditional diffusion processes (diffusion bridges). The Zig-Zag sampler is a rejection-free sampling scheme based on a non-reversible continuous piecewise deterministic Markov process. Similar to the Lévy-Ciesielski construction of a Brownian motion, we expand the diffusion path in a truncated Faber-Schauder basis. The coefficients within the basis are sampled using a Zig-Zag sampler. A key innovation is the use of the fully local Algorithm for the Zig-Zag sampler that allows to exploit the sparsity structure implied by the dependency graph of the coefficients and by the subsampling technique to reduce the complexity of the algorithm. We illustrate the performance of the proposed methods in a number of examples.

math.ST↗

Bayesian nonparametric estimation in the current status continuous mark model

In this paper we consider the current status continuous mark model where, if the event takes place before an inspection time $T$ a "continuous mark" variable is observed as well. A Bayesian nonparametric method is introduced for estimating the distribution function of the joint distribution of the event time ($X$) and mark ($Y$). We consider a prior that is obtained by assigning a distribution on heights of cells, where cells are obtained from a partition of the support of the density of $(X, Y)$. As distribution on cell heights, we consider both a Dirichlet prior and a prior based on the graph-Laplacian on the specified partition. Our main result shows that under appropriate conditions, the posterior distribution function contracts pointwisely at rate $\left(n/\log n\right)^{-\fracρ{3(ρ+2)}}$, where $ρ$ is the Hölder smoothness of the true density. In addition to our theoretical results, we provide computational methods for drawing from the posterior using probabilistic programming. The performance of our computational methods is illustrated in two examples.

math.ST↗

Nonparametric Bayesian estimation of a concave distribution function with mixed interval censored data

Assume we observe a finite number of inspection times together with information on whether a specific event has occurred before each of these times. Suppose replicated measurements are available on multiple event times. The set of inspection times, including the number of inspections, may be different for each event. This is known as mixed case interval censored data. We consider Bayesian estimation of the distribution function of the event time while assuming it is concave. We provide sufficient conditions on the prior such that the resulting procedure is consistent from the Bayesian point of view. We also provide computational methods for drawing from the posterior and illustrate the performance of the Bayesian method in both a simulation study and two real datasets.

math.ST↗

Bayesian estimation of a decreasing density

Suppose $X_1,\dots, X_n$ is a random sample from a bounded and decreasing density $f_0$ on $[0,\infty)$. We are interested in estimating such $f_0$, with special interest in $f_0(0)$. This problem is encountered in various statistical applications and has gained quite some attention in the statistical literature. It is well known that the maximum likelihood estimator is inconsistent at zero. This has led several authors to propose alternative estimators which are consistent. As any decreasing density can be represented as a scale mixture of uniform densities, a Bayesian estimator is obtained by endowing the mixture distribution with the Dirichlet process prior. Assuming this prior, we derive contraction rates of the posterior density at zero by carefully revising arguments presented in Salomond (2014). Various methods for estimating the density are compared using a simulation study. We apply the Bayesian procedure to the current durations data described in Keiding et al.(2012).

math.ST↗

Decompounding discrete distributions: A non-parametric Bayesian approach

Suppose that a compound Poisson process is observed discretely in time and assume that its jump distribution is supported on the set of natural numbers. In this paper we propose a non-parametric Bayesian approach to estimate the intensity of the underlying Poisson process and the distribution of the jumps. We provide a MCMC scheme for obtaining samples from the posterior. We apply our method on both simulated and real data examples, and compare its performance with the frequentist plug-in estimator proposed by Buchmann and Grübel. On a theoretical side, we study the posterior from the frequentist point of view and prove that as the sample size $n\rightarrow\infty$, it contracts around the `true', data-generating parameters at rate $1/\sqrt{n}$, up to a $\log n$ factor.

math.ST↗

Fast and scalable non-parametric Bayesian inference for Poisson point processes

We study the problem of non-parametric Bayesian estimation of the intensity function of a Poisson point process. The observations are $n$ independent realisations of a Poisson point process on the interval $[0,T]$. We propose two related approaches. In both approaches we model the intensity function as piecewise constant on $N$ bins forming a partition of the interval $[0,T]$. In the first approach the coefficients of the intensity function are assigned independent gamma priors, leading to a closed form posterior distribution. On the theoretical side, we prove that as $n\rightarrow\infty,$ the posterior asymptotically concentrates around the "true", data-generating intensity function at an optimal rate for $h$-Hölder regular intensity functions ($0 < h\leq 1$). In the second approach we employ a gamma Markov chain prior on the coefficients of the intensity function. The posterior distribution is no longer available in closed form, but inference can be performed using a straightforward version of the Gibbs sampler. Both approaches scale well with sample size, but the second is much less sensitive to the choice of $N$. Practical performance of our methods is first demonstrated via synthetic data examples. We compare our second method with other existing approaches on the UK coal mining disasters data. Furthermore, we apply it to the US mass shootings data and Donald Trump's Twitter data.

stat.ME↗

Simulation of elliptic and hypo-elliptic conditional diffusions

Suppose $X$ is a multidimensional diffusion process. Assume that at time zero the state of $X$ is fully observed, but at time $T>0$ only linear combinations of its components are observed. That is, one only observes the vector $L X_T$ for a given matrix $L$. In this paper we show how samples from the conditioned process can be generated. The main contribution of this paper is to prove that guided proposals, introduced in Schauer et al. (2017), can be used in a unified way for both uniformly and hypo-elliptic diffusions, also when $L$ is not the identity matrix. This is illustrated by excellent performance in two challenging cases: a partially observed twice integrated diffusion with multiple wells and the partially observed FitzHugh-Nagumo model.

math.PR↗

Bayesian wavelet de-noising with the caravan prior

According to both domain expert knowledge and empirical evidence, wavelet coefficients of real signals tend to exhibit clustering patterns, in that they contain connected regions of coefficients of similar magnitude (large or small). A wavelet de-noising approach that takes into account such a feature of the signal may in practice outperform other, more vanilla methods, both in terms of the estimation error and visual appearance of the estimates. Motivated by this observation, we present a Bayesian approach to wavelet de-noising, where dependencies between neighbouring wavelet coefficients are a priori modelled via a Markov chain-based prior, that we term the caravan prior. Posterior computations in our method are performed via the Gibbs sampler. Using representative synthetic and real data examples, we conduct a detailed comparison of our approach with a benchmark empirical Bayes de-noising method (due to Johnstone and Silverman). We show that the caravan prior fares well and is therefore a useful addition to the wavelet de-noising toolbox.

stat.ME↗

Nonparametric Bayesian volatility estimation

Given discrete time observations over a fixed time interval, we study a nonparametric Bayesian approach to estimation of the volatility coefficient of a stochastic differential equation. We postulate a histogram-type prior on the volatility with piecewise constant realisations on bins forming a partition of the time interval. The values on the bins are assigned an inverse Gamma Markov chain (IGMC) prior. Posterior inference is straightforward to implement via Gibbs sampling, as the full conditional distributions are available explicitly and turn out to be inverse Gamma. We also discuss in detail the hyperparameter selection for our method. Our nonparametric Bayesian approach leads to good practical results in representative simulation examples. Finally, we apply it on a classical data set in change-point analysis: weekly closings of the Dow-Jones industrial averages.

stat.ME↗

Nonparametric Bayesian estimation of a Hölder continuous diffusion coefficient

We consider a nonparametric Bayesian approach to estimate the diffusion coefficient of a stochastic differential equation given discrete time observations over a fixed time interval. As a prior on the diffusion coefficient, we employ a histogram-type prior with piecewise constant realisations on bins forming a partition of the time interval. Specifically, these constants are realizations of independent inverse Gamma distributed randoma variables. We justify our approach by deriving the rate at which the corresponding posterior distribution asymptotically concentrates around the data-generating diffusion coefficient. This posterior contraction rate turns out to be optimal for estimation of a Hölder-continuous diffusion coefficient with smoothness parameter $0<λ\leq 1.$ Our approach is straightforward to implement, as the posterior distributions turn out to be inverse Gamma again, and leads to good practical results in a wide range of simulation examples. Finally, we apply our method on exchange rate data sets.

math.ST↗

On residual and guided proposals for diffusion bridge simulation

Recently Whitaker et al. (2017) considered Bayesian estimation of diffusion driven mixed effects models using data-augmentation. The missing data, diffusion bridges connecting discrete time observations, are drawn using a "residual bridge construct". In this paper we compare this construct (which we call residual proposal) with the guided proposals introduced in Schauer et al. 2017. It is shown that both approaches are related, but use a different approximation to the intractable stochastic differential equation of the true diffusion bridge. It reveals that the computational complexity of both approaches is similar. Some examples are included to compare the ability of both proposals to capture local nonlinearities in the dynamics of the true bridge.

stat.CO↗

Adaptive nonparametric drift estimation for diffusion processes using Faber-Schauder expansions

We consider the problem of nonparametric estimation of the drift of a continuously observed one-dimensional diffusion with periodic drift. Motivated by computational considerations, van der Meulen e.a. (2014) defined a prior on the drift as a randomly truncated and randomly scaled Faber-Schauder series expansion with Gaussian coefficients. We study the behaviour of the posterior obtained from the prior from a frequentist asymptotic point of view. If the true data generating drift is smooth, it is proved that the posterior is adaptive with posterior contraction rates for the $L_2$-norm that are optimal up to a log factor. Moreover, contraction rates in $L_p$-norms with $p\in (2,\infty]$ are derived as well.

math.ST↗

Bayesian estimation of incompletely observed diffusions

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 et al. (2016).

stat.ME↗

Bayesian estimation of discretely observed multi-dimensional diffusion processes using guided proposals

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.

stat.CO↗

A non-parametric Bayesian approach to decompounding from high frequency data

Given a sample from a discretely observed compound Poisson process, we consider non-parametric estimation of the density $f_0$ of its jump sizes, as well as of its intensity $λ_0.$ We take a Bayesian approach to the problem and specify the prior on $f_0$ as the Dirichlet location mixture of normal densities. An independent prior for $λ_0$ is assumed to be compactly supported and to possess a positive density with respect to the Lebesgue measure. We show that under suitable assumptions the posterior contracts around the pair $(λ_0,f_0)$ at essentially (up to a logarithmic factor) the $\sqrt{nΔ}$-rate, where $n$ is the number of observations and $Δ$ is the mesh size at which the process is sampled. The emphasis is on high frequency data, $Δ\to 0$, but the obtained results are also valid for fixed $Δ$. In either case we assume that $nΔ\rightarrow\infty$. Our main result implies existence of Bayesian point estimates converging (in the frequentist sense, in probability) to $(λ_0,f_0)$ at the same rate. We also discuss a practical implementation of our approach. The computational problem is dealt with by inclusion of auxiliary variables and we develop a Markov Chain Monte Carlo algorithm that samples from the joint distribution of the unknown parameters in the mixture density and the introduced auxiliary variables. Numerical examples illustrate the feasibility of this approach.

math.ST↗

Guided proposals for simulating multi-dimensional diffusion bridges

A Monte Carlo method for simulating a multi-dimensional diffusion process conditioned on hitting a fixed point at a fixed future time is developed. Proposals for such diffusion bridges are obtained by superimposing an additional guiding term to the drift of the process under consideration. The guiding term is derived via approximation of the target process by a simpler diffusion processes with known transition densities. Acceptance of a proposal can be determined by computing the likelihood ratio between the proposal and the target bridge, which is derived in closed form. We show under general conditions that the likelihood ratio is well defined and show that a class of proposals with guiding term obtained from linear approximations fall under these conditions.

math.PR↗

Nonparametric Bayesian inference for multidimensional compound Poisson processes

Given a sample from a discretely observed multidimensional compound Poisson process, we study the problem of nonparametric estimation of its jump size density $r_0$ and intensity $λ_0$. We take a nonparametric Bayesian approach to the problem and determine posterior contraction rates in this context, which, under some assumptions, we argue to be optimal posterior contraction rates. In particular, our results imply the existence of Bayesian point estimates that converge to the true parameter pair $(r_0,λ_0)$ at these rates. To the best of our knowledge, construction of nonparametric density estimators for inference in the class of discretely observed multidimensional Lévy processes, and the study of their rates of convergence is a new contribution to the literature.

math.ST↗