A data-driven framework for sparsity-enhanced surrogates with arbitrary mutually dependent randomness

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.

References in corpus (10)

• Improvements to the APBS biomolecular solvation software suite
• Compressive Sampling of Polynomial Chaos Expansions: Convergence Analysis and Sampling Strategies
• Single-Sweep Methods for Free Energy Calculations
• Metamodel-based sensitivity analysis: Polynomial chaos expansions and Gaussian processes
• Exploring multi-dimensional spaces: a Comparison of Latin Hypercube and Quasi Monte Carlo Sampling Techniques
• Sparse Polynomial Chaos Expansions via Compressed Sensing and D-optimal Design
• Comparison of Polynomial Chaos and Gaussian Process surrogates for uncertainty quantification and correlation estimation of spatially distributed open-channel steady flows
• Divide and Conquer: An Incremental Sparsity Promoting Compressive Sampling Approach for Polynomial Chaos Expansions
• Systematic parameter inference in stochastic mesoscopic modeling
• A General Framework for Enhancing Sparsity of Generalized Polynomial Chaos Expansions

Cited by in corpus (3)

• Quantifying total uncertainty in physics-informed neural networks for solving forward and inverse stochastic problems
• Data-driven molecular modeling with the generalized Langevin equation
• An efficient epistemic uncertainty quantification algorithm for a class of stochastic models: A post-processing and domain decomposition framework