2016
DOI: 10.1137/141000749
|View full text |Cite
|
Sign up to set email alerts
|

Quantifying Uncertainties on Excursion Sets Under a Gaussian Random Field Prior

Abstract: We focus on the problem of estimating and quantifying uncertainties on the excursion set of a function under a limited evaluation budget. We adopt a Bayesian approach where the objective function is assumed to be a realization of a Gaussian random field. In this setting, the posterior distribution on the objective function gives rise to a posterior distribution on excursion sets. Several approaches exist to summarize the distribution of such sets based on random closed set theory. While the recently proposed V… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
34
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
8
2

Relationship

2
8

Authors

Journals

citations
Cited by 39 publications
(34 citation statements)
references
References 38 publications
0
34
0
Order By: Relevance
“…In what follows, the points G are called pilot points, borrowing the term from geostatistics (see,e.g. Scheidt, 2006, Chapter 4.2), and here they are selected with Algorihtm B from Azzimonti et al (2016). The number of pilot points can be empirically chosen by stopping when the optimum of Algorithm B's objective function stabilizes around a value.…”
Section: Approximation For Posterior Field Realizationsmentioning
confidence: 99%
“…In what follows, the points G are called pilot points, borrowing the term from geostatistics (see,e.g. Scheidt, 2006, Chapter 4.2), and here they are selected with Algorihtm B from Azzimonti et al (2016). The number of pilot points can be empirically chosen by stopping when the optimum of Algorithm B's objective function stabilizes around a value.…”
Section: Approximation For Posterior Field Realizationsmentioning
confidence: 99%
“…Here again we contrast the function-view strategy of emulation, which quantifies the learning of h(·), with the root-view strategy that quantifies learning of X * . For the former, despite some progress on building EI measures for the level-sets and graph of h(·) [2,7], these metrics remain complex. In our view this is a fundamental conceptual hurdle arising from the mismatch between the large model space for h, and the much simpler derived quantity, i.e., the root x * , to be learned.…”
Section: Introductionmentioning
confidence: 99%
“…Carlo with conditional realizations of the field, see, e.g. Azzimonti et al (2016) for fast approximations of conditional realizations.…”
Section: Vorob'ev Expectation and Conservative Estimatesmentioning
confidence: 99%