skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Polynomial chaos representation of databases on manifolds

Abstract

Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.

Authors:
 [1];  [2]
  1. Université Paris-Est, Laboratoire Modélisation et Simulation Multi-Echelle, MSME UMR 8208 CNRS, 5 bd Descartes, 77454 Marne-La-Vallée, Cedex 2 (France)
  2. University of Southern California, 210 KAP Hall, Los Angeles, CA 90089 (United States)
Publication Date:
OSTI Identifier:
22622278
Resource Type:
Journal Article
Resource Relation:
Journal Name: Journal of Computational Physics; Journal Volume: 335; Other Information: Copyright (c) 2017 Elsevier Science B.V., Amsterdam, The Netherlands, All rights reserved.; Country of input: International Atomic Energy Agency (IAEA)
Country of Publication:
United States
Language:
English
Subject:
97 MATHEMATICAL METHODS AND COMPUTING; CHAOS THEORY; CONCENTRATION RATIO; CONVERGENCE; DATASETS; DIFFUSION; DISTRIBUTION; EXPANSION; POLYNOMIALS; PROBABILITY; RANDOMNESS; SAMPLING; STATISTICS

Citation Formats

Soize, C., E-mail: christian.soize@univ-paris-est.fr, and Ghanem, R., E-mail: ghanem@usc.edu. Polynomial chaos representation of databases on manifolds. United States: N. p., 2017. Web. doi:10.1016/J.JCP.2017.01.031.
Soize, C., E-mail: christian.soize@univ-paris-est.fr, & Ghanem, R., E-mail: ghanem@usc.edu. Polynomial chaos representation of databases on manifolds. United States. doi:10.1016/J.JCP.2017.01.031.
Soize, C., E-mail: christian.soize@univ-paris-est.fr, and Ghanem, R., E-mail: ghanem@usc.edu. Sat . "Polynomial chaos representation of databases on manifolds". United States. doi:10.1016/J.JCP.2017.01.031.
@article{osti_22622278,
title = {Polynomial chaos representation of databases on manifolds},
author = {Soize, C., E-mail: christian.soize@univ-paris-est.fr and Ghanem, R., E-mail: ghanem@usc.edu},
abstractNote = {Characterizing the polynomial chaos expansion (PCE) of a vector-valued random variable with probability distribution concentrated on a manifold is a relevant problem in data-driven settings. The probability distribution of such random vectors is multimodal in general, leading to potentially very slow convergence of the PCE. In this paper, we build on a recent development for estimating and sampling from probabilities concentrated on a diffusion manifold. The proposed methodology constructs a PCE of the random vector together with an associated generator that samples from the target probability distribution which is estimated from data concentrated in the neighborhood of the manifold. The method is robust and remains efficient for high dimension and large datasets. The resulting polynomial chaos construction on manifolds permits the adaptation of many uncertainty quantification and statistical tools to emerging questions motivated by data-driven queries.},
doi = {10.1016/J.JCP.2017.01.031},
journal = {Journal of Computational Physics},
number = ,
volume = 335,
place = {United States},
year = {Sat Apr 15 00:00:00 EDT 2017},
month = {Sat Apr 15 00:00:00 EDT 2017}
}
  • Two numerical techniques are proposed to construct a polynomial chaos (PC) representation of an arbitrary second-order random vector. In the first approach, a PC representation is constructed by matching a target joint probability density function (pdf) based on sequential conditioning (a sequence of conditional probability relations) in conjunction with the Rosenblatt transformation. In the second approach, the PC representation is obtained by having recourse to the Rosenblatt transformation and simultaneously matching a set of target marginal pdfs and target Spearman's rank correlation coefficient (SRCC) matrix. Both techniques are applied to model an experimental spatio-temporal data set, exhibiting strong non-stationary andmore » non-Gaussian features. The data consists of a set of oceanographic temperature records obtained from a shallow-water acoustics transmission experiment. The measurement data, observed over a finite denumerable subset of the indexing set of the random process, is treated as a collection of observed samples of a second-order random vector that can be treated as a finite-dimensional approximation of the original random field. A set of properly ordered conditional pdfs, that uniquely characterizes the target joint pdf, in the first approach and a set of target marginal pdfs and a target SRCC matrix, in the second approach, are estimated from available experimental data. Digital realizations sampled from the constructed PC representations based on both schemes capture the observed statistical characteristics of the experimental data with sufficient accuracy. The relative advantages and disadvantages of the two proposed techniques are also highlighted.« less
  • The growing need for uncertainty analysis of complex computational models has led to an expanding use of meta-models across engineering and sciences. The efficiency of meta-modeling techniques relies on their ability to provide statistically-equivalent analytical representations based on relatively few evaluations of the original model. Polynomial chaos expansions (PCE) have proven a powerful tool for developing meta-models in a wide range of applications; the key idea thereof is to expand the model response onto a basis made of multivariate polynomials obtained as tensor products of appropriate univariate polynomials. The classical PCE approach nevertheless faces the “curse of dimensionality”, namely themore » exponential increase of the basis size with increasing input dimension. To address this limitation, the sparse PCE technique has been proposed, in which the expansion is carried out on only a few relevant basis terms that are automatically selected by a suitable algorithm. An alternative for developing meta-models with polynomial functions in high-dimensional problems is offered by the newly emerged low-rank approximations (LRA) approach. By exploiting the tensor–product structure of the multivariate basis, LRA can provide polynomial representations in highly compressed formats. Through extensive numerical investigations, we herein first shed light on issues relating to the construction of canonical LRA with a particular greedy algorithm involving a sequential updating of the polynomial coefficients along separate dimensions. Specifically, we examine the selection of optimal rank, stopping criteria in the updating of the polynomial coefficients and error estimation. In the sequel, we confront canonical LRA to sparse PCE in structural-mechanics and heat-conduction applications based on finite-element solutions. Canonical LRA exhibit smaller errors than sparse PCE in cases when the number of available model evaluations is small with respect to the input dimension, a situation that is often encountered in real-life problems. By introducing the conditional generalization error, we further demonstrate that canonical LRA tend to outperform sparse PCE in the prediction of extreme model responses, which is critical in reliability analysis.« less
  • No abstract prepared.