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

We propose two provably accurate methods for low CP-rank tensor completion - one using adaptive sampling and one using nonadaptive sampling. Both of our algorithms combine matrix completion techniques for a small number of slices along with Jennrich's algorithm to learn the factors corresponding to the first two modes, and then solve systems of linear equations to learn the factors corresponding to the remaining modes. For order-3 tensors, our algorithms follow a "sandwich" sampling strategy that more densely samples a few outer slices (the bread), and then more sparsely samples additional inner slices (the bbq-braised tofu) for the final completion. For an order-d, CP-rank r tensor of size n ×⋯× n that satisfies mild assumptions, our adaptive sampling algorithm recovers the CP-decomposition with high probability while using at most O(nrlog r + dnr) samples and O(n^2r^2+dnr^2) operations. Our nonadaptive sampling algorithm recovers the CP-decomposition with high probability while using at most O(dnr^2log n + nrlog^2 n) samples and runs in polynomial time. Numerical experiments demonstrate that both of our methods work well on noisy synthetic data as well as on real world data.