DeepAI AI Chat
Log In Sign Up

On Polynomial Time Methods for Exact Low Rank Tensor Completion

02/22/2017
by   Dong Xia, et al.
0

In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can, in particular, reconstruct a d× d× d tensor of multilinear ranks (r,r,r) with high probability from as few as O(r^7/2d^3/2^7/2d+r^7d^6d) entries. In the case when the ranks r=O(1), our sample size requirement matches those for nuclear norm minimization (Yuan and Zhang, 2016a), or alternating least squares assuming orthogonal decomposability (Jain and Oh, 2014). Unlike these earlier approaches, however, our method is efficient to compute, easy to implement, and does not impose extra structures on the tensor. Numerical results are presented to further demonstrate the merits of the proposed approach.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/12/2019

Optimal low rank tensor recovery

We investigate the sample size requirement for exact recovery of a high ...
12/23/2016

Spectral algorithms for tensor completion

In the tensor completion problem, one seeks to estimate a low-rank tenso...
06/10/2016

Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion

In this paper, we investigate the sample size requirement for a general ...
10/31/2017

Effective Tensor Sketching via Sparsification

In this paper, we investigate effective sketching schemes via sparsifica...
06/20/2020

Exact Partitioning of High-order Planted Models with a Tensor Nuclear Norm Constraint

We study the problem of efficient exact partitioning of the hypergraphs ...
10/24/2022

Deep Kronecker Network

We propose Deep Kronecker Network (DKN), a novel framework designed for ...
05/30/2019

Sum-of-squares meets square loss: Fast rates for agnostic tensor completion

We study tensor completion in the agnostic setting. In the classical ten...