鲁棒线性回归分析——一种贪婪方法
Robust Linear Regression Analysis - A Greedy Approach
AI总结:
本文针对含异常值的鲁棒线性估计问题,提出贪婪算法GARD,通过最小二乘与OMP交替识别异常值,并给出精确恢复、收敛性和误差界理论及仿真验证。
摘要:
在存在异常值的情况下进行鲁棒线性估计的任务,在信号处理、统计学和机器学习中尤为重要。尽管该问题在几十年前就已被提出,并通过经典(如今被视为传统的)方法得到解决,但近来它在稀疏建模的背景下引起了更多关注,并在该领域取得了若干显著贡献。在本手稿中,我们在贪婪算法的框架内考虑了一种新方法。噪声被分解为两个组成部分:a)有界的内点噪声,以及 b)异常值,后者通过利用稀疏性论证进行显式建模。基于该方案,我们推导出一种新颖高效的算法(用于鲁棒去噪的贪婪算法——GARD)。GARD在最小二乘优化准则与用于识别异常值的正交匹配追踪(OMP)选择步骤之间交替进行。文中单独研究了仅存在异常值的情形,此时关于受限等距性质(Restricted Isometry Property)的界保证了通过GARD对信号的恢复是精确的。此外,还讨论了有关收敛性以及在存在额外有界噪声情况下误差界推导的理论结果。最后,我们提供了大量仿真,证明了该新技术的比较优势。
英文摘要:
The task of robust linear estimation in the presence of outliers is of particular importance in signal processing, statistics and machine learning. Although the problem has been stated a few decades ago and solved using classical (considered nowadays) methods, recently it has attracted more attention in the context of sparse modeling, where several notable contributions have been made. In the present manuscript, a new approach is considered in the framework of greedy algorithms. The noise is split into two components: a) the inlier bounded noise and b) the outliers, which are explicitly modeled by employing sparsity arguments. Based on this scheme, a novel efficient algorithm (Greedy Algorithm for Robust Denoising - GARD), is derived. GARD alternates between a least square optimization criterion and an Orthogonal Matching Pursuit (OMP) selection step that identifies the outliers. The case where only outliers are present has been studied separately, where bounds on the \textit{Restricted Isometry Property} guarantee that the recovery of the signal via GARD is exact. Moreover, theoretical results concerning convergence as well as the derivation of error bounds in the case of additional bounded noise are discussed. Finally, we provide extensive simulations, which demonstrate the comparative advantages of the new technique.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。