{'fraction_non_alphanumeric': 0.020278833967046894, 'fraction_numerical': 0.0025348542458808617, 'mean_word_length': 5.9298245614035086, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Low-complexity proportionate algorithms with sparsity-promoting penalties

There are two main families of algorithms that tackle the problem of sparse system identification: the proportionate family and the one that employs sparsity-promoting penalty functions. Recently, a new approach was proposed with the l0-IPAPA algorithm, which combines proportionate updates with sparsity-promoting penalties. This paper proposes some modifications to the l0-IPAPA algorithm in order to decrease its computational complexity while preserving its good convergence properties. Among these modifications, the inclusion of a data-selection mechanism provides promising results. Some enlightening simulation results are provided in order to verify and compare the performance of the proposed algorithms.