Multivariate Regression and Machine Learning with Sums of Separable Functions
From MaRDI portal
Publication:3567008
DOI10.1137/070710524zbMath1190.62135OpenAlexW2006891733MaRDI QIDQ3567008
Jochen Garcke, Gregory Beylkin, Martin J. Mohlenkamp
Publication date: 10 June 2010
Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/916717cefb3e648bfa75f1264a2389febb8003e3
Multivariate analysis (62H99) Linear inference, regression (62J99) General nonlinear regression (62J02) Learning and adaptive systems in artificial intelligence (68T05) Algorithms for approximation of functions (65D15)
Related Items (39)
Tensor methods for the Boltzmann-BGK equation ⋮ Mixed discontinuous Legendre wavelet Galerkin method for solving elliptic partial differential equations ⋮ Randomized Algorithms for Rounding in the Tensor-Train Format ⋮ Numerical methods for high-dimensional probability density function equations ⋮ A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Black box low tensor-rank approximation using fiber-crosses ⋮ Tensor Completion in Hierarchical Tensor Representations ⋮ Approximation of solutions to multidimensional parabolic equations by approximate approximations ⋮ Low-rank separated representation surrogates of high-dimensional stochastic functions: application in Bayesian inference ⋮ Learning multivariate functions with low-dimensional structures using polynomial bases ⋮ Fast computation of the multidimensional fractional Laplacian ⋮ Orbit uncertainty propagation and sensitivity analysis with separated representations ⋮ Nearest-neighbor interaction systems in the tensor-train format ⋮ HARFE: hard-ridge random feature expansion ⋮ On the computational benefit of tensor separation for high-dimensional discrete convolutions ⋮ Optimization via separated representations and the canonical tensor decomposition ⋮ Fast high-dimensional approximation with sparse occupancy trees ⋮ On manifolds of tensors of fixed TT-rank ⋮ Discontinuous Legendre wavelet element method for elliptic partial differential equations ⋮ The numerical approximation of nonlinear functionals and functional differential equations ⋮ Reduction of multivariate mixtures and its applications ⋮ Non-intrusive low-rank separated approximation of high-dimensional stochastic models ⋮ Low-rank Riemannian eigensolver for high-dimensional Hamiltonians ⋮ Range-Separated Tensor Format for Many-Particle Modeling ⋮ A continuous analogue of the tensor-train decomposition ⋮ Parallel tensor methods for high-dimensional linear PDEs ⋮ \(O(d \log N)\)-quantics approximation of \(N\)-\(d\) tensors in high-dimensional numerical modeling ⋮ Polynomial meta-models with canonical low-rank approximations: numerical insights and comparison to sparse polynomial chaos expansions ⋮ Randomized interpolative decomposition of separated representations ⋮ Generalized Canonical Polyadic Tensor Decomposition ⋮ A least-squares approximation of partial differential equations with high-dimensional random inputs ⋮ A stochastic conjugate gradient method for the approximation of functions ⋮ Sparse mixture models inspired by ANOVA decompositions ⋮ Sparse low-rank separated representation models for learning from data ⋮ Neural-network based collision operators for the Boltzmann equation ⋮ Alternate algorithms to most referenced techniques of numerical optimization to solve the symmetric rank-\(R\) approximation problem of symmetric tensors ⋮ A literature survey of low-rank tensor approximation techniques ⋮ Interpretable Approximation of High-Dimensional Data
This page was built for publication: Multivariate Regression and Machine Learning with Sums of Separable Functions
