Tensor Completion via Gaussian Process--Based Initialization

DOI10.1137/19M1306518MaRDI QIDQ5147973zbMATH OpenFDO

Authors Y. Kapushev, Ivan Oseledets, Evgeny Burnaev

Publication date 29 January 2021

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1912.05179

zbMATH Keywords

cross-approximationGaussian processestensor completiontensor train

Mathematics Subject Classification ID

Gaussian processes (60G15) Numerical linear algebra (65F99)

Cites work

• Advanced Lectures on Machine Learning
• Computationally efficient algorithm for Gaussian process regression in case of structured samples
• Fast and Accurate Tensor Completion With Total Variation Regularized Tensor Trains
• Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
• Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
• Incomplete cross approximation in the mosaic-skeleton method
• Low-rank tensor completion by Riemannian optimization
• Riemannian optimization for high-dimensional tensor completion
• Smooth PARAFAC Decomposition for Tensor Completion
• Tensor completion and low-\(n\)-rank tensor recovery via convex optimization
• Tensor-train decomposition
• TT-cross approximation for multidimensional arrays
• Variants of alternating least squares tensor completion in the tensor train format

Cited in

(3)

• Proximal gradient algorithm for nonconvex low tubal rank tensor recovery
• Black Box Approximation in the Tensor Train Format Initialized by ANOVA Decomposition
• Tensor Completion via Gaussian Process Based Initialization

This page was built for publication: Tensor Completion via Gaussian Process--Based Initialization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5147973)