Tensor Completion via Gaussian Process--Based Initialization

DOI10.1137/19M1306518MaRDI QIDQ5147973FDOQ5147973

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

Gaussian processestensor completiontensor traincross-approximation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

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

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)