{'fraction_non_alphanumeric': 0.013289036544850499, 'fraction_numerical': 0.0, 'mean_word_length': 5.216494845360825, '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}}
Convergence analysis of the LMS algorithm with a general error nonlinearity and an IID input

The class of least mean square (LMS) algorithms employing a general error nonlinearity is considered. A linearization approach is used to characterize the convergence and performance of this class of algorithms for an independent and identically distributed (IID) input. The analysis results are entirely consistent with those of the LMS algorithm and several of its variants. The results also encompass those of a previous work that considered the same class of algorithms for arbitrary and Gaussian inputs.