Generalized Transitional Markov Chain Monte Carlo Sampling Technique for Bayesian Inversion

TL;DR

This paper introduces a generalized TMCMC sampling method that improves efficiency and robustness for Bayesian inversion, especially in high-dimensional, multi-modal, or implicit prior scenarios, demonstrated through practical tests.

Contribution

A novel generalization of TMCMC that addresses limitations with implicit priors, high-dimensionality, and multi-modality, enhancing computational efficiency and robustness in Bayesian inversion.

Findings

Proven convergence of the proposed algorithm.

Enhanced efficiency in test inverse problems.

Successful application in oil and gas industry scenarios.

Abstract

In the context of Bayesian inversion for scientific and engineering modeling, Markov chain Monte Carlo sampling strategies are the benchmark due to their flexibility and robustness in dealing with arbitrary posterior probability density functions (PDFs). However, these algorithms been shown to be inefficient when sampling from posterior distributions that are high-dimensional or exhibit multi-modality and/or strong parameter correlations. In such contexts, the sequential Monte Carlo technique of transitional Markov chain Monte Carlo (TMCMC) provides a more efficient alternative. Despite the recent applicability for Bayesian updating and model selection across a variety of disciplines, TMCMC may require a prohibitive number of tempering stages when the prior PDF is significantly different from the target posterior. Furthermore, the need to start with an initial set of samples from the prior distribution may present a challenge when dealing with implicit priors, e.g. based on feasible regions. Finally, TMCMC can not be used for inverse problems with improper prior PDFs that represent lack of prior knowledge on all or a subset of parameters. In this investigation, a generalization of TMCMC that alleviates such challenges and limitations is proposed, resulting in a tempering sampling strategy of enhanced robustness and computational efficiency. Convergence analysis of the proposed sequential Monte Carlo algorithm is presented, proving that the distance between the intermediate distributions and the target posterior distribution monotonically decreases as the algorithm proceeds. The enhanced efficiency associated with the proposed generalization is highlighted through a series of test inverse problems and an engineering application in the oil and gas industry.