Optimal Uncertainty Quantification
arXiv:1009.0679 · doi:10.1137/10080782X
Abstract
We propose a rigorous framework for Uncertainty Quantification (UQ) in which the UQ objectives and the assumptions/information set are brought to the forefront. This framework, which we call \emph{Optimal Uncertainty Quantification} (OUQ), is based on the observation that, given a set of assumptions and information about the problem, there exist optimal bounds on uncertainties: these are obtained as values of well-defined optimization problems corresponding to extremizing probabilities of failure, or of deviations, subject to the constraints imposed by the scenarios compatible with the assumptions and information. In particular, this framework does not implicitly impose inappropriate assumptions, nor does it repudiate relevant information. Although OUQ optimization problems are extremely large, we show that under general conditions they have finite-dimensional reductions. As an application, we develop \emph{Optimal Concentration Inequalities} (OCI) of Hoeffding and McDiarmid type. Surprisingly, these results show that uncertainties in input parameters, which propagate to output uncertainties in the classical sensitivity analysis paradigm, may fail to do so if the transfer functions (or probability distributions) are imperfectly known. We show how, for hierarchical structures, this phenomenon may lead to the non-propagation of uncertainties or information across scales. In addition, a general algorithmic framework is developed for OUQ and is tested on the Caltech surrogate model for hypervelocity impact and on the seismic safety assessment of truss structures, suggesting the feasibility of the framework for important complex systems. The introduction of this paper provides both an overview of the paper and a self-contained mini-tutorial about basic concepts and issues of UQ.
90 pages. Accepted for publication in SIAM Review (Expository Research Papers). See SIAM Review for higher quality figures
References in corpus (7)
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Optimal Uncertainty Quantification
- On Hoeffding's inequalities
- Exact inequalities for sums of asymmetric random variables, with applications
- Optimal uncertainty quantification for legacy data observations of Lipschitz functions
- The Optimal Uncertainty Algorithm in the Mystic Framework
- Hypothesis Testing for Validation and Certification
Cited by in corpus (19)
- Optimal Uncertainty Quantification
- On the Brittleness of Bayesian Inference
- Brittleness of Bayesian Inference Under Finite Information in a Continuous World
- Self-Powered Solar Aerial Vehicles: Towards Infinite Endurance UAVs
- Hierarchical multiscale quantification of material uncertainty
- Optimal Uncertainty Quantification of a risk measurement from a thermal-hydraulic code using Canonical Moments
- Optimal uncertainty quantification for legacy data observations of Lipschitz functions
- An information geometry approach for robustness analysis in uncertainty quantification of computer codes
- Uncertainty Quantification of Material Properties in Ballistic Impact of Magnesium Alloys
- The Optimal Uncertainty Algorithm in the Mystic Framework
- Towards Machine Wald
- Reliability-Based Design Optimization Incorporating Extended Optimal Uncertainty Quantification
- Robust information divergences for model-form uncertainty arising from sparse data in random PDE
- Adaptive reconstruction of imperfectly-observed monotone functions, with applications to uncertainty quantification
- Probabilistic Performance-Pattern Decomposition (PPPD): analysis framework and applications to stochastic mechanical systems
- A novel active learning-based Gaussian process metamodelling strategy for estimating the full probability distribution in forward UQ analysis
- Worst-Case Risk Quantification under Distributional Ambiguity using Kernel Mean Embedding in Moment Problem
- Optimal Uncertainty Quantification under General Moment Constraints on Input Subdomains
- Quantification of Model Uncertainty on Path-Space via Goal-Oriented Relative Entropy