{'fraction_non_alphanumeric': 0.030707610146862484, 'fraction_numerical': 0.0013351134846461949, 'mean_word_length': 5.048387096774194, '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}}
Efficient adaptive filtering for smooth linear FIR models

This paper proposes the Smooth Gradient Descent (SGD) algorithm for recursively identifying a linear Finite Impulse Response (FIR) model with a large set of parameters (`long impulse response'). The main thesis is that a successful design of such adaptive filter must hinge on (i) the choice of a proper loss function, and (ii) the choice of a proper norm for the impulse response vector. Theoretical backup for this statement is found in slightly improving and interpreting the regret bound of the Gradient Descent (GD) algorithm presented in [3]. In practice, if the impulse response vector is known to be smooth in some apriori defined sense, the proposed algorithm will converge faster.