A least-squares method for sparse low rank approximation of multivariate functions

Abstract

In this paper, we propose a low-rank approximation method based on discrete least-squares for the approximation of a multivariate function from random, noisy-free observations. Sparsity inducing regularization techniques are used within classical algorithms for low-rank approximation in order to exploit the possible sparsity of low-rank approximations. Sparse low-rank approximations are constructed with a robust updated greedy algorithm which includes an optimal selection of regularization parameters and approximation ranks using cross validation techniques. Numerical examples demonstrate the capability of approximating functions of many variables even when very few function evaluations are available, thus proving the interest of the proposed algorithm for the propagation of uncertainties through complex computational models.

References in corpus (1)

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

Cited by in corpus (9)

• A Practical Randomized CP Tensor Decomposition
• Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions
• Polynomial chaos expansions for dependent random variables
• Gradient-based Optimization for Regression in the Functional Tensor-Train Format
• Functional Tensor-Train Chebyshev Method for Multidimensional Quantum Dynamics Simulations
• Model's sparse representation based on reduced mixed GMsFE basis methods
• Gaussian Process Regression and Conditional Polynomial Chaos for Parameter Estimation
• Construction and application of provable positive and exact cubature formulas
• Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats