[论文解读] Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems

Yuxin Chen, Emmanuel J. Candès|arXiv (Cornell University)|May 19, 2015

Soil Geostatistics and Mapping参考文献 50被引用 89

一句话总结

该论文提出了一种新颖的非凸优化算法，用于求解随机二次方程组，通过自适应阈值化和定制的目标函数，实现线性时间收敛。在温和条件下，当方程数量超过变量数量的常数倍时，该方法以高概率恢复真实解，其计算复杂度与求解线性系统相当。

ABSTRACT

We consider the fundamental problem of solving quadratic systems of equations in $n$ variables, where $y_i = |\\langle \\boldsymbol{a}_i, \\boldsymbol{x} \ angle|^2$, $i = 1, \\ldots, m$ and $\\boldsymbol{x} \\in \\mathbb{R}^n$ is unknown. We propose a novel method, which starting with an initial guess computed by means of a spectral method, proceeds by minimizing a nonconvex functional as in the Wirtinger flow approach. There are several key distinguishing features, most notably, a distinct objective functional and novel update rules, which operate in an adaptive fashion and drop terms bearing too much influence on the search direction. These careful selection rules provide a tighter initial guess, better descent directions, and thus enhanced practical performance. On the theoretical side, we prove that for certain unstructured models of quadratic systems, our algorithms return the correct solution in linear time, i.e. in time proportional to reading the data $\\{\\boldsymbol{a}_i\\}$ and $\\{y_i\\}$ as soon as the ratio $m/n$ between the number of equations and unknowns exceeds a fixed numerical constant. We extend the theory to deal with noisy systems in which we only have $y_i \\approx |\\langle \\boldsymbol{a}_i, \\boldsymbol{x} \ angle|^2$ and prove that our algorithms achieve a statistical accuracy, which is nearly un-improvable. We complement our theoretical study with numerical examples showing that solving random quadratic systems is both computationally and statistically not much harder than solving linear systems of the same size---hence the title of this paper. For instance, we demonstrate empirically that the computational cost of our algorithm is about four times that of solving a least-squares problem of the same size.

研究动机与目标

• 为解决在仅有幅度测量可用的条件下求解二次方程组的计算挑战，这是相位恢复和信号恢复中的常见问题。
• 开发一种高效且非凸的优化方法，避免此类系统中最大似然估计的计算不可行性。
• 在对设计向量假设最少的条件下，实现随机二次方程组的线性时间收敛。
• 将该方法扩展至噪声环境，确保统计精度接近理论极限。

提出的方法

• 算法从谱初始化开始，以获得解的优良初始猜测。
• 采用针对二次方程组结构量身定制的非凸目标函数，与Wirtinger流等先前方法不同。
• 自适应更新规则动态剔除可能过度影响搜索方向的项，从而提高收敛稳定性。
• 回溯线搜索确保每次迭代中目标函数充分下降，且对步长选择具有理论保证。
• 该方法采用截断的经验风险最小化，聚焦于对下降贡献最可靠的项。
• 理论分析依赖于大维随机矩阵理论中的集中不等式和误差项的精细控制。

实验结果

研究问题

• RQ1 在实践中，能否高效求解随机二次方程组，使其计算成本接近线性系统的水平？
• RQ2 采用自适应阈值化的非凸优化方法是否在收敛速度和精度方面优于标准方法？
• RQ3 在随机二次方程组中，恢复真实解的最小方程数量是多少（以高概率）？
• RQ4 在噪声测量下，该算法表现如何，特别是在成像应用中常见的泊松模型下？
• RQ5 在噪声条件下，该方法能否实现接近不可改进的统计精度？

主要发现

• 当方程与变量的比值超过某个固定数值常数时，该算法以线性时间恢复真实解，即时间与读取数据的时间成正比。
• 对于噪声系统，该方法实现了接近不可改进的统计精度，其性能与Cramér-Rao下界仅相差对数因子。
• 实验上，计算成本约为同等规模最小二乘问题的四倍。
• 理论分析表明，在较弱的随机设计假设下，该算法以高概率收敛至真实解。
• 自适应阈值化与目标函数设计使初始猜测更精确，下降方向更优，从而显著提升实际性能。