arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.04793cs.ITcs.LGmath.ITmath.OCmath.STstat.TH
收藏

线性反问题的精确时间-数据权衡

Sharp Time--Data Tradeoffs for Linear Inverse Problems

UC Berkeley(加州大学伯克利分校);Simons Institute for the Theory of Computing(西蒙斯计算理论研究所);University of Southern California(南加州大学)

Samet Oymak, Benjamin Recht, Mahdi Soltanolkotabi

摘要:

在本文中,我们刻画尖锐的时间-数据权衡用于求解线性反问题的优化问题。我们专注于最小化的最小二乘目标的约束定义为子水平集的惩罚函数。我们提出了一个统一的收敛性分析的梯度投影算法应用于此类问题。我们尖锐的特点与各种各样的随机测量合奏的测量和结构复杂性的信号相对于所选择的惩罚函数的数量方面的收敛速度。结果适用于凸约束和非凸约束,表明即使最小二乘目标在这些设置中不是强凸的,也可以达到线性收敛速度。当专门用于高斯测量时,我们的结果表明,当测量的数量仅仅是恢复所需信号所需的最小数量的4倍时,就会发生这种线性收敛(也称为“线性收敛”)。相变)。我们还实现了一个缓慢的,但几何收敛速度正好高于相变点。大量的数值结果表明,推导出的利率完全符合经验的表现。

英文摘要:

In this paper we characterize sharp time-data tradeoffs for optimization problems used for solving linear inverse problems. We focus on the minimization of a least-squares objective subject to a constraint defined as the sub-level set of a penalty function. We present a unified convergence analysis of the gradient projection algorithm applied to such problems. We sharply characterize the convergence rate associated with a wide variety of random measurement ensembles in terms of the number of measurements and structural complexity of the signal with respect to the chosen penalty function. The results apply to both convex and nonconvex constraints, demonstrating that a linear convergence rate is attainable even though the least squares objective is not strongly convex in these settings. When specialized to Gaussian measurements our results show that such linear convergence occurs when the number of measurements is merely 4 times the minimal number required to recover the desired signal at all (a.k.a. the phase transition). We also achieve a slower but geometric rate of convergence precisely above the phase transition point. Extensive numerical results suggest that the derived rates exactly match the empirical performance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑