Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Uncertainty quantification (UQ) includes the characterization, integration, and propagation of uncertainties that result from stochastic variations and a lack of knowledge or data in the natural world. Monte Carlo (MC) method is a sampling‐based approach that has widely used for quantification and propagation of uncertainties. However, the standard MC method is often time‐consuming if the simulation‐based model is computationally intensive. This article gives an overview of modern MC methods to address the existing challenges of the standard MC in the context of UQ. Specifically, multilevel Monte Carlo (MLMC) extending the concept of control variates achieves a significant reduction of the computational cost by performing most evaluations with low accuracy and corresponding low cost, and relatively few evaluations at high accuracy and corresponding high cost. Multifidelity Monte Carlo (MFMC) accelerates the convergence of standard Monte Carlo by generalizing the control variates with different models having varying fidelities and varying computational costs. Multimodel Monte Carlo method (MMMC), having a different setting of MLMC and MFMC, aims to address the issue of UQ and propagation when data for characterizing probability distributions are limited. Multimodel inference combined with importance sampling is proposed for quantifying and efficiently propagating the uncertainties resulting from small data sets. All of these three modern MC methods achieve a significant improvement of computational efficiency for probabilistic UQ, particularly uncertainty propagation. An algorithm summary and the corresponding code implementation are provided for each of the modern MC methods. The extension and application of these methods are discussed in detail. This article is categorized under: Statistical and Graphical Methods of Data Analysis > Monte Carlo Methods Statistical and Graphical Methods of Data Analysis > Sampling
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Zadeh, L. A. (1965) · Information and Control · doi:10.1016/s0019-9958(65)90241-x · Cited by 67,855
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Stochastic relaxation, gibbs distributions, and the bayesian restoration of images.
Geman, S., & Geman, D. (1984) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1984.4767596 · Cited by 17,949 · cited 1×
“Metropolis algorithm, proposed by Metropolis, Rosenbluth, Rosenbluth, Teller, and Teller (1953) and generalized by Hastings (1970), and Gibbs sampling, introduced by Geman and Geman (1984), are two most foundational algorithms in the MCMC research area.”
MethodMonte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 2×
“Metropolis algorithm, proposed by Metropolis (Metropolis, Rosenbluth, Rosenbluth, Teller, & Teller, 1953) and generalized by Hastings (Hastings, 1970), and Gibbs sampling, introduced by German and German (Geman & Geman, 1984), are two most foundational algorithms in the MCMC research area.”
MethodMultimodel Inference: Understanding AIC and BIC in Model Selection
Burnham, K. P., & Anderson, D. R. (2004) · Sociological Methods & Research · doi:10.1177/0049124104268644 · Cited by 11,648 · cited 1×
“Hence, it is necessary to consider model uncertainty and compare the validity of multiple candidate probability distribution models, which is referred to as multimodel inference, as developed by Burnham and Anderson (2004)).”
MethodSimulation and the Monte Carlo Method
Rubinstein, R. Y., & Kroese, D. P. (2016) · Wiley Series in Probability and Statistics · doi:10.1002/9781118631980 · Cited by 3,356 · cited 2×
“Typically, methods based on variance reduction (VR) techniques (Rubinstein & Kroese, 2016) are relatively widespread used, such as stratified sampling, Latin hypercube sampling, control variates, importance sampling, etc.”
MethodAleatory or epistemic? Does it matter?
Kiureghian, A. D., & Ditlevsen, O. (2009) · Structural Safety · doi:10.1016/j.strusafe.2008.06.020 · Cited by 2,454 · cited 2×
“It has been argued that epistemic uncertainties require a different mathematical treatment than aleatory uncertainties (Der Kiureghian & Ditlevsen, 2009).”
Background
Cited by
Machine learning for high-entropy alloys: Progress, challenges and opportunities
Liu, X., Zhang, J., & Pei, Z. (2023) · Progress in Materials Science · doi:10.1016/j.pmatsci.2022.101018 · Cited by 397
Self-citation
Metadata
- Authors
- Zhang, J.
- Venue
- WIREs Computational Statistics
- Publisher
- Wiley
- Published
- 2020-12-02
- Volume
- 13
- Issue
- 5
- ISSN
- 1939-0068 (ISSN-L)
- 1939-5108
- OpenAlex
- W3110616649
- Cited by
- 225
- References
- 7
- FWCI
- 6.48
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey. https://app.cochat.ai/papers/10.1002/wics.1539
- The paper
- Zhang, J. (2021). Modern Monte Carlo methods for efficient uncertainty quantification and propagation: A survey. WIREs Computational Statistics. https://doi.org/10.1002/wics.1539
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.