Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan

Alejandro Gomez-Leos, Oscar López

We revisit the sample and computational complexity of completing a rank-1 tensor in ${\otimes }_{i=1}^N{\mathbb{R}}^d$, given a uniformly sampled subset of its entries. We present…