arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0909.0777math.NAcs.ITcs.MScs.NAmath.IT
收藏

压缩感知的最优调参迭代重建算法

Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing

Stanford University(斯坦福大学)

Arian Maleki, David L. Donoho

AI总结:

通过大规模计算实验,为求解欠定线性方程组稀疏解的迭代硬/软阈值算法及CoSaMP等算法优化参数,实现了无需用户调参的最优调参版本,并在相变意义上达到最高性能。

摘要:

我们进行了一项持续多个CPU年的大规模计算实验,以最优选择两类重要算法的参数,这些算法用于寻找欠定线性方程组的稀疏解。我们在{ t sparselab.stanford.edu}上提供了最优调参的实现;它们可以“开箱即用”,无需用户调参:无需选择阈值或了解可能的稀疏度。我们的算法类别包括带或不带松弛的迭代硬阈值和软阈值,以及CoSaMP、子空间追踪和一些自然扩展。因此,我们的最优调参算法优于这些提案。我们的最优性概念由相变定义,即我们最大化算法能够成功运行的非零元素数量。我们表明,对于我们的随机欠定线性系统套件,相变是一个定义良好的量。我们的调参在每类算法中实现了尽可能高的相变。

英文摘要:

We conducted an extensive computational experiment, lasting multiple CPU-years, to optimally select parameters for two important classes of algorithms for finding sparse solutions of underdetermined systems of linear equations. We make the optimally tuned implementations available at {\tt sparselab.stanford.edu}; they run `out of the box' with no user tuning: it is not necessary to select thresholds or know the likely degree of sparsity. Our class of algorithms includes iterative hard and soft thresholding with or without relaxation, as well as CoSaMP, subspace pursuit and some natural extensions. As a result, our optimally tuned algorithms dominate such proposals. Our notion of optimality is defined in terms of phase transitions, i.e. we maximize the number of nonzeros at which the algorithm can successfully operate. We show that the phase transition is a well-defined quantity with our suite of random underdetermined linear systems. Our tuning gives the highest transition possible within each class of algorithms.

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

↑