The reviewed record of science sign in
Pith

arxiv: 2108.06846 · v1 · pith:STSULHPM · submitted 2021-08-16 · cs.LG

Do Proportionate Algorithms Exploit Sparsity?

Reviewed by Pithpith:STSULHPMopen to challenge →

classification cs.LG
keywords algorithmsproportionate-typesparsityveryactiveadaptiveaddressesadvantages
0
0 comments X
read the original abstract

Adaptive filters exploiting sparsity have been a very active research field, among which the algorithms that follow the "proportional-update principle", the so-called proportionate-type algorithms, are very popular. Indeed, there are hundreds of works on proportionate-type algorithms and, therefore, their advantages are widely known. This paper addresses the unexplored drawbacks and limitations of using proportional updates and their practical impacts. Our findings include the theoretical justification for the poor performance of these algorithms in several sparse scenarios, and also when dealing with non-stationary and compressible systems. Simulation results corroborating the theory are presented.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.