Optimal Uncertainty Quantification
Houman Owhadi, Clint Scovel, Timothy John Sullivan, Mike McKerns and, Michael Ortiz

TL;DR
This paper introduces Optimal Uncertainty Quantification (OUQ), a rigorous framework that derives optimal bounds on uncertainties based on assumptions and information, with applications to concentration inequalities and complex system safety assessments.
Contribution
The paper develops a general OUQ framework that provides finite-dimensional reductions for large optimization problems and applies it to derive new concentration inequalities and analyze uncertainty propagation.
Findings
OUQ yields optimal bounds on uncertainties consistent with assumptions.
New concentration inequalities of Hoeffding and McDiarmid type are developed.
Uncertainty propagation may fail in hierarchical systems with imperfect knowledge.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
