arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.01696cs.DS
收藏

惩罚可调的稀疏性集员自适应算法研究

Study of Sparsity-Aware Set-Membership Adaptive Algorithms with Adjustable Penalties

André Flores, Rodrigo C. de Lamare

摘要:

在本文中,我们提出了稀疏感知的数据选择性自适应滤波算法与可调罚款。之前的工作将惩罚函数纳入优化中使用的成本函数中,该优化产生了算法,通过利用稀疏性来提高其性能。然而,惩罚函数的强度由标量控制,该标量通常是固定参数。与之前的工作相比,我们开发了一个框架来导出自动调整惩罚函数参数和步长以实现更好性能的算法。对系统辨识应用的仿真结果表明,该算法在收敛速度上优于现有的稀疏感知算法。

英文摘要:

In this paper, we propose sparsity-aware data-selective adaptive filtering algorithms with adjustable penalties. Prior work incorporates a penalty function into the cost function used in the optimization that originates the algorithms to improve their performance by exploiting sparsity. However, the strength of the penalty function is controlled by a scalar that is often a fixed parameter. In contrast to prior work, we develop a framework to derive algorithms that automatically adjust the penalty function parameter and the step size to achieve a better performance. Simulations for a system identification application show that the proposed algorithms outperform in convergence speed existing sparsity-aware algorithms.

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

↑