arXiv Analytics

Sign in

arXiv:2003.11514 [cs.LG]AbstractReferencesReviewsResources

Robustness Analysis of the Data-Selective Volterra NLMS Algorithm

Javad Sharafi, Abbas Maarefparvar

Published 2020-03-25Version 1

Recently, the data-selective adaptive Volterra filters have been proposed; however, up to now, there are not any theoretical analyses on its behavior rather than numerical simulations. Therefore, in this paper, we analyze the robustness (in the sense of l2-stability) of the data-selective Volterra normalized least-mean-square (DS-VNLMS) algorithm. First, we study the local robustness of this algorithm at any iteration, then we propose a global bound for the error/discrepancy in the coefficient vector. Also, we demonstrate that the DS-VNLMS algorithm improves the parameter estimation for the majority of the iterations that an update is implemented. Moreover, we prove that if the noise bound is known, we can set the DS-VNLMS so that it never degrades the estimate. The simulation results corroborate the validity of the executed analysis and demonstrate that the DS-VNLMS algorithm is robust against noise, no matter how its parameters are adopted.

Related articles: Most relevant | Search more
arXiv:1907.06010 [cs.LG] (Published 2019-07-13)
The Futility of Bias-Free Learning and Search
arXiv:1912.10552 [cs.LG] (Published 2019-12-22)
Hierarchical Target-Attentive Diagnosis Prediction in Heterogeneous Information Networks
arXiv:1507.04208 [cs.LG] (Published 2015-07-15)
Combinatorial Cascading Bandits