Population Quasi-Monte Carlo

12/26/2020
by   Chaofan Huang, et al.
0

Monte Carlo methods are widely used for approximating complicated, multidimensional integrals for Bayesian inference. Population Monte Carlo (PMC) is an important class of Monte Carlo methods, which utilizes a population of proposals to generate weighted samples that approximate the target distribution. The generic PMC framework iterates over three steps: samples are simulated from a set of proposals, weights are assigned to such samples to correct for mismatch between the proposal and target distributions, and the proposals are then adapted via resampling from the weighted samples. When the target distribution is expensive to evaluate, the PMC has its computational limitation since the convergence rate is 𝒪(N^-1/2). To address this, we propose in this paper a new Population Quasi-Monte Carlo (PQMC) framework, which integrates Quasi-Monte Carlo ideas within the sampling and adaptation steps of PMC. A key novelty in PQMC is the idea of importance support points resampling, a deterministic method for finding an "optimal" subsample from the weighted proposal samples. Moreover, within the PQMC framework, we develop an efficient covariance adaptation strategy for multivariate normal proposals. Lastly, a new set of correction weights is introduced for the weighted PMC estimator to improve the efficiency from the standard PMC estimator. We demonstrate the improved empirical convergence of PQMC over PMC in extensive numerical simulations and a friction drilling application.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2015

Layered Adaptive Importance Sampling

Monte Carlo methods represent the "de facto" standard for approximating ...
research
07/18/2019

Amortized Monte Carlo Integration

Current approaches to amortizing Bayesian inference focus solely on appr...
research
04/14/2022

Optimized Population Monte Carlo

Adaptive importance sampling (AIS) methods are increasingly used for the...
research
08/18/2018

Optimal proposals for Approximate Bayesian Computation

We derive the optimal proposal density for Approximate Bayesian Computat...
research
12/15/2021

M-Estimation based on quasi-processes from discrete samples of Levy processes

We consider M-estimation problems, where the target value is determined ...
research
08/19/2023

Transporting Higher-Order Quadrature Rules: Quasi-Monte Carlo Points and Sparse Grids for Mixture Distributions

Integration against, and hence sampling from, high-dimensional probabili...
research
09/18/2019

Collective sampling through a Metropolis-Hastings like method: kinetic theory and numerical experiments

The classical Metropolis-Hastings algorithm provides a simple method to ...

Please sign up or login with your details

Forgot password? Click here to reset