arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1406.7728math.STstat.MLstat.TH
收藏

基于微分包含的稀疏恢复

Sparse Recovery via Differential Inclusions

Stanley Osher, Feng Ruan, Jiechao Xiong, Yuan Yao, Wotao Yin

摘要:

本文基于应用数学中的逆尺度空间(inverse scale space,ISS)概念,通过求解非线性微分包含,从噪声线性测量中恢复稀疏信号。我们的目标是把这个想法,以解决一个具有挑战性的问题,在统计学,\emph{i.e.}发现的oracle估计,这是无偏的和符号一致的使用动态。我们称之为\emph{Bregman ISS}和\emph{Linearized Bregman ISS}。LASSO和任何凸正则化方法的一个众所周知的缺点在于估计量的偏差。然而,我们表明,在适当的条件下,存在一个无偏和符号一致的点上的解决方案的动力学,这对应于一个信号,这是真实信号的无偏估计,其条目具有相同的符号作为那些真正的迹象,\emph{i.e.}的预言估计。因此,它们的解路径是比LASSO正则化路径更好的正则化路径,因为当达到符号一致性时,后者路径上的点是有偏的。我们还展示了如何有效地计算他们的解决方案路径在连续和离散设置:完整的解决方案路径可以精确计算一块一块,和离散化导致\emph{Linearized Bregman iteration},这是一个简单的迭代阈值规则,易于并行化。理论上的保证,如签署一致性和最小最大最优$l_2$ -错误的界限,建立在连续和离散设置的路径上的特定点。给出了识别这些点的提前停止规则。关键的处理依赖于微分包含及其离散化的微分不等式的发展,这推广了以前的结果,并导致指数快速恢复稀疏信号之前选择错误的。

英文摘要:

In this paper, we recover sparse signals from their noisy linear measurements by solving nonlinear differential inclusions, which is based on the notion of inverse scale space (ISS) developed in applied mathematics. Our goal here is to bring this idea to address a challenging problem in statistics, \emph{i.e.} finding the oracle estimator which is unbiased and sign-consistent using dynamics. We call our dynamics \emph{Bregman ISS} and \emph{Linearized Bregman ISS}. A well-known shortcoming of LASSO and any convex regularization approaches lies in the bias of estimators. However, we show that under proper conditions, there exists a bias-free and sign-consistent point on the solution paths of such dynamics, which corresponds to a signal that is the unbiased estimate of the true signal and whose entries have the same signs as those of the true signs, \emph{i.e.} the oracle estimator. Therefore, their solution paths are regularization paths better than the LASSO regularization path, since the points on the latter path are biased when sign-consistency is reached. We also show how to efficiently compute their solution paths in both continuous and discretized settings: the full solution paths can be exactly computed piece by piece, and a discretization leads to \emph{Linearized Bregman iteration}, which is a simple iterative thresholding rule and easy to parallelize. Theoretical guarantees such as sign-consistency and minimax optimal $l_2$-error bounds are established in both continuous and discrete settings for specific points on the paths. Early-stopping rules for identifying these points are given. The key treatment relies on the development of differential inequalities for differential inclusions and their discretizations, which extends the previous results and leads to exponentially fast recovering of sparse signals before selecting wrong ones.

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

↑