Related papers: Discrepancy-based error estimates for Quasi-Monte …
We consider Metropolis Hastings MCMC in cases where the log of the ratio of target distributions is replaced by an estimator. The estimator is based on m samples from an independent online Monte Carlo simulation. Under some conditions on…
Generalized t-tests are constructed under weaker than normal conditions. In the first part of this paper we assume only the symmetry (around zero) of the error distribution (i). In the second part we assume that the error distribution is a…
We introduce a powerful and flexible MCMC algorithm for stochastic simulation. The method builds on a pseudo-marginal method originally introduced in [Genetics 164 (2003) 1139--1160], showing how algorithms which are approximations to an…
For random variables produced through the inverse transform method, approximate random variables are introduced, which are produced by approximations to a distribution's inverse cumulative distribution function. These approximations are…
Sequential Monte Carlo Samplers are a class of stochastic algorithms for Monte Carlo integral estimation w.r.t. probability distributions, which combine elements of Markov chain Monte Carlo methods and importance sampling/resampling…
Quantum computing was so far mainly concerned with discrete problems. Recently, E. Novak and the author studied quantum algorithms for high dimensional integration and dealt with the question, which advantages quantum computing can bring…
In classical estimation theory, the central limit theorem implies that the statistical error in a measurement outcome can be reduced by an amount proportional to n^(-1/2) by repeating the measures n times and then averaging. Using quantum…
Statisticians often use Monte Carlo methods to approximate probability distributions, primarily with Markov chain Monte Carlo and importance sampling. Sequential Monte Carlo samplers are a class of algorithms that combine both techniques to…
In this paper, we consider Quasi-Monte Carlo (QMC) worst case error of weighted smooth function classes in $C^\infty[0,1]^s$ by a digital net over $\mathbb F_2$. We show that the ratio of the worst case error to the QMC integration error of…
In this work, we propose a smart idea to couple importance sampling and Multilevel Monte Carlo (MLMC). We advocate a per level approach with as many importance sampling parameters as the number of levels, which enables us to compute the…
This article provides a survey of recent research efforts on the application of quasi-Monte Carlo (QMC) methods to elliptic partial differential equations (PDEs) with random diffusion coefficients. It considers, and contrasts, the uniform…
Monte Carlo sampling is a powerful toolbox of algorithmic techniques widely used for a number of applications wherein some noisy quantity, or summary statistic thereof, is sought to be estimated. In this paper, we survey the literature for…
We establish a deterministic and stochastic spherical quasi-interpolation framework featuring scaled zonal kernels derived from radial basis functions on the ambient Euclidean space. The method incorporates both quasi-Monte Carlo and Monte…
We consider the problem of estimating expectations with respect to a target distribution with an unknown normalizing constant, and where even the unnormalized target needs to be approximated at finite resolution. This setting is ubiquitous…
This paper investigates the minimum mean square error (MMSE) estimation of x, given the observation y = Hx+n, when x and n are independent and Gaussian Mixture (GM) distributed. The introduction of GM distributions, represents a…
Determinantal points processes are a promising but relatively under-developed tool in machine learning and statistical modelling, being the canonical statistical example of distributions with repulsion. While their mathematical formulation…
The Monte Carlo algorithm is increasingly utilized, with its central step involving computer-based random sampling from stochastic models. While both Markov Chain Monte Carlo (MCMC) and Reject Monte Carlo serve as sampling methods, the…
In this paper, we study the asymptotic error distribution for a two-level irregular discretization scheme of the solution to the stochastic differential equations (SDE for short) driven by a continuous semimartingale and obtain a central…
The naive importance sampling estimator, based on samples from a single importance density, can be numerically unstable. Instead, we consider generalized importance sampling estimators where samples from more than one probability…
In this paper, we study randomized quasi-Monte Carlo (QMC) integration using digitally shifted digital nets. We express the mean square QMC error of the $n$-th discrete approximation $f_n$ of a function $f\colon[0,1)^s\to \mathbb{R}$ for…