2021
DOI: 10.1111/1365-2478.13081
|View full text |Cite
|
Sign up to set email alerts
|

A gradient‐based Markov chain Monte Carlo algorithm for elastic pre‐stack inversion with data and model space reduction

Abstract: The main challenge of Markov chain Monte Carlo sampling is to define a proposal distribution that simultaneously is a good approximation of the posterior probability while being inexpensive to manipulate. We present a gradient‐based Markov chain Monte Carlo inversion of pre‐stack seismic data in which the posterior sampling is accelerated by defining a proposal that is a local, Gaussian approximation of the posterior model, while a non‐parametric prior is assumed for the distribution of the elastic properties.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
8
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 7 publications
(8 citation statements)
references
References 36 publications
0
8
0
Order By: Relevance
“…Next, we compared our method to similar MCMC methods (Martin et al., 2012; Zhao & Sen, 2020; Aleardi, 2021). The key difference is that these methods focus on large‐scale problems, where the Hessian calculation becomes computationally prohibitive and requires a low‐rank or diagonal approximation.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Next, we compared our method to similar MCMC methods (Martin et al., 2012; Zhao & Sen, 2020; Aleardi, 2021). The key difference is that these methods focus on large‐scale problems, where the Hessian calculation becomes computationally prohibitive and requires a low‐rank or diagonal approximation.…”
Section: Discussionmentioning
confidence: 99%
“…The high computational cost associated with conventional random‐walk MCMC sampling, especially for high‐dimensional problems (due to the curse of dimensionality) has significantly limited the application of Bayesian approaches to WLI. To improve the efficiency of MCMC, common solutions include (1) reducing the dimension in the model space (Dosso & Wilmut, 2008), (2) combining MCMC with gradient approaches (Neal, 2011; Martin et al., 2012; Zhao & Sen, 2020; Aleardi, 2021) and (3) using surrogate/proxy models to approximate the full forward model (Dachanuwattana et al., 2018). Yet, to the extent of our knowledge, very few studies have focused their developments on the Bayesian inversion of borehole measurements.…”
Section: Introductionmentioning
confidence: 99%
“…The choice of the number of DCT coefficients to compress the model and data space should always constitute a compromise between the desired data and model resolution and the resulting computational cost of the inversion procedure. For the estimation of the optimal number of DCT coefficients needed to approximate the model and data spaceswe quantify how the variability of the true model and the observed data changes as the number of DCT coefficients varies, where the variability is defined as the ratio between the variance of the compressed model and data and the corresponding variances before the compression (Aleardi, 2021).…”
Section: Methodsmentioning
confidence: 99%
“…It is common in seismic data inversion to assume that the data uncertainty is uncorrelated and stationary (Aleardi, 2021;Aleardi & Salusti, 2020;Aleardi et al, 2018;Grana, 2020;Grana et al, 2022;Gunning & Sams, 2018;Li et al, 2022;Sengupta et al, 2021). Cordua et al (2009) assessed the impact of correlated noise on cross-borehole groundpenetrating radar data.…”
Section: Introductionmentioning
confidence: 99%