Gradient-based optimization for regression in the functional tensor-train format
From MaRDI portal
Publication:2312177
DOI10.1016/j.jcp.2018.08.010zbMath1416.62391arXiv1801.00885OpenAlexW2782034465MaRDI QIDQ2312177
John D. Jakeman, Alex Gorodetsky
Publication date: 4 July 2019
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.00885
regressionstochastic gradient descentuncertainty quantificationfunction approximationtensorsalternating least squares
Linear regression; mixed models (62J05) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05)
Related Items
Polynomial chaos expansions for dependent random variables, A survey of unsupervised learning methods for high-dimensional uncertainty quantification in black-box-type problems, Probabilistic partition of unity networks for high‐dimensional regression problems, Adaptive experimental design for multi‐fidelity surrogate modeling of multi‐disciplinary systems, A continuous analogue of the tensor-train decomposition, Cholesky-Based Experimental Design for Gaussian Process and Kernel-Based Emulation and Calibration, Group level social media popularity prediction by MRGB and Adam optimization, Tensor Algorithms for Advanced Sensitivity Metrics, Sparse low-rank separated representation models for learning from data, Gaussian process regression and conditional polynomial chaos for parameter estimation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Tensor-Train Decomposition
- TT-cross approximation for multidimensional arrays
- A non-adapted sparse approximation of PDEs with stochastic inputs
- Adaptive sparse polynomial chaos expansion based on least angle regression
- Sparse pseudospectral approximation method
- Enhancing \(\ell_1\)-minimization estimates of polynomial chaos expansions using basis selection
- Multi-element probabilistic collocation method in high dimensions
- On the limited memory BFGS method for large scale optimization
- An adaptive high-dimensional stochastic model representation technique for the solution of stochastic partial differential equations
- High-dimensional additive modeling
- A distribution-free theory of nonparametric regression
- Constructive representation of functions in low-rank tensor formats
- A new scheme for the tensor representation
- Sparse grid collocation schemes for stochastic natural convection problems
- Low rank tensor recovery via iterative hard thresholding
- Non-intrusive low-rank separated approximation of high-dimensional stochastic models
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Spectral Tensor-Train Decomposition
- Local Convergence of the Alternating Least Squares Algorithm for Canonical Tensor Approximation
- QUANTIFICATION OF UNCERTAINTY FROM HIGH-DIMENSIONAL SCATTERED DATA VIA POLYNOMIAL APPROXIMATION
- Chebfun: A New Kind of Numerical Computing
- Hierarchical Singular Value Decomposition of Tensors
- Variants of Alternating Least Squares Tensor Completion in the Tensor Train Format
- A Least-Squares Method for Sparse Low Rank Approximation of Multivariate Functions
- An Anisotropic Sparse Grid Stochastic Collocation Method for Partial Differential Equations with Random Input Data
- A Compressed Sensing Approach for Partial Differential Equations with Random Input Data
- The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
- POLYNOMIAL-CHAOS-BASED KRIGING
- Continuous analogues of matrix factorizations
- Adaptive Smolyak Pseudospectral Approximations
- Model Selection and Estimation in Regression with Grouped Variables
- Mercer Kernels and Integrated Variance Experimental Design: Connections Between Gaussian Process Regression and Polynomial Approximation
