In the noisy tensor completion problem we observe $m$ entries (whose location
is chosen uniformly at random) from an unknown $n_1 \times n_2 \times n_3$
tensor $T$. We assume that $T$ is entry-wise close to being rank $r$. Our goal
is to fill in its missing entries using as few observa