Optimal importance sampling for overdamped Langevin dynamics

07/11/2023
by   M. Chak, et al.
0

Calculating averages with respect to multimodal probability distributions is often necessary in applications. Markov chain Monte Carlo (MCMC) methods to this end, which are based on time averages along a realization of a Markov process ergodic with respect to the target probability distribution, are usually plagued by a large variance due to the metastability of the process. In this work, we mathematically analyze an importance sampling approach for MCMC methods that rely on the overdamped Langevin dynamics. Specifically, we study an estimator based on an ergodic average along a realization of an overdamped Langevin process for a modified potential. The estimator we consider incorporates a reweighting term in order to rectify the bias that would otherwise be introduced by this modification of the potential. We obtain an explicit expression in dimension 1 for the biasing potential that minimizes the asymptotic variance of the estimator for a given observable, and propose a general numerical approach for approximating the optimal potential in the multi-dimensional setting. We also investigate an alternative approach where, instead of the asymptotic variance for a given observable, a weighted average of the asymptotic variances corresponding to a class of observables is minimized. Finally, we demonstrate the capabilities of the proposed method by means of numerical experiments.

READ FULL TEXT
research
05/18/2018

On a Metropolis-Hastings importance sampling estimator

A classical approach for approximating expectations of functions w.r.t. ...
research
04/10/2017

Group Importance Sampling for Particle Filtering and MCMC

Importance Sampling (IS) is a well-known Monte Carlo technique that appr...
research
05/08/2023

Self-Repellent Random Walks on General Graphs – Achieving Minimal Sampling Variance via Nonlinear Markov Chains

We consider random walks on discrete state spaces, such as general undir...
research
05/01/2018

Scalable Importance Tempering and Bayesian Variable Selection

We propose a Monte Carlo algorithm to sample from high-dimensional proba...
research
10/15/2016

Markov Chain Truncation for Doubly-Intractable Inference

Computing partition functions, the normalizing constants of probability ...
research
01/23/2019

Coupling the reduced-order model and the generative model for an importance sampling estimator

In this work, we develop an importance sampling estimator by coupling th...
research
02/28/2021

Accelerated Jarzynski Estimator with Deterministic Virtual Trajectories

The Jarzynski estimator is a powerful tool that uses nonequilibrium stat...

Please sign up or login with your details

Forgot password? Click here to reset