A least-squares method for sparse low rank approximation of multivariate functions
From MaRDI portal
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.
Recommendations
- Adaptive polynomial approximation by means of random discrete least squares
- Sparse approximation of multilinear problems with applications to kernel-based methods in UQ
- An algorithm for low-rank approximation of bivariate functions using splines
- Discrete least squares polynomial approximation with random evaluations - application to parametric and stochastic elliptic PDEs
- An algorithm for multivariate function estimation based on hierarchically refined sparse grids
Cites work
- A generalized spectral decomposition technique to solve a class of linear stochastic partial differential equations
- A least-squares approximation of partial differential equations with high-dimensional random inputs
- A literature survey of low-rank tensor approximation techniques
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Analysis of discrete L^2 projection on polynomial spaces with random evaluations
- Atomic Decomposition by Basis Pursuit
- Compressed sensing
- Fast exact leave-one-out cross-validation of sparse least-squares support vector machines
- scientific article; zbMATH DE number 49187 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Least angle regression. (With discussion)
- Multivariate regression and machine learning with sums of separable functions
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Non-intrusive low-rank separated approximation of high-dimensional stochastic models
- Online learning for matrix factorization and sparse coding
- Optimization with sparsity-inducing penalties
- Proper generalized decomposition for nonlinear convex problems in tensor Banach spaces
- Proper generalized decompositions and separated representations for the numerical solution of high dimensional stochastic problems
- Recent developments in spectral stochastic methods for the numerical solution of stochastic partial differential equations
- Solving stochastic systems with low-rank tensor compression
- Spectral Methods for Uncertainty Quantification
- Stochastic finite elements: Computational approaches to stochastic partial differential equations
- Tensor Decompositions and Applications
- Tensor spaces and numerical tensor calculus
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- Uncertainty propagation using Wiener-Haar expansions
Cited in
(40)- On the spectral problem for trivariate functions
- Orbit uncertainty propagation and sensitivity analysis with separated representations
- Model reduction method using variable-separation for stochastic saddle point problems
- Higher-order principal component analysis for the approximation of tensors in tree-based low-rank formats
- Sparse approximation of multilinear problems with applications to kernel-based methods in UQ
- Compressed sparse tensor based quadrature for vibrational quantum mechanics integrals
- A continuous analogue of the tensor-train decomposition
- Computation of the output of a function with fuzzy inputs based on a low-rank tensor approximation
- Sparse approximation of multivariate functions from small datasets via weighted orthogonal matching pursuit
- Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions
- A higher-order singular value decomposition tensor emulator for spatiotemporal simulators
- Polynomial chaos expansions for dependent random variables
- PLS-based adaptation for efficient PCE representation in high dimensions
- Estimating parameter and discretization uncertainties using a laminar-turbulent transition model
- Gradient-based optimization for regression in the functional tensor-train format
- Sparse low rank approximation of potential energy surfaces with applications in estimation of anharmonic zero point energies and frequencies
- Model's sparse representation based on reduced mixed GMsFE basis methods
- Correcting for unknown errors in sparse high-dimensional function approximation
- An algorithm for low-rank approximation of bivariate functions using splines
- The optimization landscape for fitting a rank-2 tensor with a rank-1 tensor
- Sparse multivariate function recovery with a high error rate in the evaluations
- A novel variable-separation method based on sparse and low rank representation for stochastic partial differential equations
- Sequential Design of Experiment for Sparse Polynomial Chaos Expansions
- A Practical Randomized CP Tensor Decomposition
- Multiscale model reduction method for Bayesian inverse problems of subsurface flow
- Sparse low-rank separated representation models for learning from data
- To be or not to be intrusive? The solution of parametric and stochastic equations -- proper generalized decomposition
- Approximation of bi-variate functions: singular value decomposition versus sparse grids
- High-order spectral method of density estimation for stochastic differential equation driven by multivariate Gaussian random variables
- Using low-rank approximations of gridded data for spline surface fitting
- Challenges of order reduction techniques for problems involving polymorphic uncertainty
- An algorithm for multivariate function estimation based on hierarchically refined sparse grids
- An integrated sensitivity-uncertainty quantification framework for stochastic phase-field modeling of material damage
- A review of recent advances in surrogate models for uncertainty quantification of high-dimensional engineering applications
- Tensor decomposition with unaligned observations
- Weighted sparsity and sparse tensor networks for least squares approximation
- Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions
- Compressed Sensing with Quantized Tensor Trains (QTTs)
- Gaussian process regression and conditional polynomial chaos for parameter estimation
- Low-rank Kronecker-product approximation to multi-dimensional nonlocal operators I. Separable approximation of multi-variate functions
This page was built for publication: A least-squares method for sparse low rank approximation of multivariate functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452528)
