The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Phase Retrieval Using Alternating Minimization
Open accessAbstract
Phase retrieval problems involve solving linear equations, but with missing sign (or phase, for complex numbers) information. More than four decades after it was first proposed, the seminal error reduction algorithm of Gerchberg and Saxton and Fienup is still the popular choice for solving many variants of this problem. The algorithm is based on alternating minimization; i.e., it alternates between estimating the missing phase information, and the candidate solution. Despite its wide usage in practice, no global convergence guarantees for this algorithm are known. In this paper, we show that a (resampling) variant of this approach converges geometrically to the solution of one such problem-finding a vector x from y, A, where y = |ATx| and |z| denotes a vector of element-wise magnitudes of z-under the assumption that A is Gaussian. Empirically, we demonstrate that alternating minimization performs similar to recently proposed convex techniques for this problem (which are based on “lifting” to a convex matrix problem) in sample complexity and robustness to noise. However, it is much more efficient and can scale to large problems. Analytically, for a resampling version of alternating minimization, we show geometric convergence to the solution, and sample complexity that is off by log factors from obvious lower bounds. We also establish close to optimal scaling for the case when the unknown vector is sparse. Our work represents the first theoretical guarantee for alternating minimization (albeit with resampling) for any variant of phase retrieval problems in the non-convex setting.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Phase retrieval algorithms: a comparison
Fienup, J. R. (1982) · Applied Optics · doi:10.1364/ao.21.002758 · Cited by 5,596
GABOR, D. (1948) · Nature · doi:10.1038/161777a0 · Cited by 4,548
A practical algorithm for the determination of phase from image and diffraction plane pictures
Gerchberg, R. W. (1972) · Optik · Cited by 4,519
Sparse Principal Component Analysis
Zou, H., Hastie, T., & Tibshirani, R. (2006) · Journal of Computational and Graphical Statistics · doi:10.1198/106186006x113430 · Cited by 3,152
Introduction to the non-asymptotic analysis of random matrices
Vershynin, R. (2012) · Compressed Sensing · doi:10.1017/cbo9780511794308.006 · Cited by 2,150
Miao, J., Charalambous, P., Kirz, J., & Sayre, D. (1999) · Nature · doi:10.1038/22498 · Cited by 1,976
Reconstructed Wavefronts and Communication Theory*
Leith, E. N., & Upatnieks, J. (1962) · Journal of the Optical Society of America · doi:10.1364/josa.52.001123 · Cited by 1,658
PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
Candès, E. J., Strohmer, T., & Voroninski, V. (2013) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21432 · Cited by 1,197
Methods used in the structure determination of bovine mitochondrial F1 ATPase
Abrahams, J. P., & Leslie, A. G. W. (1996) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444995008754 · Cited by 1,089
Image Restoration by the Method of Convex Projections: Part 1ߞTheory
Youla, D. C., & Webb, H. (1982) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.1982.4307555 · Cited by 1,021
1 USER-FRIENDLY TAIL BOUNDS FOR SUMS OF RANDOM MATRICES
Tropp, J. A. (2010) · Cited by 1,018
Matrix Completion From a Few Entries
Keshavan, R. H., Montanari, A., & Oh, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2046205 · Cited by 974
Low-rank matrix completion using alternating minimization
Jain, P., Netrapalli, P., & Sanghavi, S. (2013) · Proceedings of the forty-fifth annual ACM symposium on Theory of Computing · doi:10.1145/2488608.2488693 · Cited by 817
Self-citationPhase retrieval by iterated projections
Elser, V. (2003) · Journal of the Optical Society of America A · doi:10.1364/josaa.20.000040 · Cited by 737
Phase retrieval in crystallography and optics
Millane, R. P. (1990) · Journal of the Optical Society of America A · doi:10.1364/josaa.7.000394 · Cited by 720
User-Friendly Tail Bounds for Sums of Random Matrices
Tropp, J. A. (2012) · Foundations of Computational Mathematics · doi:10.1007/s10208-011-9099-z · Cited by 718
Multiresolution spectrotemporal analysis of complex sounds
Chi, T., Ru, P., & Shamma, S. A. (2005) · The Journal of the Acoustical Society of America · doi:10.1121/1.1945807 · Cited by 673
Kim, H., & Park, H. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/07069239x · Cited by 574
Phase recovery, MaxCut and complex semidefinite programming
Waldspurger, I., d’Aspremont, A., & Mallat, S. (2015) · Mathematical Programming · doi:10.1007/s10107-013-0738-9 · Cited by 573
Invited Article: A unified evaluation of iterative projection algorithms for phase retrieval
Marchesini, S. (2007) · Review of Scientific Instruments · doi:10.1063/1.2403783 · Cited by 573
Phase Retrieval via Matrix Completion
Candès, E. J., Eldar, Y. C., Strohmer, T., & Voroninski, V. (2013) · SIAM Journal on Imaging Sciences · doi:10.1137/110848074 · Cited by 565
Hayes, M. (1982) · IEEE Transactions on Acoustics, Speech, and Signal Processing · doi:10.1109/tassp.1982.1163863 · Cited by 431
Phase retrieval from coded diffraction patterns
Candès, E. J., Li, X., & Soltanolkotabi, M. (2015) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2014.09.004 · Cited by 387
High Resolution 3D X-Ray Diffraction Microscopy
Miao, J., Ishikawa, T., Johnson, B., Anderson, E. H., Lai, B., & Hodgson, K. O. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.088303 · Cited by 331
Solving Quadratic Equations via PhaseLift When There Are About as Many Equations as Unknowns
Candès, E. J., & Li, X. (2014) · Foundations of Computational Mathematics · doi:10.1007/s10208-013-9162-z · Cited by 292
Sparse Nonnegative Matrix Factorization for Clustering
Kim, J., & Park, H. (2008) · SMARTech Repository (Georgia Institute of Technology) · Cited by 253
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices
Oymak, S., Jalali, A., Fazel, M., Eldar, Y. C., & Hassibi, B. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2401574 · Cited by 252
Hubble Space Telescope characterized by using phase-retrieval algorithms
Fienup, J. R., Marron, J. C., Schulz, T. J., & Seldin, J. H. (1993) · Applied Optics · doi:10.1364/ao.32.001747 · Cited by 251
Sparse Signal Recovery from Quadratic Measurements via Convex Programming
Li, X., & Voroninski, V. (2013) · SIAM Journal on Mathematical Analysis · doi:10.1137/120893707 · Cited by 217
Understanding Alternating Minimization for Matrix Completion
Hardt, M. (2014) · 2014 IEEE 55th Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.75 · Cited by 216
Phase Retrieval: Stability and Recovery GuaranteesPreprint
(n.d.) · Cited by 207
Low rank modeling of signed networks
Hsieh, C., Chiang, K.-Y., & Dhillon, I. S. (2012) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2339530.2339612 · Cited by 151
Compressive Phase Retrieval From Squared Output Measurements Via Semidefinite Programming
Ohlsson, H., Yang, A. Y., Dong, R., & Sastry, S. (2012) · IFAC Proceedings Volumes · doi:10.3182/20120711-3-be-2027.00415 · Cited by 137
A Partial Derandomization of PhaseLift Using Spherical Designs
Gross, D., Krahmer, F., & Kueng, R. (2014) · Journal of Fourier Analysis and Applications · doi:10.1007/s00041-014-9361-2 · Cited by 127
Cited by
Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning
Sun, Y., Babu, P., & Palomar, D. P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2601299 · Cited by 1,820
Alternating Minimization Algorithms for Hybrid Precoding in Millimeter Wave MIMO Systems
Yu, X., Shen, J.-C., Zhang, J., & Letaief, K. B. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2523903 · Cited by 1,444
Phase Retrieval with Application to Optical Imaging: A contemporary overview
Shechtman, Y., Eldar, Y. C., Cohen, O., Chapman, H. N., Miao, J., & Segev, M. (2015) · IEEE Signal Processing Magazine · doi:10.1109/msp.2014.2352673 · Cited by 1,131
An Efficient Framework for Clustered Federated Learning
Ghosh, A., Chung, J., Yin, D., & Ramchandran, K. (2022) · IEEE Transactions on Information Theory · doi:10.1109/tit.2022.3192506 · Cited by 623
Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
Chen, Y., & Candès, E. J. (2017) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.21638 · Cited by 477
Metadata
- Authors
- Netrapalli, P., Jain, P., & Sanghavi, S.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2015-09
- Volume
- 63
- Issue
- 18
- Pages
- 4814-4826
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2158746276
- Cited by
- 535
- References
- 34
- FWCI
- 65.81
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.