用满秩随机矩阵求解复二次系统
Solving Complex Quadratic Systems with Full-Rank Random Matrices
摘要:
我们解决的问题,从二次测量的形式$y_i=\boldsymbol x^*\boldsymbol A_i\boldsymbol x$,其中$\boldsymbol A_i$是一个满秩,复杂的随机测量矩阵的条目是从旋转不变的子高斯分布产生的恢复一个复杂的信号$\boldsymbol x\in\mathbb{C}^n$。我们将其表述为非凸损失的最小化。这个问题涉及到众所周知的相位恢复问题,其中测量矩阵是秩1半正定矩阵。在这里,我们研究了一般的满秩的情况下,模型的一些关键应用,如分子几何恢复的距离分布和化合物测量无相衍射成像。大多数先前的作品要么解决秩1的情况下,或专注于实际测量。解决满秩复杂情况的几篇论文采用了计算要求高的半定松弛方法。在本文中,我们证明了旋转不变的子高斯测量模型的一般类的问题,可以有效地解决高概率通过标准的框架,包括一个频谱初始化,然后迭代Wirtinger流更新的非凸损失。模拟数据的数值实验证实了我们的理论分析。
英文摘要:
We tackle the problem of recovering a complex signal $\boldsymbol x\in\mathbb{C}^n$ from quadratic measurements of the form $y_i=\boldsymbol x^*\boldsymbol A_i\boldsymbol x$, where $\boldsymbol A_i$ is a full-rank, complex random measurement matrix whose entries are generated from a rotation-invariant sub-Gaussian distribution. We formulate it as the minimization of a nonconvex loss. This problem is related to the well understood phase retrieval problem where the measurement matrix is a rank-1 positive semidefinite matrix. Here we study the general full-rank case which models a number of key applications such as molecular geometry recovery from distance distributions and compound measurements in phaseless diffractive imaging. Most prior works either address the rank-1 case or focus on real measurements. The several papers that address the full-rank complex case adopt the computationally-demanding semidefinite relaxation approach. In this paper we prove that the general class of problems with rotation-invariant sub-Gaussian measurement models can be efficiently solved with high probability via the standard framework comprising a spectral initialization followed by iterative Wirtinger flow updates on a nonconvex loss. Numerical experiments on simulated data corroborate our theoretical analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。