Answers are grounded in this paper and cite their sources.
This letter presents the exact normalized least-mean-square (NLMS) algorithm for the lp-norm-regularized square error, a popular choice for the identification of sparse systems corrupted by additive noise. The resulting exact lp-NLMS algorithm manifests differences to the original one, such as an independent update for each weight, a new sparsity-promoting compensated update, and the guarantee of stable convergence for any configuration (regardless the choice of lp norm and sparsity-tradeoff constant). Simulation results show that the exact lp-NLMS is stable and it outperforms the original one, thus validating the optimality of the proposed methodology.
No takes yet. Share an insight, caveat, or question.
Weruaga et al. (2014) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: