Related papers: The $b$-adic tent transformation for quasi-Monte C…
We seek shifted lattice rules that are good for high dimensional integration over the unit cube in the setting of an unanchored weighted Sobolev space of functions with square-integrable mixed first derivatives. Many existing studies rely…
Quasi-Monte Carlo methods are a way of improving the efficiency of Monte Carlo methods. Digital nets and sequences are one of the low discrepancy point sets used in quasi-Monte Carlo methods. This thesis presents the three new results…
This article provides an overview of some interfaces between the theory of quasi-Monte Carlo (QMC) methods and applications. We summarize three QMC theoretical settings: first order QMC methods in the unit cube $[0,1]^s$ and in…
We apply the Quasi Monte Carlo (QMC) and recursive numerical integration methods to evaluate the Euclidean, discretized time path-integral for the quantum mechanical anharmonic oscillator and a topological quantum mechanical rotor model.…
We take advantage of recent improvements in the grand canonical Hybrid Monte Carlo (HMC) algorithm, to perform a precision study of the single-particle gap in the hexagonal Hubbard model, with on-site electron-electron interactions. After…
We consider adaptive increasingly rare Markov chain Monte Carlo (MCMC) algorithms, which are adaptive MCMC methods, where the adaptation concerning the "past'' happens less and less frequently over time. Under a contraction assumption with…
Despite possessing the low-discrepancy property, the classical d dimensional Halton sequence is known to exhibit poorly distributed projections when d becomes even moderately large. This, in turn, often implies bad performance when…
Quadrature rules using higher order digital nets and sequences are known to exploit the smoothness of a function for numerical integration and to achieve an improved rate of convergence as compared to classical digital nets and sequences…
In this paper, we study quasi-Monte Carlo (QMC) rules for numerical integration. J. Dick proved a Koksma-Hlawka type inequality for $\alpha$-smooth integrands and gave an explicit construction of QMC rules achieving the optimal rate of…
The worst case integration error in reproducing kernel Hilbert spaces of standard Monte Carlo methods with n random points decays as $n^{-1/2}$. However, re-weighting of random points can sometimes be used to improve the convergence order.…
Most quasi-Monte Carlo research focuses on sampling from the unit cube. Many problems, especially in computer graphics, are defined via quadrature over the unit triangle. Quasi-Monte Carlo methods for the triangle have been developed by…
Quasi-Monte Carlo (QMC) points are a substitute for plain Monte Carlo (MC) points that greatly improve integration accuracy under mild assumptions on the problem. Because QMC can give errors that are $o(1/n)$ as $n\to\infty$, changing even…
In this paper, we consider the numerical solution of a nonlinear Schrodinger equation with spatial random potential. The randomly shifted quasi-Monte Carlo (QMC) lattice rule combined with the time-splitting pseudospectral discretization is…
We introduce kernel thinning, a new procedure for compressing a distribution $\mathbb{P}$ more effectively than i.i.d. sampling or standard thinning. Given a suitable reproducing kernel $\mathbf{k}_{\star}$ and $O(n^2)$ time, kernel…
In this paper we introduce a reproducing kernel Hilbert space defined on $\mathbb{R}^{d+1}$ as the tensor product of a reproducing kernel defined on the unit sphere $\mathbb{S}^{d}$ in $\mathbb{R}^{d+1}$ and a reproducing kernel defined on…
Gerber and Chopin (2015) recently introduced Sequential quasi-Monte Carlo (SQMC) algorithms as an efficient way to perform filtering in state-space models. The basic idea is to replace random variables with low-discrepancy point sets, so as…
This paper investigates quasi-Monte Carlo (QMC) integration of Lebesgue integrable functions with respect to a density function over $\mathbb{R}^s$. We extend the construction-free median QMC rule proposed by Goda and L'ecuyer (SIAM J. Sci.…
The standard Kernel Quadrature method for numerical integration with random point sets (also called Bayesian Monte Carlo) is known to converge in root mean square error at a rate determined by the ratio $s/d$, where $s$ and $d$ encode the…
Approximate Bayesian computation (ABC) has gained popularity over the past few years for the analysis of complex models arising in population genetic, epidemiology and system biology. Sequential Monte Carlo (SMC) approaches have become work…
Existing multilevel quasi-Monte Carlo (MLQMC) methods often rely on multiple independent randomizations of a low-discrepancy (LD) sequence to estimate statistical errors on each level. While this approach is standard, it can be less…