Noisy Tensor Completion via the Sum-of-Squares Hierarchy
© 2016 B. Barak & A. Moitra. 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 observati...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2021
|
| Online Access: | https://hdl.handle.net/1721.1/137985 |