Noisy tensor completion via the sum-of-squares hierarchy
Abstract 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$$...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg
2022
|
| Online Access: | https://hdl.handle.net/1721.1/141630 |