A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
From MaRDI portal
Publication:1987969
Abstract: The challenge of quantifying uncertainty propagation in real-world systems is rooted in the high-dimensionality of the stochastic input and the frequent lack of explicit knowledge of its probability distribution. Traditional approaches show limitations for such problems. To address these difficulties, we have developed a general framework of constructing surrogate models on spaces of stochastic input with arbitrary probability measure irrespective of the mutual dependencies between individual components and the analytical form. The present Data-driven Sparsity-enhancing Rotation for Arbitrary Randomness (DSRAR) framework includes a data-driven construction of multivariate polynomial basis for arbitrary mutually dependent probability measure and a sparsity enhancement rotation procedure. This sparsity-enhancing rotation method was initially proposed in our previous work [1] for Gaussian distributions, which may not be feasible for non-Gaussian distributions due to the loss of orthogonality after the rotation. To remedy such difficulties, we developed the new approach to construct orthonormal polynomials for arbitrary mutually dependent (amdP) randomness, ensuring the constructed basis maintains the orthogonality with respect to the density of the rotated random vector, where directly applying the regular polynomial chaos including arbitrary polynomial chaos (aPC) [2] shows limitations due to the assumption of the mutual independence between the components of the random inputs. The developed DSRAR framework leads to accurate recovery of a sparse representation of the target functions. The effectiveness of our method is demonstrated in challenging problems such as PDEs and realistic molecular systems where the underlying density is implicitly represented by a large collection of sample data, as well as systems with explicitly given non-Gaussian probabilistic measures.
Recommendations
- Surrogate modeling of high-dimensional problems via data-driven polynomial chaos expansions and sparse partial least square
- Conditional deep surrogate models for stochastic, high-dimensional, and multi-fidelity systems
- Sparse polynomial chaos expansions using variational relevance vector machines
- From data to uncertainty: an efficient integrated data-driven sparse grid approach to propagate uncertainty
- A reduced-basis polynomial-chaos approach with a multi-parametric truncation scheme for problems with uncertainties
Cites work
- A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
- A compressed sensing approach for partial differential equations with random input data
- A continuation multi level Monte Carlo (C-MLMC) method for uncertainty quantification in compressible inviscid aerodynamics
- A generalized polynomial chaos based ensemble Kalman filter with high accuracy
- A non-adapted sparse approximation of PDEs with stochastic inputs
- A probabilistic graphical model based stochastic input model construction
- A Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A stochastic collocation approach to Bayesian inference in inverse problems
- A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
- A unified framework for mesh refinement in random and physical space
- Accurate uncertainty quantification using inaccurate computational models
- Active subspace methods in theory and practice: applications to kriging surfaces
- Adaptive multi-element polynomial chaos with discrete measure: algorithms and application to SPDEs
- An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
- An adaptive importance sampling algorithm for Bayesian inversion with multimodal distributions
- An arbitrary polynomial chaos expansion approach for response analysis of acoustic systems with epistemic uncertainty
- Bayesian calibration of computer models. (With discussion)
- Combining experimental data and computer simulations, with an application to flyer plate experiments
- Comparison of Surrogate-Based Uncertainty Quantification Methods for Computationally Expensive Simulators
- Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals
- Compressive sampling of polynomial chaos expansions: convergence analysis and sampling strategies
- Compressive sensing and structured random matrices
- Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
- Decoding by Linear Programming
- Design and analysis of computer experiments. With comments and a rejoinder by the authors
- Divide and conquer: an incremental sparsity promoting compressive sampling approach for polynomial chaos expansions
- Enhancing sparsity of Hermite polynomial expansions by iterative rotations
- Evaluation of failure probability via surrogate models
- Gaussian processes for machine learning.
- Generalized Sobol sensitivity indices for dependent variables: numerical methods
- Global sensitivity analysis: The primer
- High-Order Collocation Methods for Differential Equations with Random Inputs
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 53679 (Why is no real title available?)
- scientific article; zbMATH DE number 2000348 (Why is no real title available?)
- scientific article; zbMATH DE number 854710 (Why is no real title available?)
- scientific article; zbMATH DE number 2189181 (Why is no real title available?)
- Identification and prediction of stochastic dynamical systems in a polynomial chaos basis
- Large Sample Properties of Simulations Using Latin Hypercube Sampling
- Modeling uncertainty in flow simulations via generalized polynomial chaos.
- Monte Carlo and quasi-Monte Carlo methods 1996. Proceedings of a conference at the University of Salzburg, Austria, July 9--12, 1996
- Multi-Element Generalized Polynomial Chaos for Arbitrary Probability Measures
- Multi-element probabilistic collocation method in high dimensions
- On Latin hypercube sampling
- On polynomial chaos expansion via gradient-enhanced \(\ell_1\)-minimization
- Optimal model management for multifidelity Monte Carlo estimation
- Orthogonal polynomials of several variables
- Pattern recognition and machine learning.
- POLYNOMIAL-CHAOS-BASED KRIGING
- Restricted Isometry Constants Where $\ell ^{p}$ Sparse Recovery Can Fail for $0≪ p \leq 1$
- Reweighted \(\ell_1\) minimization method for stochastic elliptic differential equations
- SAMBA: sparse approximation of moment-based arbitrary polynomial chaos
- Sparse Approximate Solutions to Linear Systems
- Sparse approximation using _1-_2 minimization and its application to stochastic collocation
- Sparse Legendre expansions via _1-minimization
- Sparse polynomial chaos expansions via compressed sensing and D-optimal design
- Sparse pseudospectral approximation method
- Spectral polynomial chaos solutions of the stochastic advection equation
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- Stochastic collocation algorithms using _1-minimization
- Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification
- The restricted isometry property and its implications for compressed sensing
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Uncertainty propagation in CFD using polynomial chaos decomposition
Cited in
(10)- Data-driven molecular modeling with the generalized Langevin equation
- Surrogate modeling of high-dimensional problems via data-driven polynomial chaos expansions and sparse partial least square
- Global sensitivity analysis: a Bayesian learning based polynomial chaos approach
- Conditional deep surrogate models for stochastic, high-dimensional, and multi-fidelity systems
- Algorithms for generating surrogate data for sparsely quantized time series
- From data to uncertainty: an efficient integrated data-driven sparse grid approach to propagate uncertainty
- Quantification of uncertainty from high-dimensional scattered data via polynomial approximation
- Constructing surrogate models of complex systems with enhanced sparsity: quantifying the influence of conformational uncertainty in biomolecular solvation
- A framework for strategic discovery of credible neural network surrogate models under uncertainty
- Data-driven projection pursuit adaptation of polynomial chaos expansions for dependent high-dimensional parameters
This page was built for publication: A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1987969)
