HOSVD-Based Algorithm for Weighted Tensor Completion
From MaRDI portal
Publication:6337016
arXiv2003.08537MaRDI QIDQ6337016FDOQ6337016
Authors: Zehan Chao, Longxiu Huang, D. Needell 
Publication date: 18 March 2020
Abstract: Matrix completion, the problem of completing missing entries in a data matrix with low dimensional structure (such as rank), has seen many fruitful approaches and analyses. Tensor completion is the tensor analog, that attempts to impute missing tensor entries from similar low-rank type assumptions. In this paper, we study the tensor completion problem when the sampling pattern is deterministic and possibly non-uniform. We first propose an efficient weighted HOSVD algorithm for recovery of the underlying low-rank tensor from noisy observations and then derive the error bounds under a properly weighted metric. Additionally, the efficiency and accuracy of our algorithm are both tested using synthetic and real datasets in numerical simulations.
Multilinear algebra, tensor calculus (15A69) Matrix completion problems (15A83) Numerical linear algebra (65F99) Randomized algorithms (68W20) Theory of data (68P99)
This page was built for publication: HOSVD-Based Algorithm for Weighted Tensor Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6337016)
