{'fraction_non_alphanumeric': 0.009560229445506692, 'fraction_numerical': 0.0, 'mean_word_length': 5.55, '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}}
A recurrent Newton algorithm and its convergence properties

In this paper a recurrent Newton algorithm for an important class of recurrent neural networks is introduced. It is noted that a suitable constraint must be imposed on recurrent variables to ensure proper convergence behavior. The simulation results show that the proposed Newton algorithm with the suggested constraint performs uniformly better than the backpropagation algorithm and the Newton algorithm without the constraint, in terms of mean-squared errors.