arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.03458cs.LGcs.DC
收藏

一种异步并行稀疏恢复方法

An Asynchronous Parallel Approach to Sparse Recovery

Claremont McKenna College(克莱蒙特麦肯纳学院);Claremont Graduate University(克莱蒙特研究生大学)

Deanna Needell, Tina Woolf

摘要:

异步并行计算和稀疏恢复是最近受到关注的两个领域。异步算法经常被研究来解决优化问题,其中成本函数采用$\sum_{i=1}^M f_i(x)$的形式,其中通常假设每个$f_i$是稀疏的;也就是说,每个$f_i$仅作用于$x\in\mathbb{R}^n$的少量分量。稀疏恢复问题(例如压缩感测)可以被公式化为优化问题,然而,成本函数$f_i$相对于$x$的分量是密集的,并且相反地,信号$x$被假设为稀疏的,这意味着它仅具有$s$非零,其中$s\ll n$。在这里,我们解决如何可以使用异步并行架构时,成本函数$f_i$不是稀疏的$x$,而是信号$x$是稀疏的。我们提出了一种异步并行方法稀疏恢复通过随机贪心算法,其中多个处理器异步更新共享内存中的向量包含信息的估计信号支持。我们包括数值模拟,说明我们提出的异步方法的潜在好处。

英文摘要:

Asynchronous parallel computing and sparse recovery are two areas that have received recent interest. Asynchronous algorithms are often studied to solve optimization problems where the cost function takes the form $\sum_{i=1}^M f_i(x)$, with a common assumption that each $f_i$ is sparse; that is, each $f_i$ acts only on a small number of components of $x\in\mathbb{R}^n$. Sparse recovery problems, such as compressed sensing, can be formulated as optimization problems, however, the cost functions $f_i$ are dense with respect to the components of $x$, and instead the signal $x$ is assumed to be sparse, meaning that it has only $s$ non-zeros where $s\ll n$. Here we address how one may use an asynchronous parallel architecture when the cost functions $f_i$ are not sparse in $x$, but rather the signal $x$ is sparse. We propose an asynchronous parallel approach to sparse recovery via a stochastic greedy algorithm, where multiple processors asynchronously update a vector in shared memory containing information on the estimated signal support. We include numerical simulations that illustrate the potential benefits of our proposed asynchronous method.

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

↑