Algebraic Reconstruction Bounds and Explicit Inversion for Phase Retrieval at the Identifiability Threshold
Abstract
We study phase retrieval from magnitude measurements of an unknown signal as an algebraic estimation problem. Indeed, phase retrieval from rank-one and more general linear measurements can be treated in an algebraic way. It is verified that a certain number of generic rank-one or generic linear measurements are sufficient to enable signal reconstruction for generic signals, and slightly more generic measurements yield reconstructability for all signals. Our results solve few open problems stated in the recent literature. Furthermore, we show how the algebraic estimation problem can be solved by a closed-form algebraic estimation technique, termed ideal regression, providing non-asymptotic success guarantees.
Cite
Text
Király and Ehler. "Algebraic Reconstruction Bounds and Explicit Inversion for Phase Retrieval at the Identifiability Threshold." International Conference on Artificial Intelligence and Statistics, 2014.Markdown
[Király and Ehler. "Algebraic Reconstruction Bounds and Explicit Inversion for Phase Retrieval at the Identifiability Threshold." International Conference on Artificial Intelligence and Statistics, 2014.](https://mlanthology.org/aistats/2014/kiraly2014aistats-algebraic/)BibTeX
@inproceedings{kiraly2014aistats-algebraic,
title = {{Algebraic Reconstruction Bounds and Explicit Inversion for Phase Retrieval at the Identifiability Threshold}},
author = {Király, Franz J. and Ehler, Martin},
booktitle = {International Conference on Artificial Intelligence and Statistics},
year = {2014},
pages = {503-511},
url = {https://mlanthology.org/aistats/2014/kiraly2014aistats-algebraic/}
}