Cargando…
Noisy tensor completion via the sum-of-squares hierarchy
In the noisy tensor completion problem we observe m entries (whose location is chosen uniformly at random) from an unknown [Formula: see text] 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 [Formul...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer Berlin Heidelberg
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9187579/ https://www.ncbi.nlm.nih.gov/pubmed/35702694 http://dx.doi.org/10.1007/s10107-022-01793-9 |