Efficient Discretization‐Independent Bayesian Inversion of High‐Dimensional Multi‐Gaussian Priors Using a Hybrid MCMC. Issue 8 (12th August 2021)

• Record Type: Journal Article
• Authors: Reuschen, Sebastian; Jobst, Fabian; Nowak, Wolfgang
• Is Part Of: Water resources research. Volume 57:Issue 8(2021)
• Page Start: n/a
• Page End: n/a
• Publication Date: 2021-08-12
• Subjects: inference -- multipoint geostatistics -- training image -- Gibbs sampling -- groundwater -- hydraulic conductivity; Hydrology -- Periodicals; 333.91
• DOI: 10.1029/2021WR030051
• Languages: English
• ISSNs: 0043-1397

Abstract

Abstract: In geostatistics, Gaussian random fields are often used to model heterogeneities of soil or subsurface parameters. To give spatial approximations of these random fields, they are discretized. Then, different techniques of geostatistical inversion are used to condition them on measurement data. Among these techniques, Markov chain Monte Carlo (MCMC) techniques stand out, because they yield asymptotically unbiased conditional realizations. However, standard Markov Chain Monte Carlo (MCMC) methods suffer the curse of dimensionality when refining the discretization. This means that their efficiency decreases rapidly with an increasing number of discretization cells. Several MCMC approaches have been developed such that the MCMC efficiency does not depend on the discretization of the random field. The preconditioned Crank Nicolson Markov Chain Monte Carlo (pCN‐MCMC) and the sequential Gibbs (or block‐Gibbs) sampling are two examples. This paper presents a combination of both approaches with the goal to further reduce the computational costs. Our algorithm, the sequential pCN‐MCMC, will depend on two tuning‐parameters: the correlation parameter β of the pCN approach and the block size κ of the sequential Gibbs approach. The original pCN‐MCMC and the Gibbs sampling algorithm are special cases of our method. We present an algorithm that automatically finds the best tuning‐parameter combination ( κ and β ) during the burn‐in‐phase of the algorithm, thus choosing the best possible hybrid between the two methods. In our test cases, we achieve a speedup factors of 1–5.5 over pCN and of 1–6.5 over Gibbs. Furthermore, we provide the MATLAB implementation of our method as open‐source code. Key Points: A hybrid MCMC between the sequential Gibbs and the pCN‐MCMC approach is presented This hybrid MCMC is more efficient than both special cases We present an adaptive algorithm to optimize the hyper‐parameters of this hybrid MCMC during burn‐in