scispace - formally typeset
Y

Yvo Pokern

Researcher at University College London

Publications -  20
Citations -  443

Yvo Pokern is an academic researcher from University College London. The author has contributed to research in topics: Gaussian & Bayesian probability. The author has an hindex of 10, co-authored 17 publications receiving 394 citations. Previous affiliations of Yvo Pokern include University of Warwick.

Papers
More filters
Journal ArticleDOI

Nonparametric estimation of diffusions: a differential equations approach

TL;DR: In this paper, a Gaussian prior measure is chosen in the function space by specifying its precision operator as an appropriate differential operator for the unknown functional, and a Bayesian-Gaussian conjugate analysis is applied to estimate the drift of models used in molecular dynamics and financial econometrics.
Journal ArticleDOI

Parameter estimation for partially observed hypoelliptic diffusions

TL;DR: In this article, a deterministic scan Gibbs sampler was used to combine missing data in the unobserved solution components, and parameters, alternating between missing data and the observed solution components.
Posted Content

Parameter Estimation for Partially Observed Hypoelliptic Diffusions

TL;DR: In this paper, a deterministic scan Gibbs sampler alternating between missing data in the unobserved solution components, and parameters is used to model a variety of phenomena in applications ranging from molecular dynamics to audio signal analysis.
Journal ArticleDOI

Posterior consistency via precision operators for Bayesian nonparametric drift estimation in SDEs

TL;DR: In this article, a Bayesian approach to nonparametric estimation of the periodic drift function of a one-dimensional diffusion from continuous-time data is proposed, where the posterior is also Gaussian with the precision operator also of differential form.
Journal ArticleDOI

Iterative numerical methods for sampling from high dimensional Gaussian distributions

TL;DR: It is shown that some of the methods for computing the samples iteratively adapting ideas from numerical linear algebra are competitive and faster than Cholesky sampling and that a parallel version of one method on a Graphical Processing Unit (GPU) using CUDA can introduce a speed-up of up to 30x.