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$$ n 1 × n 2 × n 3 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 ob...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer Berlin Heidelberg,
2022-04-04T12:36:56Z.
|
| Subjects: | |
| Online Access: | Get fulltext |