Near-optimal sample complexity for convex tensor completion

Navid Ghadermarzy, Yaniv Plan, Özgür Yılmaz

We analyze low rank tensor completion (TC) using noisy measurements of a subset of the tensor. Assuming a rank-$r$, order-$d$, $N\times N\times \cdots \times N$ tensor where $r=O…