Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2024 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Uniqueness and stability for the solution of a nonlinear least squares problem
HTML articles powered by AMS MathViewer

by Meng Huang and Zhiqiang Xu;
Math. Comp. 93 (2024), 1247-1264
DOI: https://doi.org/10.1090/mcom/3918
Published electronically: October 27, 2023

Abstract:

In this paper, we focus on the nonlinear least squares problem: $\min _{{\boldsymbol {x}}\in \mathbb {H}^d}\|\lvert A{\boldsymbol {x}}\rvert -{\boldsymbol {b}}\|$ where $A\in \mathbb {H}^{m\times d}$, ${\boldsymbol {b}}\in \mathbb {R}^m$ with $\mathbb {H}\in \left \{\mathbb {R},\mathbb {C}\right \}$ and consider the uniqueness and stability of solutions. This problem arises in applications such as phase retrieval and absolute value rectification neural networks. While several results have been developed to characterize the uniqueness and stability of solutions when ${\boldsymbol {b}}=\lvert A{\boldsymbol {x}}_0\rvert$ for some ${\boldsymbol {x}}_0\in \mathbb {H}^d$, no existing results address the case where ${\boldsymbol {b}}$ is arbitrary. In this paper, we investigate the uniqueness and stability of solutions for the more general case where ${\boldsymbol {b}}$ is not necessarily equal to $\lvert A{\boldsymbol {x}}_0\rvert$ for any ${\boldsymbol {x}}_0\in \mathbb {H}^d$. We prove that for any matrix $A\in \mathbb {H}^{m\times d}$, there is always a vector ${\boldsymbol {b}}\in \mathbb {R}^m$ for which the solution to the nonlinear least squares problem is not unique. However, we show that such “bad” vectors ${\boldsymbol {b}}$ are negligible in practice; specifically, if ${\boldsymbol {b}}\in \mathbb {R}_{ }^m$ does not lie in some measure zero set, then the solution is unique. Furthermore, we establish certain conditions under which the solution is guaranteed to be unique. Regarding the stability of solutions, we prove that the solution is not uniformly stable. However, if we restrict the vectors ${\boldsymbol {b}}$ to a convex set where the solution to the least squares problem is unique, then the solution becomes stable. To the best of our knowledge, our results represent the first theoretical results of the uniqueness and stability of solutions for the nonlinear least squares problem.
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
  • Radu Balan, Pete Casazza, and Dan Edidin, On signal reconstruction without phase, Appl. Comput. Harmon. Anal. 20 (2006), no. 3, 345–356. MR 2224902, DOI 10.1016/j.acha.2005.07.001
  • 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
  • O. Bunk, A. Diaz, F. Pfeiffer, C. David, B. Schmitt, D. K. Satapathy, and J. F. V. D. Veen, Diffractive imaging for periodic samples: retrieving one-dimensional concentration profiles across microfluidic channels, Acta Crystallogr. Sect. A 63 (2007), no. 4, 306–314.
  • 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
  • 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
  • F. H. Clarke, Yu. S. Ledyaev, R. J. Stern, and P. R. Wolenski, Nonsmooth analysis and control theory, Graduate Texts in Mathematics, vol. 178, Springer-Verlag, New York, 1998. MR 1488695
  • R. Collobert and J. Weston, A unified architecture for natural language processing: deep neural networks with multitask learning, In Proceedings of the 25th international conference on Machine learning, 2008, pp. 160–167.
  • 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
  • Frank Deutsch, Best approximation in inner product spaces, CMS Books in Mathematics/Ouvrages de Mathématiques de la SMC, vol. 7, Springer-Verlag, New York, 2001. MR 1823556, DOI 10.1007/978-1-4684-9298-9
  • S. S. Du, X. Zhai, B. Poczos, and A. Singh, Gradient descent provably optimizes over-parameterized neural networks, International Conference on Learning Representations, 2019.
  • C. Fienup and J. Dainty, Phase Retrieval and Image Reconstruction for Astronomy, Image recovery: theory and application, 1987, pp. 231–275.
  • J. R. Fienup, Phase retrieval algorithms: a comparison, Appl. Opt. 21 (1982), no. 15, 2758–2769.
  • Bing Gao, Xinwei Sun, Yang Wang, and Zhiqiang Xu, Perturbed amplitude flow for phase retrieval, IEEE Trans. Signal Process. 68 (2020), 5427–5440. MR 4167993, DOI 10.1109/TSP.2020.3022817
  • R. W. Gerchberg, A practical algorithm for the determination of phase from image and diffraction plane pictures, Optik 35 (1972), 237–246.
  • S. Goel, V. Kanade, A. Klivans, and J. Thaler, Reliably learning the relu in polynomial time, In Conference on Learning Theory, 2017, pp. 1004–1042.
  • Ian Goodfellow, Yoshua Bengio, and Aaron Courville, Deep learning, Adaptive Computation and Machine Learning, MIT Press, Cambridge, MA, 2016. MR 3617773
  • 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
  • P. Hand, O. Leong, and V. Voroninski, Phase retrieval under a generative prior, In Advances in Neural Information Processing Systems, 2018, pp. 9136–9146.
  • R. W. Harrison, Phase problem in crystallography, JOSA A 10 (1993), no. 5, 1046–1055.
  • E. Hazan, K. Levy, and S. Shalev-Shwartz, Beyond convexity: Stochastic quasi-convex optimization, In Advances in Neural Information Processing Systems Vol. 28, 2015, pp. 1594–1602.
  • 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
  • K. Jarrett, K. Kavukcuoglu, M. Ranzato, and Y. LeCun, What is the best multi-stage architecture for object recognition? In 2009 IEEE 12th international conference on computer vision, 2009, pp. 2146–2153.
  • S. M. Kakade, V. Kanade, O. Shamir, and A. Kalai, Efficient learning of generalized linear and single index models with isotonic regression, In Advances in Neural Information Processing Systems, 2011, pp. 927–935.
  • A. T. Kalai and R. Sastry, The isotron algorithm: high-dimensional isotonic regression, In COLT, 2009.
  • Song Mei, Yu Bai, and Andrea Montanari, The landscape of empirical risk for nonconvex losses, Ann. Statist. 46 (2018), no. 6A, 2747–2774. MR 3851754, DOI 10.1214/17-AOS1637
  • J. Miao, T. Ishikawa, Q. Shen, and T. Earnest, Extending x-ray crystallography to allow the imaging of noncrystalline materials, cells, and single protein complexes, Annu. Rev. Phys. Chem. 59 (2008), 387–410.
  • R. P. Millane, Phase retrieval in crystallography and optics, JOSA A 7 (1990), no. 3, 394–411.
  • Praneeth Netrapalli, Prateek Jain, and Sujay Sanghavi, Phase retrieval using alternating minimization, IEEE Trans. Signal Process. 63 (2015), no. 18, 4814–4826. MR 3385838, DOI 10.1109/TSP.2015.2448516
  • S. Oymak and M. Soltanolkotabi, Towards moderate overparameterization: global convergence guarantees for training shallow neural networks, IEEE J. Selected Areas Inform. Theory 1 (2020), no. 1, 84–105.
  • F. Shamshad and A. Ahmed, Compressed sensing based robust phase retrieval via deep generative priors, IEEE Sensors J., 2020.
  • M. Soltanolkotabi, Learning relus via gradient descent, In Advances in Neural Information processing systems, 2017, pp. 2007–2017.
  • Vladislav Voroninski and Zhiqiang Xu, A strong restricted isometry property, with an application to phaseless compressed sensing, Appl. Comput. Harmon. Anal. 40 (2016), no. 2, 386–395. MR 3440178, DOI 10.1016/j.acha.2015.06.004
  • Adriaan Walther, The question of phase retrieval in optics, Optica Acta 10 (1963), 41–49 (English, with French and German summaries). MR 163589, DOI 10.1080/713817747
  • Gang Wang, Georgios B. Giannakis, and Yonina C. Eldar, Solving systems of random quadratic equations via truncated amplitude flow, IEEE Trans. Inform. Theory 64 (2018), no. 2, 773–794. MR 3762591, DOI 10.1109/TIT.2017.2756858
  • 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
  • G. Xu, H. Wu, and Y. Shi, Structural design of convolutional neural networks for steganalysis, IEEE Signal Process. Lett. 23 (2016), no. 5, 708–712.
  • H. Zhang and Y. Liang, Reshaped wirtinger flow for solving quadratic system of equations, In Advances in Neural Information Processing Systems, 1986, pp. 2622–2630.
Similar Articles
Bibliographic Information
  • Meng Huang
  • Affiliation: School of Mathematical Sciences, Beihang University, Beijing 100191, People’s Republic of China
  • ORCID: 0000-0003-2971-7585
  • Email: menghuang@buaa.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
  • Received by editor(s): May 5, 2021
  • Received by editor(s) in revised form: June 18, 2023
  • Published electronically: October 27, 2023
  • Additional Notes: The first author was supported by NSFC grant (12201022). The second author was supported by the National Science Fund for Distinguished Young Scholars (12025108), and by the NSFC (12021001,12288201).
    The second author is the corresponding author
  • © Copyright 2023 American Mathematical Society
  • Journal: Math. Comp. 93 (2024), 1247-1264
  • MSC (2020): Primary 94A15, 49K40; Secondary 65K05, 90C26
  • DOI: https://doi.org/10.1090/mcom/3918
  • MathSciNet review: 4709200