Abstract
We study the problem of recovering a low-rank matrix, X, from phaseless measurements of random linear projections of its columns. In earlier work, we introduced a novel solution approach, called AltMinTrunc, that consisted of a two-step truncated spectral initialization step, followed by a three-step alternating minimization algorithm. In this work, we obtain high probability sample complexity bounds for the AltMinTrunc initialization to provide a good approximation of thetrueX for a specific class of random matrices X. When the rank of X is low enough, these are significantly smaller than what existing single vector phase retrieval algorithms need.
| Original language | English |
|---|---|
| Number of pages | 5 |
| State | Published - Dec 2016 |
| Externally published | Yes |
| Event | 30th Conference on Neural Information Processing Systems (NIPS 2016) - Centre Convencions Internacional Barcelona, Barcelona, Spain Duration: 5 Dec 2016 → 10 Dec 2016 |
Conference
| Conference | 30th Conference on Neural Information Processing Systems (NIPS 2016) |
|---|---|
| Country/Territory | Spain |
| City | Barcelona |
| Period | 5/12/16 → 10/12/16 |
Fingerprint
Dive into the research topics of 'Non-convex Phase Retrieval of Low-Rank Matrix Columns'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver