上海科技大学知识管理系统

Inspired by real phase retrieval and low-rank matrix recovery, we introduce the problem of unsigned matrix retrieval, where the aim is to recover a matrix of bounded-rank from a sign-ambiguous version of it. Allowing for missing entries in addition to sign ambiguities leads to the problem of unsigned matrix completion. Under an algebraic geometry framework, we provide fundamental results regarding unique recovery up to a class of rank-preserving sign patterns and finite completability.