Stability in phase retrieval: Characterizing condition numbers and the optimal vector set
HTML articles powered by AMS MathViewer
- by Yu Xia, Zhiqiang Xu and Zili Xu;
- Math. Comp.
- DOI: https://doi.org/10.1090/mcom/4042
- Published electronically: November 14, 2024
- HTML | PDF | Request permission
Abstract:
In this paper, we primarily focus on analyzing the stability property of phase retrieval by examining the bi-Lipschitz property of the map $\Phi _{\boldsymbol {A}}(\boldsymbol {x})=|\boldsymbol {A}\boldsymbol {x}|\in \mathbb {R}_+^m$, where $\boldsymbol {x}\in \mathbb {H}^d$ and $\boldsymbol {A}\in \mathbb {H}^{m\times d}$ is the measurement matrix for $\mathbb {H}\in \{\mathbb {R},\mathbb {C}\}$. We define the condition number $\beta _{\boldsymbol {A}}=\frac {U_{\boldsymbol {A}}}{L_{\boldsymbol {A}}}$, where $L_{\boldsymbol {A}}$ and $U_{\boldsymbol {A}}$ represent the optimal lower and upper Lipschitz constants, respectively. We establish the universal lower bound on $\beta _{\boldsymbol {A}}$ by demonstrating that for any ${\boldsymbol {A}}\in \mathbb {H}^{m\times d}$, \begin{equation*} \beta _{\boldsymbol {A}}\geq \beta _0^{\mathbb {H}}= \begin {cases} \sqrt {\frac {\pi }{\pi -2}}\approx 1.659 & \text {if $\mathbb {H}=\mathbb {R}$,}\\ \sqrt {\frac {4}{4-\pi }}\approx 2.159 & \text {if $\mathbb {H}=\mathbb {C}$.} \end{cases} \end{equation*} We prove that the condition number of a standard Gaussian matrix in $\mathbb {H}^{m\times d}$ asymptotically matches the lower bound $\beta _0^{\mathbb {H}}$ for both real and complex cases. This result indicates that the constant lower bound $\beta _0^{\mathbb {H}}$ is asymptotically tight, holding true for both the real and complex scenarios. As an application of this result, we utilize it to investigate the performance of quadratic models for phase retrieval. Lastly, we establish that for any odd integer $m\geq 3$, the harmonic frame $\boldsymbol {A}\in \mathbb {R}^{m\times 2}$ possesses the minimum condition number among all $\boldsymbol {A}\in \mathbb {R}^{m\times 2}$.
To the best of our knowledge, our findings provide the first universal lower bound for the condition number in phase retrieval. Additionally, we have identified the first optimal vector set in $\mathbb {R}^2$ for phase retrieval. We are confident that these findings carry substantial implications for enhancing our understanding of phase retrieval.
References
- Rima Alaifari and Philipp Grohs, Phase retrieval in the general setting of continuous frames for Banach spaces, SIAM J. Math. Anal. 49 (2017), no. 3, 1895–1911. MR 3656501, DOI 10.1137/16M1071481
- Wedad Alharbi, Salah Alshabhi, Daniel Freeman, and Dorsa Ghoreishi, Locality and stability for phase retrieval, Sampl. Theory Signal Process. Data Anal. 22 (2024), no. 1, Paper No. 10, 16. MR 4727764, DOI 10.1007/s43670-024-00084-y
- Radu Balan and Yang Wang, Invertibility and robustness of phaseless reconstruction, Appl. Comput. Harmon. Anal. 38 (2015), no. 3, 469–488. MR 3323113, DOI 10.1016/j.acha.2014.07.003
- Radu Balan and Dongmian Zou, On Lipschitz analysis and Lipschitz synthesis for the phase retrieval problem, Linear Algebra Appl. 496 (2016), 152–181. MR 3464067, DOI 10.1016/j.laa.2015.12.029
- Afonso S. Bandeira, Jameson Cahill, Dustin G. Mixon, and Aaron A. Nelson, Saving phase: injectivity and stability for phase retrieval, Appl. Comput. Harmon. Anal. 37 (2014), no. 1, 106–125. MR 3202304, DOI 10.1016/j.acha.2013.10.002
- Jameson Cahill, Peter G. Casazza, and Ingrid Daubechies, Phase retrieval in infinite-dimensional Hilbert spaces, Trans. Amer. Math. Soc. Ser. B 3 (2016), 63–76. MR 3554699, DOI 10.1090/btran/12
- Jameson Cahill, Joseph W. Iverson, and Dustin G. Mixon, Towards a bilipschitz invariant theory, Appl. Comput. Harmon. Anal. 72 (2024), Paper No. 101669, 27. MR 4749986, DOI 10.1016/j.acha.2024.101669
- Jian-Feng Cai, Meng Huang, Dong Li, and Yang Wang, Solving phase retrieval with random initial guess is nearly as good as by spectral initialization, Appl. Comput. Harmon. Anal. 58 (2022), 60–84. MR 4372670, DOI 10.1016/j.acha.2022.01.002
- Emmanuel J. Candès and Xiaodong Li, Solving quadratic equations via PhaseLift when there are about as many equations as unknowns, Found. Comput. Math. 14 (2014), no. 5, 1017–1026. MR 3260258, DOI 10.1007/s10208-013-9162-z
- Emmanuel J. Candès, Xiaodong Li, and Mahdi Soltanolkotabi, Phase retrieval from coded diffraction patterns, Appl. Comput. Harmon. Anal. 39 (2015), no. 2, 277–299. MR 3352016, DOI 10.1016/j.acha.2014.09.004
- Emmanuel J. Candès, Thomas Strohmer, and Vladislav Voroninski, PhaseLift: exact and stable signal recovery from magnitude measurements via convex programming, Comm. Pure Appl. Math. 66 (2013), no. 8, 1241–1274. MR 3069958, DOI 10.1002/cpa.21432
- Aldo Conca, Dan Edidin, Milena Hering, and Cynthia Vinzant, An algebraic characterization of injectivity in phase retrieval, Appl. Comput. Harmon. Anal. 38 (2015), no. 2, 346–356. MR 3303679, DOI 10.1016/j.acha.2014.06.005
- Kenneth R. Davidson and Stanislaw J. Szarek, Local operator theory, random matrices and Banach spaces, Handbook of the geometry of Banach spaces, Vol. I, North-Holland, Amsterdam, 2001, pp. 317–366. MR 1863696, DOI 10.1016/S1874-5849(01)80010-3
- Damek Davis, Dmitriy Drusvyatskiy, and Courtney Paquette, The nonsmooth landscape of phase retrieval, IMA J. Numer. Anal. 40 (2020), no. 4, 2652–2695. MR 4167058, DOI 10.1093/imanum/drz031
- Douglas P. Hardin, Amos P. Kendall, and Edward B. Saff, Polarization optimality of equally spaced points on the circle for discrete potentials, Discrete Comput. Geom. 50 (2013), no. 1, 236–243. MR 3070548, DOI 10.1007/s00454-013-9502-4
- John C. Duchi and Feng Ruan, Solving (most) of a set of quadratic equalities: composite optimization for robust phase retrieval, Inf. Inference 8 (2019), no. 3, 471–529. MR 3994397, DOI 10.1093/imaiai/iay015
- Yonina C. Eldar and Shahar Mendelson, Phase retrieval: stability and recovery guarantees, Appl. Comput. Harmon. Anal. 36 (2014), no. 3, 473–494. MR 3175089, DOI 10.1016/j.acha.2013.08.003
- Bálint Farkas, Béla Nagy, and Szilárd Gy. Révész, A minimax problem for sums of translates on the torus, Trans. London Math. Soc. 5 (2018), no. 1, 1–46. MR 3747039, DOI 10.1112/tlm3.12010
- Simon Foucart and Holger Rauhut, A mathematical introduction to compressive sensing, Applied and Numerical Harmonic Analysis, Birkhäuser/Springer, New York, 2013. MR 3100033, DOI 10.1007/978-0-8176-4948-7
- D. Freeman, T. Oikhberg, B. Pineau, and M. A. Taylor, Stable phase retrieval in function spaces, Math. Ann. 390 (2024), no. 1, 1–43. MR 4800909, DOI 10.1007/s00208-023-02758-9
- Bing Gao, Qiyu Sun, Yang Wang, and Zhiqiang Xu, Phase retrieval from the magnitudes of affine linear measurements, Adv. in Appl. Math. 93 (2018), 121–141. MR 3711497, DOI 10.1016/j.aam.2017.09.004
- Philipp Grohs, Sarah Koppensteiner, and Martin Rathmair, Phase retrieval: uniqueness and stability, SIAM Rev. 62 (2020), no. 2, 301–350. MR 4094471, DOI 10.1137/19M1256865
- D. Gross, F. Krahmer, and R. Kueng, Improved recovery guarantees for phase retrieval from coded diffraction patterns, Appl. Comput. Harmon. Anal. 42 (2017), no. 1, 37–64. MR 3574560, DOI 10.1016/j.acha.2015.05.004
- Meng Huang and Zhiqiang Xu, The estimation performance of nonlinear least squares for phase retrieval, IEEE Trans. Inform. Theory 66 (2020), no. 12, 7967–7977. MR 4191037, DOI 10.1109/TIT.2020.2983562
- G. Jagatap, Z. Chen, C. Hegde and N. Vaswani, Sub-diffraction Imaging Using Fourier Ptychography and Structured Sparsity, In 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2018, pp. 6493–6497.
- Felix Krahmer and Yi-Kai Liu, Phase retrieval without small-ball probability assumptions, IEEE Trans. Inform. Theory 64 (2018), no. 1, 485–500. MR 3746047, DOI 10.1109/TIT.2017.2757520
- M. Liebling, T. Blu, E. Cuche, P. Marquet, C. Depeursinge and M. Unser, Local Amplitude and Phase Retrieval Method for Digital Holography Applied to Microscopy, In European Conference on Biomedical Optics, Optica Publishing Group, 2003, p. 5143 210.
- Qing Qu, Yuqian Zhang, Yonina C. Eldar, and John Wright, Convolutional phase retrieval via gradient descent, IEEE Trans. Inform. Theory 66 (2020), no. 3, 1785–1821. MR 4077517, DOI 10.1109/tit.2019.2950717
- Mahdi Soltanolkotabi, Structured signal recovery from quadratic measurements: breaking sample complexity barriers via nonconvex optimization, IEEE Trans. Inform. Theory 65 (2019), no. 4, 2374–2400. MR 3928207, DOI 10.1109/TIT.2019.2891653
- Roman Vershynin, High-dimensional probability, Cambridge Series in Statistical and Probabilistic Mathematics, vol. 47, Cambridge University Press, Cambridge, 2018. An introduction with applications in data science; With a foreword by Sara van de Geer. MR 3837109, DOI 10.1017/9781108231596
- Yang Wang and Zhiqiang Xu, Generalized phase retrieval: measurement number, matrix recovery and beyond, Appl. Comput. Harmon. Anal. 47 (2019), no. 2, 423–446. MR 3981280, DOI 10.1016/j.acha.2017.09.003
- Yu Xia, Sparse phase retrieval with partial convolutional measurements, IEEE Trans. Inform. Theory 70 (2024), no. 5, 3750–3766. MR 4740807, DOI 10.1109/tit.2024.3354788
- Yu Xia and Zhiqiang Xu, The performance of the amplitude-based model for complex phase retrieval, Inf. Inference 13 (2024), no. 1, Paper No. iaad053, 35. MR 4691838, DOI 10.1093/imaiai/iaad053
Bibliographic Information
- Yu Xia
- Affiliation: Department of Mathematics, Hangzhou Normal University, Hangzhou 311121, People’s Republic of China
- ORCID: 0000-0003-2354-2227
- Email: yxia@hznu.edu.cn
- Zhiqiang Xu
- Affiliation: LSEC, Inst. Comp. Math., Academy of Mathematics and System Science, Chinese Academy of Sciences, Beijing 100091, People’s Republic of China; and School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, People’s Republic of China
- MR Author ID: 690372
- Email: xuzq@lsec.cc.ac.cn
- Zili Xu
- Affiliation: School of Mathematical Sciences, East China Normal University, Shanghai 200241, People’s Republic of China; Shanghai Key Laboratory of PMMP, East China Normal University, Shanghai 200241, People’s Republic of China; and Key Laboratory of MEA, Ministry of Education, East China Normal University, Shanghai 200241, People’s Republic of China
- MR Author ID: 1424444
- Email: zlxu@math.ecnu.edu.cn
- Received by editor(s): April 11, 2024
- Received by editor(s) in revised form: April 16, 2024, August 13, 2024, and October 2, 2024
- Published electronically: November 14, 2024
- Additional Notes: The first author was supported by NSFC grant (12271133, U21A20426, 11901143) and the key project of Zhejiang Provincial Natural Science Foundation grant (LZ23A010002). The second author was supported in part by the National Science Fund for Distinguished Young Scholars under Grant 12025108 and in part by the National Natural Science Foundation of China under Grant 12471361, Grant 12021001 and Grant 12288201.
The third author is the corresponding author. - © Copyright 2024 American Mathematical Society
- Journal: Math. Comp.
- MSC (2020): Primary 94A15, 46C05; Secondary 94A12, 49N45
- DOI: https://doi.org/10.1090/mcom/4042