OpenAlex ·
Gaussian Critical-Threshold Instability in Real Phase Retrieval
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.28198
- Original
- Read it at the publisher
- Topics
Abstract
We establish the natural scale of instability in real Gaussian phase retrieval at the critical injectivity threshold. Let $A$ be a $(2M-1)\times M$ matrix with independent standard Gaussian entries and let $K_M=\binom{2M-1}{M}$. For every $w_M\to\infty$ with $\log w_M=o(M)$, we prove that $\mathbb{P}\{(w_M\sqrt{M}K_M)^{-1}\leω(A)\le w_M/(\sqrt{M}K_M)\}\to1$, where $ω(A)$ is the Balan--Wang stability parameter. Consequently, $-M^{-1}\logω(A)\to\log4$ in probability. For full-spark matrices at this threshold, $ω(A)$ equals both the optimal lower Lipschitz constant of $x\mapsto|Ax|$ and the minimum least singular value over all square row submatrices. The upper bound follows from a second-moment analysis of overlapping minors. A weighted Gaussian inverse-tail asymptotic and inverse-Wishart concentration yield asymptotic independence for central overlaps; rectangular hard-edge bounds control the remaining overlaps. The matching lower bound follows from a union bound and a square Gaussian hard-edge estimate.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Signal Processing
Sampling Line-Graph Colorings with Constant Extra Colors
Boolean threshold functions, neuron capacity, and memory retrieval
Distributed Stochastic Approximation Algorithms and Heavy-Tailed Age of Information
On the SoS Certifiability of Log-Concave Distributions
Robustness of Diffusion Models under Distribution Shift
Get the few papers worth your time in Signal Processing every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.