用于稀疏相位恢复的Hadamard Wirtinger流
Hadamard Wirtinger Flow for Sparse Phase Retrieval
摘要:
我们考虑的问题重建一个$n$维$k$稀疏信号从一组无噪声的幅度只有测量。将问题描述为一个非正则化的经验风险最小化任务,研究了Hadamard参数化梯度下降算法的样本复杂度性能,我们称之为Hadamard Wirtinger流(HWF).提供的知识的信号稀疏$k$,我们证明了一个单一的步骤HWF是能够恢复支持从$k(x^*_{max})^{-2}$(模对数项)样本,其中$x^*_{max}$是最大的组成部分的信号的幅度。该支持恢复过程可以用于初始化现有的重建方法,并产生具有与读取数据的成本成比例的总运行时间和改进的样本复杂度的算法,当信号包含至少一个大分量时,该算法在$k$中是线性的。我们数值研究的性能HWF在收敛和表明,而不需要任何明确的形式的正则化,也没有知识的$k$,HWF适应信号稀疏性和重建稀疏信号与现有的基于梯度的方法相比,测量更少。
英文摘要:
We consider the problem of reconstructing an $n$-dimensional $k$-sparse signal from a set of noiseless magnitude-only measurements. Formulating the problem as an unregularized empirical risk minimization task, we study the sample complexity performance of gradient descent with Hadamard parametrization, which we call Hadamard Wirtinger flow (HWF). Provided knowledge of the signal sparsity $k$, we prove that a single step of HWF is able to recover the support from $k(x^*_{max})^{-2}$ (modulo logarithmic term) samples, where $x^*_{max}$ is the largest component of the signal in magnitude. This support recovery procedure can be used to initialize existing reconstruction methods and yields algorithms with total runtime proportional to the cost of reading the data and improved sample complexity, which is linear in $k$ when the signal contains at least one large component. We numerically investigate the performance of HWF at convergence and show that, while not requiring any explicit form of regularization nor knowledge of $k$, HWF adapts to the signal sparsity and reconstructs sparse signals with fewer measurements than existing gradient based methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。