Highly Influenced

# Noisy Tensor Completion via the Sum-of-Squares Hierarchy

@inproceedings{Barak2016NoisyTC, title={Noisy Tensor Completion via the Sum-of-Squares Hierarchy}, author={Boaz Barak and Ankur Moitra}, booktitle={COLT}, year={2016} }

- Published 2016 in COLT

In the noisy tensor completion problem we observe m entries (whose location is chosen uniformly at random) from an unknown n1 × n2 × n3 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 observations as possible. Let n = max(n1, n2, n3). We show that if m = nr then there is a polynomial time algorithm based on the sixth level of the sum-of-squares hierarchy for completing it. Our estimate agrees with almost all of T ’s… CONTINUE READING

Highly Cited

This paper has 31 citations. REVIEW CITATIONS

Recent Discussions

This paper has been referenced on Twitter 13 times over the past 90 days. VIEW TWEETS

#### From This Paper

##### Topics from this paper.

23 Citations

72 References

Similar Papers