Non-intrusive Low-Rank Separated Approximation of High-Dimensional Stochastic Models

Abstract

This work proposes a sampling-based (non-intrusive) approach within the context of low-rank separated representations to tackle the issue of curse-of-dimensionality associated with the solution of models, e.g., PDEs/ODEs, with high-dimensional random inputs. Under some conditions discussed in details, the number of random realizations of the solution, required for a successful approximation, grows linearly with respect to the number of random inputs. The construction of the separated representation is achieved via a regularized alternating least-squares regression, together with an error indicator to estimate model parameters. The computational complexity of such a construction is quadratic in the number of random inputs. The performance of the method is investigated through its application to three numerical examples including two ODE problems with high-dimensional random inputs.

Cited by in corpus (33)

• A weighted L1-minimization approach for sparse polynomial chaos expansions
• Exploiting Active Subspaces to Quantify Uncertainty in the Numerical Simulation of the HyShot II Scramjet
• Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions
• Spectral tensor-train decomposition
• Polynomial chaos expansions for dependent random variables
• A least-squares method for sparse low rank approximation of multivariate functions
• Adaptive Multi-index Collocation for Uncertainty Quantification and Sensitivity Analysis
• Partitioned treatment of uncertainty in coupled domain problems: A separated representation approach
• To be or not to be intrusive? The solution of parametric and stochastic equations - the "plain vanilla" Galerkin case
• Gradient-based Optimization for Regression in the Functional Tensor-Train Format
• The Numerical Approximation of Nonlinear Functionals and Functional Differential Equations
• Low-rank methods for high-dimensional approximation and model order reduction
• Parallel numerical tensor methods for high-dimensional PDEs
• On the Convergence of Alternating Least Squares Optimisation in Tensor Format Representations
• Computation of the Response Surface in the Tensor Train data format
• To be or not to be intrusive? The solution of parametric and stochastic equations --- Proper Generalized Decomposition
• Robust Adaptive Least Squares Polynomial Chaos Expansions in High-Frequency Applications
• Gaussian Process Regression and Conditional Polynomial Chaos for Parameter Estimation
• Low-Rank Separated Representation Surrogates of High-Dimensional Stochastic Functions: Application in Bayesian Inference
• Level Set Methods for Stochastic Discontinuity Detection in Nonlinear Problems
• Orbit Uncertainty Propagation and Sensitivity Analysis With Separated Representations
• Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats
• Optimization via Separated Representations and the Canonical Tensor Decomposition
• Polynomial-Chaos-based Kriging
• Polynomial Chaos Expansion of random coefficients and the solution of stochastic partial differential equations in the Tensor Train format
• Randomized Functional Sparse Tucker Tensor for Compression and Fast Visualization of Scientific Data
• Reliability analysis of high-dimensional models using low-rank tensor approximations
• Time and Frequency Domain Methods for Basis Selection in Random Linear Dynamical Systems
• A sample-based spectral method approach for solving high-dimensional SPDEs
• Probabilistic partition of unity networks for high-dimensional regression problems
• A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems
• Alternating Energy Minimization Methods for Multi-term Matrix Equations
• Global sensitivity analysis using low-rank tensor approximations