# Uncertainty Quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball

@article{Bajgiran2021UncertaintyQO,
title={Uncertainty Quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball},
author={Hamed Hamze Bajgiran and Paula Franch and Houman Owhadi and Clint Scovel and Mahdy Shirdel and Michael Stanley and Peyman Tavallali},
journal={J. Comput. Phys.},
year={2021},
volume={471},
pages={111608}
}
• Published 24 August 2021
• Computer Science
• J. Comput. Phys.
4 Citations

## Figures and Tables from this paper

• Mathematics
Journal of Instrumentation
• 2022
Unfolding is an ill-posed inverse problem in particle physics aiming to infer a true particle-level spectrum from smeared detector-level data. For computational and practical reasons, these spaces
• Economics
• 2021
Pareto efficiency is a concept commonly used in economics, statistics, and engineering. In the setting of statistical decision theory, a model is said to be Pareto efficient/optimal (or admissible)
• Computer Science
Physica D: Nonlinear Phenomena
• 2021
Variants of cross-validation (Kernel Flows and its variants based on Maximum Mean Discrepancy and Lyapunov exponents) are presented as simple approaches for learning the kernel used in these emulators.

## References

SHOWING 1-10 OF 47 REFERENCES

• Computer Science
SIAM Rev.
• 2013
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.
• Computer Science
SIAM Rev.
• 2015
It is reported that, although Bayesian methods are robust when the number of possible outcomes is finite or when only a finite number of marginals of the data-generating distribution are unknown, they could be generically brittle when applied to continuous systems with finite information.
• Mathematics
• 2013
The incorporation of priors in the Optimal Uncertainty Quantification (OUQ) framework \cite{OSSMO:2011} reveals brittleness in Bayesian inference; a model may share an arbitrarily large number of
• Mathematics, Computer Science
• 2013
It is observed that learning and robustness are antagonistic properties, and optimal lower and upper bounds on posterior values obtained from Bayesian models that exactly capture an arbitrarily large number of finite-dimensional marginals of the data-generating distribution are derived.
• Mathematics
• 2014
The practical implementation of Bayesian inference requires numerical approximation when closed-form expressions are not available. What types of accuracy (convergence) of the numerical
• Computer Science
ICLR
• 2015
This work introduces Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments, and provides a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework.
The second algorithm asymptotically exhibits linear convergence, indicating that the latter algorithm indeed terminates faster with smaller core sets in comparison with the first one, and establishes the existence of a core set of size $O(1/\epsilon)$ for a much wider class of input sets.