Efficient Monte Carlo sampling by parallel marginalization
Jonathan Weare
Abstract
Markov chain Monte Carlo sampling methods often suffer from long correlation times. Consequently, these methods must be run for many steps to generate an independent sample. In this paper a method is proposed to overcome this difficulty. The method utilizes information from rapidly equilibrating coarse Markov chains that sample marginal distributions of the full system. This is accomplished through exchanges between the full chain and the auxiliary coarse chains. Results of numerical tests on the bridge sampling and filtering/smoothing problems for a stochastic differential equation are presented.
Create a lesson
Related papers
Sensitivity Calculus and its Numerical Implementation for Multi-D Hyperbolic Balance Laws
Olivia Dreßen, Michael Herty, Adrian Kolb et al.
A Unified Framework for Wasserstein Convergence of ULMC Methods beyond Log-Concavity: Old and New
Wanjie Lyu, Xiaojie Wang, Bin Yang
Beyond PINNs: A Unified Gauss--Newton and Petrov--Galerkin Framework for Neural and Hybrid PDE Solvers
Nilo Schwencke, Roland Maier
Incremental Column Subset Selection via Conditional Determinantal Point Processes
Laura Grigori, Zhipeng Xue
A Hybrid High-Order Method for the Elasticity Problem with Linear Slip Interface
Erik Burman, Peiqi Huang
Adaptive Sparse-grid Discontinuous Galerkin Approximations the Bhatnagar--Gross--Krook Model
Stefan Schnake, Miroslav Stoyanov, Eirik Endeve et al.