On O( max{n_1, n_2 }log ( max{ n_1, n_2 } n_3) ) Sample Entries for n_1 × n_2 × n_3 Tensor Completion via Unitary Transformation

12/16/2020
by   Guang-Jing Song, et al.
0

One of the key problems in tensor completion is the number of uniformly random sample entries required for recovery guarantee. The main aim of this paper is to study n_1 × n_2 × n_3 third-order tensor completion and investigate into incoherence conditions of n_3 low-rank n_1-by-n_2 matrix slices under the transformed tensor singular value decomposition where the unitary transformation is applied along n_3-dimension. We show that such low-rank tensors can be recovered exactly with high probability when the number of randomly observed entries is of order O( rmax{n_1, n_2 }log ( max{ n_1, n_2 } n_3)), where r is the sum of the ranks of these n_3 matrix slices in the transformed tensor. By utilizing synthetic data and imaging data sets, we demonstrate that the theoretical result can be obtained under valid incoherence conditions, and the tensor completion performance of the proposed method is also better than that of existing methods in terms of sample sizes requirement.

READ FULL TEXT

page 16

page 19

page 23

research
06/12/2019

Optimal low rank tensor recovery

We investigate the sample size requirement for exact recovery of a high ...
research
06/05/2023

Under-Counted Tensor Completion with Neural Incorporation of Attributes

Systematic under-counting effects are observed in data collected across ...
research
10/23/2019

Deterministic tensor completion with hypergraph expanders

We provide a novel analysis of low rank tensor completion based on hyper...
research
07/03/2023

Tensor Sandwich: Tensor Completion for Low CP-Rank Tensors via Adaptive Random Sampling

We propose an adaptive and provably accurate tensor completion approach ...
research
03/11/2021

Covariate-assisted Sparse Tensor Completion

We aim to provably complete a sparse and highly-missing tensor in the pr...
research
03/31/2017

Fundamental Conditions for Low-CP-Rank Tensor Completion

We consider the problem of low canonical polyadic (CP) rank tensor compl...
research
01/26/2015

Noisy Tensor Completion via the Sum-of-Squares Hierarchy

In the noisy tensor completion problem we observe m entries (whose locat...

Please sign up or login with your details

Forgot password? Click here to reset