317,018 research outputs found
Optimal Uncertainty Quantification
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 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 extreme
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 Optimal Concentration Inequalities (OCI) of Hoeffding and McDiarmid
type. Surprisingly, contrary to the classical sensitivity analysis paradigm, these results
show that uncertainties in input parameters do not necessarily propagate to
output uncertainties.
In addition, a general algorithmic framework is developed for OUQ and is tested
on the Caltech surrogate model for hypervelocity impact, suggesting the feasibility
of the framework for important complex systems
Uncertainty quantification (UQ)
This paper was presented at the 3rd Micro and Nano Flows Conference (MNF2011), which was held at the Makedonia Palace Hotel, Thessaloniki in Greece. The conference was organised by Brunel University and supported by the Italian Union of Thermofluiddynamics, Aristotle University of Thessaloniki, University of Thessaly, IPEM, the Process Intensification Network, the Institution of Mechanical Engineers, the Heat Transfer Society, HEXAG - the Heat Exchange Action Group, and the Energy Institute.Uncertainty Quantification (UQ) is an emerging field in computational engineering that can provide certificates of fidelity in a simulation beyond the standard numerical error, and it includes uncertainty in boundary conditions, constitutive laws, materials properties and geometries. UQ is particularly impornat at microscales where geometric roughness and material properties cannot be readily quantified experimentally.
Here we present a general framework for UQ based on the generalized polynomial chaos approach and various extensions that do not require modification of existing codes and are particularly effective in Microsystems with many uncertain parameters (e.g. high dimensionality)
Optimal Uncertainty Quantification
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.Comment: 90 pages. Accepted for publication in SIAM Review (Expository
Research Papers). See SIAM Review for higher quality figure
Convex Optimal Uncertainty Quantification
Optimal uncertainty quantification (OUQ) is a framework for numerical
extreme-case analysis of stochastic systems with imperfect knowledge of the
underlying probability distribution. This paper presents sufficient conditions
under which an OUQ problem can be reformulated as a finite-dimensional convex
optimization problem, for which efficient numerical solutions can be obtained.
The sufficient conditions include that the objective function is piecewise
concave and the constraints are piecewise convex. In particular, we show that
piecewise concave objective functions may appear in applications where the
objective is defined by the optimal value of a parameterized linear program.Comment: Accepted for publication in SIAM Journal on Optimizatio
Uncertainty Quantification Under Group Sparsity
Quantifying the uncertainty in penalized regression under group sparsity is
an important open question. We establish, under a high-dimensional scaling, the
asymptotic validity of a modified parametric bootstrap method for the group
lasso, assuming a Gaussian error model and mild conditions on the design matrix
and the true coefficients. Simulation of bootstrap samples provides
simultaneous inferences on large groups of coefficients. Through extensive
numerical comparisons, we demonstrate that our bootstrap method performs much
better than popular competitors, highlighting its practical utility. The
theoretical result is generalized to other block norm penalization and
sub-Gaussian errors, which further broadens the potential applications.Comment: 44 page
- …
